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

51,875 answers

573 users

How to find all the possible rows which are permutations of a given row in a matrix with TypeScript

1 Answer

0 votes
function printPermutationRows(matrix: number[][], givenrow: number) {
    const rows: number = matrix.length;
    const cols: number = matrix[0].length;

    let st = new Set<number>();
    
    for (let j: number = 0; j < cols; j++) {
        st.add(matrix[givenrow][j]);
    }
    
    for (let i: number = 0; i < rows; i++) {
        if (i == givenrow) {
            continue;
        }
        let j: number = 0;
        for (; j < cols; j++) {
            if (!st.has(matrix[i][j])) {
                break;
            }
        }
        if (j != cols) {
            continue;
        }
        
        console.log(i);
    }
}
    
const givenrow: number = 1;

const matrix: number[][] = [[7, 9, 4, 3, 1], 
                            [4, 7, 9, 1, 3], 
                            [4, 7, 8, 1, 2], 
                            [1, 6, 9, 7, 4], 
                            [9, 1, 3, 7, 4]];
        
printPermutationRows(matrix, givenrow);




/*
run:

0
4

*/

 



answered Feb 21, 2024 by avibootz
...