Java Array Pair Sum Problem : Solving for K
Given an array , check if there exists a pair (i,j )such that arr[i] + arr[j] == k and i != j
#ds #data structure #dsa-n-design #data strcuture in java #linked list in java
If you liked this video , Please subscribe, share and like as a token of appreciaition to my work which fuels me with encourgement and enormous energy to work harder.
Playlists available :
DSA - Linked List
• Linked List