diff --git a/submissions/Vratej-Dwivedi/Palindrome-Number/Screenshot (21).png b/submissions/Vratej-Dwivedi/Palindrome-Number/Screenshot (21).png
new file mode 100644
index 0000000..6a7c546
Binary files /dev/null and b/submissions/Vratej-Dwivedi/Palindrome-Number/Screenshot (21).png differ
diff --git a/submissions/Vratej-Dwivedi/Palindrome-Number/Screenshot (22).png b/submissions/Vratej-Dwivedi/Palindrome-Number/Screenshot (22).png
new file mode 100644
index 0000000..b7a3bea
Binary files /dev/null and b/submissions/Vratej-Dwivedi/Palindrome-Number/Screenshot (22).png differ
diff --git a/submissions/Vratej-Dwivedi/Palindrome-Number/Screenshot (23).png b/submissions/Vratej-Dwivedi/Palindrome-Number/Screenshot (23).png
new file mode 100644
index 0000000..fcf7e41
Binary files /dev/null and b/submissions/Vratej-Dwivedi/Palindrome-Number/Screenshot (23).png differ
diff --git a/submissions/Vratej-Dwivedi/Palindrome-Number/solution4.py b/submissions/Vratej-Dwivedi/Palindrome-Number/solution4.py
new file mode 100644
index 0000000..9488611
--- /dev/null
+++ b/submissions/Vratej-Dwivedi/Palindrome-Number/solution4.py
@@ -0,0 +1,19 @@
+class Solution(object):
+    def isPalindrome(self, n):
+        """
+        :type n: int
+        :rtype: bool
+        """
+        # Negative numbers and numbers ending in 0 (except 0 itself) are not palindromes
+        if n < 0 or (n % 10 == 0 and n != 0):
+            return False
+
+        rev_half = 0
+        while n > rev_half:
+            rev_half = rev_half * 10 + n % 10
+            n = n // 10
+
+        # For even length numbers: n == rev_half
+        # For odd length numbers: n == rev_half // 10
+        return n == rev_half or n == rev_half // 10
+
diff --git a/submissions/Vratej-Dwivedi/Valid-Palindrome/Screenshot (18).png b/submissions/Vratej-Dwivedi/Valid-Palindrome/Screenshot (18).png
new file mode 100644
index 0000000..8552b12
Binary files /dev/null and b/submissions/Vratej-Dwivedi/Valid-Palindrome/Screenshot (18).png differ
diff --git a/submissions/Vratej-Dwivedi/Valid-Palindrome/Screenshot (19).png b/submissions/Vratej-Dwivedi/Valid-Palindrome/Screenshot (19).png
new file mode 100644
index 0000000..6a2f220
Binary files /dev/null and b/submissions/Vratej-Dwivedi/Valid-Palindrome/Screenshot (19).png differ
diff --git a/submissions/Vratej-Dwivedi/Valid-Palindrome/Screenshot (20).png b/submissions/Vratej-Dwivedi/Valid-Palindrome/Screenshot (20).png
new file mode 100644
index 0000000..7f1eabb
Binary files /dev/null and b/submissions/Vratej-Dwivedi/Valid-Palindrome/Screenshot (20).png differ
diff --git a/submissions/Vratej-Dwivedi/Valid-Palindrome/solution3.py b/submissions/Vratej-Dwivedi/Valid-Palindrome/solution3.py
new file mode 100644
index 0000000..43140ca
--- /dev/null
+++ b/submissions/Vratej-Dwivedi/Valid-Palindrome/solution3.py
@@ -0,0 +1,17 @@
+class Solution(object):
+    def validPalindrome(self, s):
+        """
+        :type s: str
+        :rtype: bool
+        """
+        def is_palindrome(sub):
+            return sub == sub[::-1]
+
+        l, r = 0, len(s) - 1
+        while l < r:
+            if s[l] != s[r]:
+                return is_palindrome(s[l+1:r+1]) or is_palindrome(s[l:r])
+            l += 1
+            r -= 1
+        return True
+