JS Problem#1 (#2) (#30)

Author: AbdullahYaqub72

Python/isPalindrome.py

@@ -1,12 +1,17 @@
+#Name: Abdullah Yaqub
+#Username: AbdullahYaqub72
+#Approach: Comparing arrays while traversing in forward and reverse order
+
 class Solution:
-    def isPalindrome(self, x: int) -> bool:
-        flag=True
-        y=str(x)
-        for i in range(0,len(y)-1):
+    def isPalindrome(self, num: int) -> bool:
+        isPalind=True
+        y=str(num)
+        for i in range(len(y)-1):
             ind=len(y)-i-1
-            if(y[i]==y[ind]):
-                flag=True
-            else:
-                flag=False
+            if(y[i]!=y[ind]):
+                isPalind=False
                 break
-        return flag
+            else:
+                isPalind=True
+                
+        return isPalind