Search for a command to run...
Series
A 30-day journey to learn Data Structures and Algorithms using JavaScript. Each day, I’ll solve LeetCode problems, identify the underlying DSA patterns, analyze time and space complexity, and practice explaining solutions as I would in a technical interview.
Today I started my 30 Days of DSA with JavaScript journey. My goal is not just to solve LeetCode problems, but to understand the patterns behind the problems, analyze time and space complexity, and le
Welcome to Day 2 of my 30 Days of DSA with JavaScript. On Day 1, I started with basic array problems. Today, I moved into String problems and learned several important problem-solving patterns. The ma
1. Two Sum — LeetCode 1 Problem Given an array of integers and a target, return the indices of two numbers whose sum equals the target. Approach For every number, I calculate the value I need: needed
Day 4 of my 30 Days of DSA with JavaScript journey. Today, I continued practicing Hashing, Set, and Frequency Counting patterns. The problems I solved today show how hash-based data structures can be
Day 5 of my 30 Days of DSA with JavaScript journey. Today, I learned and practiced the Two Pointers pattern. The two-pointer technique uses two indexes to traverse an array or string efficiently. Depe
Day 6 of my DSA journey focuses on the Two Pointers pattern and how it can be used to solve different types of array and string problems efficiently. Today, I solved 5 LeetCode problems: Container Wi
