Overview This is the technique which uses 2 pointers, the first one is located at beginning of the array, the second one is located at the end of the array. 2 pointer will move toward together to resolve the problem Example: Given a sorted array [1, 3, 8, 9, 10], check if exist the pair that sum is given target (12). For the bruth force, we can use 2 pointer i and j which j = i+1 then each element arr[i] check any arr[j] which sum to targe. By this way we took 2 for loop so

Hi my name is Hung, I am a software engineer with roundly 4 years of experient. I want to create a blog to sharing my knowledge about DSA, SD and another stuff. Hope I can get the new job in this year in the big tech company. Happy new year and try hard to get to new job and change my life At the end of the road is darker but it is my home which is very warm