Search for a command to run...
Series
LeetCode Grind is my journey of mastering DSA for Google interviews. I share problem breakdowns from NeetCode 150 & Google-tagged sets with clear approaches, complexities, and notes for lasting learning.
📌 Introduction In this post, we'll solve LeetCode 5: Longest Palindromic Substring.We'll cover the expand around centers approach and analyze the time and space complexities.Code examples will be in JavaScript, with step-by-step explanations. 👉 Ori...
📌 Introduction In this post, we’ll solve LeetCode 11. Container With Most Water. We’ll cover the brute force approach, the optimized solution, and analyze the time and space complexities. Code examples will be in JavaScript, with step-by-step explan...
📌 Introduction In this post, we’ll solve LeetCode 169: Majority Element. We’ll cover a straightforward brute-force approach, an optimized solution using the Boyer-Moore Voting Algorithm, and analyze the time and space complexities for each. Code exa...
📌 Introduction In this post, we’ll solve LeetCode 283. Move Zeroes. We’ll cover a two-pointer approach, and analyze the time and space complexities. Code examples will be in JavaScript, with step-by-step explanations. 👉 Original problem link: LeetC...
📌 Introduction In this post, we’ll solve LeetCode 383. Ransom Note. We’ll cover a frequency map approach, and analyze the time and space complexities. Code examples will be in JavaScript, with step-by-step explanations. 👉 Original problem link: Lee...
📌 Introduction In this post, we’ll solve LeetCode 58. Length of Last Word. We’ll cover a string manipulation approach, and analyze the time and space complexities. Code examples will be in JavaScript, with step-by-step explanations. 👉 Original prob...