CareerCup

let matrix = [[1, 0, 0, 0], [1, 1, 0, 0], [0, 1, 1, 0], [1, 1, 1, 1]]
let lastx = 0
let lasty = 0
for (let i = lastx; i < matrix.length; i++) {
    const row = matrix[i];
    for (let j = lasty; j < matrix[0].length; j++) {
        const item = row[j];
        if (j + 1 <= row.length && row[j + 1] == 1) {
            lastx = i
            lasty = j + 1
            console.log(lastx, lasty)

            continue
        }
        if (i + 1 < matrix.length && matrix[i + 1][j] == 1) {
            lastx = i + 1
            lasty = j
            console.log(lastx, lasty)

            break
        }
    }
}

let pairs = [["S", 3], ["H", 4], ["S", 4], ["D", 5], ["D", 1],["S",5]]

function findPair(pair, index, sequence) {
    let suit = pair[0]
    let snum = pair[1]
    for (let n = 0; n < pairs.length; n++) {
        if (n == index) continue

        const ipair = pairs[n];
        let isuit = ipair[0]
        let isnum = ipair[1]
        if (sequence[isuit + "_" + isnum]) continue

        if (suit == isuit) {
            sequence[isuit + "_" + isnum] = true
            findPair(ipair, n, sequence)
        }
        if (snum == isnum) {
            sequence[isuit + "_" + isnum] = true
            findPair(ipair, n, sequence)
        }
    }
    return sequence
}

const element = pairs[0];
let sequence = {}
sequence[element[0] + "_" + element[1]] = true
let s= findPair(element, 0, sequence)
console.log(Object.keys(s).length)