[Optimize the code]: Have implemented the program to find the final string after removing all the occurrences of a substring:.

Author: rajgohil07

.idea/workspace.xml

@@ -12,18 +12,21 @@ public static void main(String[] args) {
         StringBuilder ans = new StringBuilder(s);
 
         // Logic.
-        recursiveStringReplace(ans, part);
+        recursiveStringReplace(ans, part, 0);
 
         // Display the result.
         System.out.println("The final string after removing all the occurrences of a substring: " + ans + ".");
     }
 
     // Recursive call the function itself to replace the string with the part.
-    private static void recursiveStringReplace(StringBuilder s, String part) {
-        for (int i = 0; i <= s.length() - part.length(); i++) {
+    private static void recursiveStringReplace(StringBuilder s, String part, int startIndex) {
+        for (int i = startIndex; i <= s.length() - part.length(); i++) {
             if (s.substring(i, i + part.length()).equals(part)) {
                 s.delete(i, i + part.length());
-                recursiveStringReplace(s, part);
+                if (i - part.length() > 0) {
+                    startIndex = i - part.length();
+                }
+                recursiveStringReplace(s, part, startIndex);
             }
         }
     }