Today I solved LeetCode 21: Merge Two Sorted Lists, a classic linked-list problem that is great for strengthening pointer manipulation and understanding how linked lists work. The goal is simple: given two sorted linked lists, merge them into a single sorted linked list. For example: Input: List 1: [1,2,4] List 2: [1,3,4] Output: [1,1,2,3,4,4] I solved this using a dummy node and a current pointe…
Consistency is the key to becoming a better programmer, and today I’m excited to share another successful milestone in my coding journey! 🎯I successfully solved the Roman to Integer problem on LeetCode using JavaScript, achieving an Accepted status with all 3999 test cases passed.🔍 What I Learned:The problem focuses on converting Roman numerals into their corresponding integer values. Roman numer…
Another problem solved and another step forward in my coding journey! 💻Today, I successfully solved LeetCode Problem 9: Palindrome Number using JavaScript.The challenge was to determine whether a given integer reads the same forward and backward.For example:✅ Input: 121 → Output: true❌ Input: -121 → Output: false❌ Input: 10 → Output: false💡 My ApproachI used a mathematical approach to reverse the…
The goal is simple but requires a smart approach: given a string, find the length of the longest substring that contains no repeated characters. For example: "abcabcbb" → 3 ("abc") "bbbbb" → 1 ("b") "pwwkew" → 3 ("wke") Instead of checking every possible substring, I solved it using the Sliding Window + Hash Map technique. 💡 How the approach works I maintain two important variables: 🔹 start — rep…
