ASAbirami Sriinabi-blog.hashnode.dev·Sep 24 · 13 min readDay 13 of My DSA Journey — Linked List Operations & Pointer ManipulationAfter practicing basic Linked List problems like reversing a list, finding the middle, detecting cycles, and finding intersections, today I went deeper into Linked List operations and pointer manipula00
ASAbirami Sriinabi-blog.hashnode.dev·Sep 23 · 7 min readDay 12 0f My DSA Journey with JavaScript — Linked List PatternsToday I practiced one of the most important data structures in DSA: Linked List. Unlike arrays, linked lists don't store elements using indexes. Each node contains a value and a reference to the next 00
ASAbirami Sriinabi-blog.hashnode.dev·Sep 16 · 12 min readDay 10 of My 30-Day DSA Journey - Sliding Window PatternDay 10 of my DSA journey with JavaScript focuses on Variable-Size Sliding Window. In Day 7, I learned the fixed-size Sliding Window pattern, where the window size was always k. Today, I worked with a 00
ASAbirami Sriinabi-blog.hashnode.dev·Sep 6 · 11 min readDay 6 of My 30-Day DSA Journey — Two Pointers & Array PatternsDay 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 Wi00
ASAbirami Sriinabi-blog.hashnode.dev·Sep 5 · 9 min readDay 5 of My 30-Day DSA Journey — Two PointersDay 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. Depe00
VVVidit Vatsindsa-decoded.hashnode.dev·Aug 25 · 4 min readLC-18 4SumGiven an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that: 0 <= a, b, c, d < n a, b, c, and d are distinct. nums[a] + nums[b] +00
SPSneha Poojaryindsamadesimple.hashnode.dev·Aug 20 · 7 min readTwo Pointers Explained: The Proof Nobody Shows YouEvery algorithm blog on the internet tells you how to move two pointers. Virtually none of them prove why you're allowed to move them, or why the exact same structural logic manages unacknowledged byt00
AAnnetinhtml-portfolio.hashnode.dev·Aug 4 · 4 min readMastering the Two Pointers Technique in Python (With Easy Examples)When I first started solving coding problems, I noticed that many array and string questions looked different but could actually be solved using the same approach: Two Pointers. Instead of using neste00
RKRohit Kumharintech-rohit.hashnode.dev·Jul 23 · 38 min readMaster the Two Pointers Pattern in Python (Part 1): Two Sum, Squares of Sorted Array & Remove DuplicatesIntroduction If you've spent time solving coding interview problems, you've probably noticed a common pattern: many array problems seem to invite a nested loop solution. While that approach works, it 10
VVVidit Vatsindsa-decoded.hashnode.dev·Jul 16 · 5 min readLC-15 3Sum ProblemGiven an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not conta00
