Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,890 questions

51,821 answers

573 users

How to find if there is a pair in sorted array with sum equal to a given sum in TypeScript

1 Answer

0 votes
function isPairWithAGivenSum(arr, sum) {
    const size = arr.length;
    
    for (let i = 0; i < size; i++) {
        for (let j = 0; j < size; j++) {
            if (i == j) {
                continue;
            }
            if (arr[i] + arr[j] == sum) {
                console.log("i = " + i + " j = " + j);
                return true;
            }
            if (arr[i] + arr[j] > sum) {
                break;
            }
        }
    }
    return false;
}
        
const arr = [3, 5, 6, 8, 9, 12, 13, 15];
const sum = 17;

console.log(isPairWithAGivenSum(arr, sum));





/*
run:

i = 1 j = 5
true

*/

 



answered Apr 23, 2023 by avibootz
...