diff --git a/Task1/Python/Probelm1.py b/Task1/Python/Probelm1.py
index ece0b90..3dcfb66 100644
--- a/Task1/Python/Probelm1.py
+++ b/Task1/Python/Probelm1.py
@@ -25,14 +25,15 @@
 '''
 
 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
\ No newline at end of file
+        return number == reversed_number
+    
\ No newline at end of file
diff --git a/Task2/Python/Problem2.py b/Task2/Python/Problem2.py
index 7dc4d54..df40b24 100644
--- a/Task2/Python/Problem2.py
+++ b/Task2/Python/Problem2.py
@@ -34,14 +34,19 @@
 
 '''
 
+from typing import List
+
 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:
+            digit[-1] += 1
+            return digit
+        elif len(digit) == 1 and digit[0] == 9:
             return [1, 0]
         else:
-            digits[-1] = 0
-            digits[0:-1] == self.plusOne(digits[0:-1])
-            returns digit
\ No newline at end of file
+            digit[-1] = 0
+            digit[0:-1] == self.plusOne(digit[0:-1])
+            return digit
+        
+abc= Solution()
+print(abc.plusOne([9,8,9]))
diff --git a/Task5/Python/Problem5.py b/Task5/Python/Problem5.py
index 7d45404..a64d3dd 100644
--- a/Task5/Python/Problem5.py
+++ b/Task5/Python/Problem5.py
@@ -39,6 +39,31 @@
 
 #Complete given code, not need to change class name and method name.
 
+import random
 class Solution:
     def isScramble(self, s1: str, s2: str) -> bool:
-        return 1
\ No newline at end of file
+        if len(s1)<=1:
+            return -1
+        else:   
+            lst=[]
+            for i in s1:
+                lst.append(i)
+            length = len(lst)
+            lst2=[]
+            for i in s2:
+                lst2.append(i)
+            length1 = len(lst2)
+
+            while length>=0:
+                for i in lst:
+                    if lst[i] != lst2[i]:
+                        print(i)
+            
+            if len(s2)==len(s1):
+                return True
+            else:
+                return False
+
+
+abc = Solution()
+print(abc.isScramble("abcde","acbde"))