GAURAV YADAVgaurav246blogs.hashnode.dev·Dec 25, 2023151 DSA Problem JourneyQ16:Given an array Arr of N positive integers and another number X. Determine whether or not there exist two elements in Arr whose sum is exactly X. Example : Input: N = 6, X = 16 Arr[] = {1, 4, 45, 6, 10, 8} Output: Yes Explanation: Arr[3] + Arr[4] ...14 likesC++Add a thoughtful commentNo comments yetBe the first to start the conversation.