Done some bug fixing in Task 1 2 and 5

.vscode/settings.json

@@ -0,0 +1,3 @@
+{
+    "java.debug.settings.onBuildFailureProceed": true
+}

Task1/Python/Probelm1.py

@@ -25,14 +25,20 @@
 '''
 
 class Solution(object):
-    def isPalindrome(self, y):
+    def isPalindrome(self,x):
         if x < 0:
-            return True
+            return False
         reversed_number = 0
         number = x
         while x > 0:
             digit = x % 10
             x = x // 10
-            reversed_number == reversed_number * 10 + digit
+            reversed_number = reversed_number * 10 + digit
 
-        return number = reversed_number
+        return number == reversed_number
+
+s=Solution()
+x=int(input("Enter your number to check:"))
+print(s.isPalindrome(x))
+
+

Task2/Python/Problem2.py

@@ -34,14 +34,16 @@
 
 '''
 
-class Solution:
-    def plusOne(self, digit: List[int]) -> List[int]:
-        if digit[-1] < 9:
-            digits[-1] += 1
-            returns digit
-        elseif len(digits) == 1 and digits[0] == 9:
-            return [1, 0]
-        else:
-            digits[-1] = 0
-            digits[0:-1] == self.plusOne(digits[0:-1])
-            returns digit
+class Solution(object):
+    def plusOne(self, digits):
+        for i in range(len(digits)-1, -1, -1):
+            if digits[i] == 9:
+                digits[i] = 0
+            else:
+                digits[i] += 1
+                return digits
+        return [1] + digits
+input=input("Enter the list of digit seperated by spaces:")
+digits=list(map(int,input.split()))
+s=Solution()
+print(s.plusOne(digits))

Task5/Python/Problem5.py

@@ -38,7 +38,21 @@
 '''
 
 #Complete given code, not need to change class name and method name.
-
 class Solution:
     def isScramble(self, s1: str, s2: str) -> bool:
-        return 1
+
+        def dfs(i: int, j: int, k: int) -> bool:
+            if k == 1:
+                return s1[i] == s2[j]
+            for h in range(1, k):
+                if dfs(i, j, h) and dfs(i + h, j + h, k - h):
+                    return True
+                if dfs(i + h, j, k - h) and dfs(i, j + k - h, h):
+                    return True
+            return False
+
+        return dfs(0, 0, len(s1))
+s=Solution()
+x=str(input("Enter first string:"))
+y=str(input("Enter second string:"))
+print(s.isScramble(x,y))