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 …
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…
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…
Today’s challenge was LeetCode – Zigzag Conversion, a great problem for practicing string manipulation, arrays, loops, and direction-based traversal in JavaScript. The problem gives us a string and a number of rows. We need to arrange the characters in a zigzag pattern and then read the characters row by row to generate the final string. For example: PAYPALISHIRING With numRows = 3, the character…
The problem involves adding two numbers represented by linked lists, where each node contains a single digit. The digits are stored in reverse order, and the result must also be returned as a linked list. For example: Input: l1 = [2,4,3] l2 = [5,6,4] Output: [7,0,8] This problem may look simple at first, but it requires careful handling of several important concepts: 🔹 Linked List Traversal I lea…
