Improved tasks 2546-2551

Author: javadev

src/main/java/g2501_2600/s2546_apply_bitwise_operations_to_make_strings_equal/Solution.java

@@ -2,7 +2,7 @@
 
 // #Medium #String #Bit_Manipulation #2023_08_15_Time_0_ms_(100.00%)_Space_44.3_MB_(87.14%)
 
-class Solution {
+public class Solution {
     public boolean makeStringsEqual(String s, String target) {
         return s.contains("1") == target.contains("1");
     }

src/main/java/g2501_2600/s2547_minimum_cost_to_split_an_array/Solution.java

@@ -3,7 +3,7 @@
 // #Hard #Array #Hash_Table #Dynamic_Programming #Counting
 // #2023_08_15_Time_32_ms_(98.70%)_Space_44.3_MB_(66.23%)
 
-class Solution {
+public class Solution {
     public int minCost(int[] nums, int k) {
         int[] dp = new int[nums.length + 1];
         for (int startPos = nums.length - 1; startPos >= 0; startPos--) {

src/main/java/g2501_2600/s2549_count_distinct_numbers_on_board/Solution.java

@@ -2,7 +2,7 @@
 
 // #Easy #Array #Hash_Table #Math #Simulation #2023_08_15_Time_0_ms_(100.00%)_Space_39.2_MB_(75.23%)
 
-class Solution {
+public class Solution {
     public int distinctIntegers(int n) {
         if (n == 1) {
             return 1;

src/main/java/g2501_2600/s2550_count_collisions_of_monkeys_on_a_polygon/Solution.java

@@ -2,7 +2,7 @@
 
 // #Medium #Math #Recursion #2023_08_15_Time_0_ms_(100.00%)_Space_39.3_MB_(62.81%)
 
-class Solution {
+public class Solution {
     public int monkeyMove(int n) {
         return (int) ((((modPow2(n - 2) - 1) << 2) + 2) % 1000000007);
     }

src/main/java/g2501_2600/s2551_put_marbles_in_bags/Solution.java

@@ -5,7 +5,7 @@
 
 import java.util.Arrays;
 
-class Solution {
+public class Solution {
     public long putMarbles(int[] weights, int k) {
         long minAns = weights[0] + (long) weights[weights.length - 1];
         long maxAns = weights[0] + (long) weights[weights.length - 1];