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,939 questions

51,876 answers

573 users

How to find all triplets with zero sum in a given array with TypeScript

1 Answer

0 votes
function findTripletsWith0Sum(arr: number[]) {
    let found: boolean = false;
    const size: number = arr.length;
    
    for (let i: number = 0; i < size - 2; i++) {
        for (let j: number = i + 1; j < size - 1; j++) {
            for (let k: number = j + 1; k < size; k++) {
                if (arr[i] + arr[j] + arr[k] == 0) {
                    console.log(arr[i] + " + " + arr[j] + " + " + arr[k]);
                    found = true;
                }
            }
        }
    }
    
    if (found == false) {
        console.log("Not found");
    }
}
        
const arr: number[] = [1, 0, 3, 2, -1, -2, -3, 4];

findTripletsWith0Sum(arr);





/*
run:
 
"1 + 0 + -1" 
"1 + 2 + -3" 
"0 + 3 + -3" 
"0 + 2 + -2" 
"3 + -1 + -2" 
"-1 + -3 + 4" 
 
*/

 



answered May 23, 2023 by avibootz

Related questions

1 answer 130 views
1 answer 125 views
1 answer 123 views
1 answer 119 views
1 answer 100 views
1 answer 107 views
...