Two Sum II | Two Sum 2 || Leetcode Problem 167 | C++ Solution | Optimal Solution

Problem Statement: Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index1] and numbers[index2]. Problem Link: https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/ We have solved this problem in C++ and discussed the most optimal solution i.e. two pointer approach. I have also shared Two Sum solution link for the other two approaches. Two Sum Link: https://youtu.be/nnJkCMRQN4I?feature=shared 00:00 : Introduction 01:03: Solution 06:22 : Coding #leetcode #leetcodequestionandanswers #leetcodequestions #leetcodesolution #leetcodechallenge #twosum #twosum