Using hashmap implementation | Finding distinct element pair with given sum in sorted array

In this video we will implement solution for finding distinct element pair with given sum in sorted array using hashmap based approach.

This approach is also useful when given array is not sorted and we have to find pair with target sum in that array.

In next video we will see one another approaches implementation where array given will not be sorted and still we use two pointers pattern for solving problem.

JAVA tutorials for beginners:
Video:

Reading:

Also feel free to connect with me: