added

Author: anujvaghani0

aap.java

@@ -0,0 +1,44 @@
+import java.io.BufferedReader;
+import java.io.BufferedWriter;
+import java.io.File;
+import java.io.FileReader;
+import java.io.FileWriter;
+import java.io.IOException;
+
+public class FileContentReplacer {
+    public static void main(String[] args) {
+        String directoryPath = "DSA";
+        String searchString = "newString";
+        String replacementString = "newString";
+
+        /// Get all the Java files in the directory
+        File directory = new File(directoryPath);
+        File[] files = directory.listFiles((dir, name) -> name.endsWith(".java"));
+
+        if (files != null) {
+            for (File file : files) {
+                try {
+                    /// Read the file
+                    BufferedReader reader = new BufferedReader(new FileReader(file));
+                    StringBuilder content = new StringBuilder();
+                    String line;
+                    while ((line = reader.readLine()) != null) {
+                        /// Replace the search string with the replacement string
+                        line = line.replace(searchString, replacementString);
+                        content.append(line).append("\n");
+                    }
+                    reader.close();
+
+                    /// Write the modified content back to the file
+                    BufferedWriter writer = new BufferedWriter(new FileWriter(file));
+                    writer.write(content.toString());
+                    writer.close();
+
+                    System.out.println("Modified file: " + file.getAbsolutePath());
+                } catch (IOException e) {
+                    e.printStackTrace();
+                }
+            }
+        }
+    }
+}

src/Arrays/AddToArrayFormofInteger.java

@@ -17,6 +17,6 @@ public static List<Integer> addToArrayForm(int[] num, int k) {
             ans.add(0, (i >= 0 ? num[i] + k : k) % 10);
             k = (i >= 0 ? num[i] + k : k) / 10;
         }
-        return ans;
+        return  ans;
     }
-}
+}

src/Arrays/ApplyOperationsToAnArray.java

@@ -18,7 +18,7 @@ public static int[] applyOperations(int[] nums) {
             }
         }
         moveZero(nums);
-        return nums;
+        return  nums;
     }
 
     private static void moveZero(int[] nums) {

src/Arrays/ArmstrongNumber.java

@@ -32,6 +32,6 @@ public static int size(int n){
             leg++;
             n=n/10;
         }
-        return leg;
+        return  leg;
     }
 }

src/Arrays/ArrayNesting.java

@@ -17,6 +17,6 @@ public static int arrayNesting(int[] nums) {
             }
             count = Integer.max(count, size);
         }
-        return count;
+        return  count;
     }
 }

src/Arrays/ArrayPairSumDivisibilityProblem.java

@@ -10,7 +10,7 @@ public static void main(String[] args) {
 
     public static boolean canPair(int[] nums, int k) {
         if (nums.length % 2 == 1) {
-            return false;
+            return  false;
         }
 
         int[] temp = new int[100001];
@@ -25,9 +25,9 @@ public static boolean canPair(int[] nums, int k) {
 
         for (int i = 0; i < temp.length; i++) {
             if (temp[i] > 0) {
-                return false;
+                return  false;
             }
         }
-        return true;
+        return  true;
     }
 }

src/Arrays/ArrayPartition.java

@@ -14,6 +14,6 @@ public static int arrayPairSum(int[] nums) {
         for (int i = 0; i < nums.length - 1; i += 2) {
             ans += Math.min(nums[i], nums[i + 1]);
         }
-        return ans;
+        return  ans;
     }
-}
+}

src/Arrays/BestTimeToBuyAndSellStock.java

@@ -16,6 +16,6 @@ public static int maxProfit(int[] prices) {
             int profit = prices[i] - difference;
             maximumProfit = Math.max(maximumProfit, profit);
         }
-        return maximumProfit;
+        return  maximumProfit;
     }
-}
+}

src/Arrays/BuyTwoChocolates.java

@@ -12,7 +12,7 @@ public static void main(String[] args) {
     public static int buyChoco(int[] prices, int money) {
         Arrays.sort(prices);
         if ((prices[0] + prices[1]) <= money)
-            return (money - (prices[0] + prices[1]));
-        return money;
+            return  (money - (prices[0] + prices[1]));
+        return  money;
     }
 }

src/Arrays/CanMakeArithmeticProgressionFromSequence.java

@@ -10,16 +10,16 @@ public static void main(String[] args) {
     public static boolean canMakeArithmeticProgression(int[] arr) {
         Arrays.sort(arr);
         if (arr.length == 1) {
-            return true;
+            return  true;
         }
 
         int diff = arr[1] - arr[0];
 
         for (int i = 2; i < arr.length; i++) {
             if (arr[i] - arr[i - 1] != diff) {
-                return false;
+                return  false;
             }
         }
-        return true;
+        return  true;
     }
 }

src/Arrays/CheckIfAWordOccursAsaPrefixofAnyWordInASentence.java

@@ -16,6 +16,6 @@ public static int isPrefixOfWord(String sentence, String searchWord) {
                 break;
             }
         }
-        return count;
+        return  count;
     }
-}
+}

src/Arrays/CheckIfAll1sAreAtLeastLengthKPlacesAway.java

@@ -13,13 +13,13 @@ public static boolean kLengthApart(int[] nums, int k) {
         for (int i = 0; i < nums.length; i++) {
             if (nums[i] == 1) {
                 if (spaces < k) {
-                    return false;
+                    return  false;
                 }
                 spaces = 0;
             } else {
                 spaces++;
             }
         }
-        return true;
+        return  true;
     }
 }

src/Arrays/CheckIfMatrixIsXMatrix.java

@@ -13,13 +13,13 @@ public static boolean checkXMatrix(int[][] grid) {
             for (int j = 0; j < n; j++) {
                 if (i == j || i + j == n - 1) {
                     if (grid[i][j] == 0) {
-                        return false;
+                        return  false;
                     }
                 } else if (grid[i][j] != 0) {
-                    return false;
+                    return  false;
                 }
             }
         }
-        return true;
+        return  true;
     }
-}
+}

src/Arrays/CheckIfStringIsAPrefixOfArray.java

@@ -13,12 +13,12 @@ public static boolean isPrefixString(String s, String[] words) {
         for (String word : words) {
             ans.append(word);
             if (s.equals(ans.toString())) {
-                return true;
+                return  true;
             }
             if (!s.contains(ans.toString())) {
-                return false;
+                return  false;
             }
         }
-        return false;
+        return  false;
     }
 }

src/Arrays/CheckIfTheNumberIsFascinating.java

@@ -0,0 +1,31 @@
+package Arrays;
+
+import java.util.HashSet;
+import java.util.Set;
+
+public class CheckIfTheNumberIsFascinating {
+    public static void main(String[] args) {
+
+    }
+
+    public static boolean isFascinating(int n) {
+        String n2 = String.valueOf(2 * n);
+        String n3 = String.valueOf(3 * n);
+        String str = n + n2 + n3;
+        if (str.contains("0")) {
+            return  false;
+        }
+
+        Set<Integer> set = new HashSet<>();
+        for (int i = 0; i < str.length(); i++) {
+            set.add((int) str.charAt(i));
+        }
+
+        if (set.size() != str.length()) {
+            return  false;
+        }
+
+        return  true;
+
+    }
+}

src/Arrays/CkIfArrayIsSortedAndRotated.java

@@ -13,9 +13,9 @@ public static boolean check(int[] nums) {
                 k++;
             }
             if (k > 1) {
-                return false;
+                return  false;
             }
         }
-        return true;
+        return  true;
     }
 }

src/Arrays/ConcatenationofArray.java

@@ -14,6 +14,6 @@ public static int[] getConcatenation(int[] nums) {
         for (int i=0;i<nums.length;i++){
             ans[nums.length+i]=nums[i];
         }
-        return ans;
+        return  ans;
     }
 }

src/Arrays/ContainsDuplicate.java

@@ -10,10 +10,10 @@ public static boolean containsDuplicate(int[] nums) {
         for (int i = 0; i < nums.length - 1; i++) {
             for (int j = i + 1; j < nums.length; j++) {
                 if (nums[i] == nums[j]) {
-                    return true;
+                    return  true;
                 }
             }
         }
-        return false;
+        return  false;
     }
 }

src/Arrays/ConvertTheTemperature.java

@@ -11,6 +11,6 @@ public static double[] convertTemperature(double celsius) {
         double[] ans = new double[2];
         ans[0] = celsius + 273.15;
         ans[1] = celsius * 1.80 + 32.00;
-        return ans;
+        return  ans;
     }
 }

src/Arrays/CountGoodTriplets.java

@@ -17,6 +17,6 @@ public static int countGoodTriplets(int[] arr, int a, int b, int c) {
                 }
             }
         }
-        return count;
+        return  count;
     }
 }

src/Arrays/CountNicePairsInAnArray.java

@@ -15,7 +15,7 @@ public static int countNicePairs(int[] nums) {
                 }
             }
         }
-        return count;
+        return  count;
     }
 
 
@@ -26,6 +26,6 @@ public static int reverse(int n) {
             sum = (sum * 10) + rem;
             n = n / 10;
         }
-        return sum;
+        return  sum;
     }
 }

src/Arrays/CountPairsWithGivenSum.java

@@ -23,6 +23,6 @@ public static int getPairsCount(int[] arr, int n, int k) {
                 right--;
             }
         }
-        return count;
+        return  count;
     }
 }

src/Arrays/CountPrefixesOfAGivenString.java

@@ -15,6 +15,6 @@ public static int countPrefixes(String[] words, String s) {
                 count++;
             }
         }
-        return count;
+        return  count;
     }
 }

src/Arrays/CountingWordsWithAGivenPrefix.java

@@ -15,6 +15,6 @@ public static int prefixCount(String[] words, String pref) {
                 count++;
             }
         }
-        return count;
+        return  count;
     }
 }

src/Arrays/CreateTargetArrayInTheGivenOrder.java

@@ -22,7 +22,7 @@ public static int[] createTargetArray(int[] nums, int[] index) {
             }
             ans[ind] = nums[i];
         }
-        return ans;
+        return  ans;
     }
 }
 
@@ -36,4 +36,4 @@ public static int[] createTargetArray(int[] nums, int[] index) {
 //        for (int i = 0; i < nums.length; i++) {
 //            target[i] = list.get(i);
 //        }
-//        return target;
+//        return  target;

src/Arrays/DecompressRunLengthEncodedList.java

@@ -22,7 +22,7 @@ public static int[] decompressRLElist(int[] nums) {
             Arrays.fill(results, startIndex, startIndex + nums[i], nums[i + 1]);
             startIndex += nums[i];
         }
-        return results;
+        return  results;
 
 
 //        List<Integer> temp = new ArrayList<>();
@@ -38,6 +38,6 @@ public static int[] decompressRLElist(int[] nums) {
 //        for (int i = 0; i < temp.size(); i++) {
 //            ans[i] = temp.get(i);
 //        }
-//        return ans;
+//        return  ans;
     }
 }

src/Arrays/DefuseTheBomb.java

@@ -31,6 +31,6 @@ public static int[] decrypt(int[] code, int k) {
             sum -= code[(start++) % code.length];
             sum += code[(++end) % code.length];
         }
-        return ans;
+        return  ans;
     }
 }

src/Arrays/DistanceBetweenBusStops.java

@@ -20,6 +20,6 @@ public static int distanceBetweenBusStops(int[] distance, int start, int destina
             }
             total += distance[i];
         }
-        return Math.min(ans, total - ans);
+        return  Math.min(ans, total - ans);
     }
-}
+}

src/Arrays/DistributeMoneyToMaximumChildren.java

@@ -7,7 +7,7 @@ public static void main(String[] args) {
 
 //    public static int distMoney(int money, int children) {
 //            if (money<children){
-//                return -1;
+//                return  -1;
 //            }
 //
 //            int[] arr=new int[children];