serviceLane.js

// source: https://www.hackerrank.com/challenges/service-lane/problem
// video: https://youtu.be/1nLHUwp_k80

function serviceLane(n, width, cases) {
    const output = []
    
    for(const [start, end] of cases){ // O(c); c = number of cases
        let min = Infinity
        for(let i = start; i <= end; i++){ // O(n); n = number of widths 
            min = Math.min(min, width[i])
        }
        output.push(min)
    }
    return output
    // TOTOL TIME COMPLEXITY: O(c) * O(n) = O(c*n)
}