This problem is an excellent example of how choosing the right algorithm can significantly improve performance and efficiency. 📌 Problem Overview: Given an array of non-negative integers representing the heights of vertical lines, the goal is to find two lines that, together with the x-axis, can hold the maximum amount of water. The challenge is to maximize the area between two lines while consid…
Today, I successfully solved the Median of Two Sorted Arrays problem on LeetCode using JavaScript and an optimized binary search approach. The challenge is to find the median of two sorted arrays without simply merging them. The goal is to achieve an efficient time complexity of O(log(min(m, n))), making the solution suitable even for large input arrays. 💡 My Approach: Apply binary search to the …
The problem is simple to understand but great for practicing recursion. Each digit from 2 to 9 represents a set of letters, similar to the keys on a traditional phone keypad. For example, 2 maps to abc and 3 maps to def. For the input "23", the expected combinations are: ["ad","ae","af","bd","be","bf","cd","ce","cf"] 💡 Approach I first created a phoneMap object to store the letter mapping for eac…
Today I worked on the Valid Parentheses problem, a classic problem that tests stack-based problem-solving and logical thinking. The goal is simple: determine whether a string containing (), {}, and [] is valid. A string is valid when every opening bracket has the correct closing bracket, and the brackets are properly nested. I solved this using a Stack in JavaScript. Whenever an opening bracket a…
Today’s challenge was to find the longest common prefix shared by all strings in an array. I implemented the solution in JavaScript and successfully passed all 126 test cases. The approach is straightforward and easy to understand. I started with the first string as the reference and compared each of its characters with the corresponding character in every other string. If a character does not ma…
The problem looks simple at first, but it is a great example of how choosing the right data structure can make a solution both clean and efficient. The goal is to determine whether a string containing (), {}, and [] is valid. Every opening bracket must have the correct closing bracket, and brackets must close in the proper order. I solved it using a Stack. The approach is straightforward: Create …
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…
The approach uses a greedy algorithm with Roman numeral values arranged from largest to smallest, including special combinations such as: 1000 → M 900 → CM 500 → D 400 → CD 100 → C 90 → XC 50 → L 40 → XL 10 → X 9 → IX 5 → V 4 → IV 1 → I The algorithm repeatedly checks whether the current number is greater than or equal to a Roman numeral value. If it is, that symbol is added to the result and the…
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 nu…
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 Approach I used a mathematical approach to rev…
