<ul><li>Given an unsorted array, and a key, find 2 elements such that the difference between the elements is equal to the key.</li><li>The problem can be solved using two approaches: brute force method and sorting.</li><li>In the brute force method, two nested loops are used to compare each pair of elements and check if the difference matches the key.</li><li>In the sorting approach, the array is first sorted in ascending order and then a two-pointer technique is used to find the elements with the desired difference.</li></ul>

Given an unsorted array, and a key. Find 2 elements such that the difference between the elements is equal to the key.

Discover more