LeetCode_167: Two Sum II - Input Array Is Sorted | Two Pointer Approach

In this video, I solve LeetCode Problem 167 - Two Sum II: Input Array Is Sorted using the Two Pointer approach in JavaScript. 🔍 What you'll learn: -Why HashMap is not the optimal solution here -How constant extra space affects solution choice -Using Two Pointers on a sorted array -Why JavaScript arrays still use 0-based indexing -Why we return [l + 1, r + 1] for 1-indexed output 💡 At first, I tried thinking about the HashMap solution because I solved the normal Two Sum problem that way before. But later I noticed the question required constant extra space, so I switched to the Two Pointer technique. 💡 We use one pointer from the beginning and one from the end, then move them inward depending on the current sum. ⏱ Time Complexity: O(n) 📦 Space Complexity: O(1) 📚 Problem Link: https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/ 🚀 A very common interview problem for learning Two Pointer optimization on sorted arrays. #leetcode #dsa #twopointers #javascript #arrays #coding #algorithms