https://aaronice.gitbook.

io/lintcode/
2 Sum (INPUT = Sorted 1 D Array)(OUTPUT = POSITION)

https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/submissions/ Time: O(N) Space: O(1)

class Solution {
public:
vector<int> twoSum(vector<int>& numbers, int target) {
int i,j;
vector<int>vec;
sort(numbers.begin(),numbers.end());
i=0,j=numbers.size()-1;
while(i<j){
if(numbers[i]+numbers[j] > target) j--;
else if (numbers[i]+numbers[j] < target) i++;
else if(numbers[i]+numbers[j] == target){
vec={i+1,j+1};
break;
}
}
return vec;

}
};

2 Sum (INPUT = UNSorted 1 D Array)(OUTPUT = INDEX)

https://leetcode.com/problems/two-sum/submissions/

class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector <int> vec;
int i,n=nums.size();
unordered_map<int,int> map;
for(i=0;i<n;i++){
if(map.find(target-nums[i])!=map.end())// element ke topke esechi
{
vec={map[target-nums[i]],i};
break;
}
else
map[nums[i]]=i;
}
return vec;
}
};
Total No of Possible Pairs with Absolute Difference K
https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k/

Total No of Unique Possible Pairs with Absolute Difference K

https://leetcode.com/problems/k-diff-pairs-in-an-array/

Number of Pairs of Strings With Concatenation Equal to Target

https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/

 Subarray Sum Equals K

https://leetcode.com/problems/subarray-sum-equals-k/