function serviceLane(n: number, cases: number[][], width: number[]): number[] {
    // Write your code here
    let answer: number[] = [];
    for(let i = 0; i < cases.length; i++) {
        const arr = width.slice(cases[i][0], cases[i][1]+1);
        answer.push(Math.min(...arr));
    }
    return answer;
}

    public static List<Integer> serviceLane(int n, List<List<Integer>> cases, List<Integer> width) {
        // Write your code here
        List<Integer> list = new ArrayList<>();

        for (List<Integer> aCase : cases) {
            int min = width.get(aCase.get(0));

            for (int j = aCase.get(0); j <= aCase.get(1); j++)
                if (width.get(j) < min)
                    min = width.get(j);

            list.add(min);
        }
        return list;
    }

 public static List<Integer> sol(List<Integer> width, List<List<Integer>> cases) {
        List<Integer> res = new ArrayList<>();
        for (int i = 0; i < cases.size(); i++) {
            List<Integer> l = new ArrayList<>();
            for (int j = cases.get(i).get(0); j <= cases.get(i).get(1); j++) {
                l.add(width.get(j));
            }
            res.add(Collections.min(l));

        }
        return res;
    }

def serviceLane(n, cases):
    return [min(width[c[0]:c[1]+1]) for c in cases]