Google came on campus. We had an online coding round where we had to solve two coding questions within one hour. The difficulty, I would say, was hard. Then, after a few days, I got an email stating I was selected for the interview.

Given a sequence S of N digits, find a subsequence of K digits such that the number formed by these K digits (in order) is the largest.

Given an integer array of size N, there will be Q operations. Each operation contains a range [L, R], both inclusive, where L and R are valid indices and L <= R. For each query, you must choose a subset of indices in the range [L, R] and subtract 1 from the array values at the selected indices.

An array is called a Zero Array if A[i] = 0 for all 0 <= i <= N-1 after Q operations. Implement a function to check whether it is possible to make the given array a Zero Array after performing the given Q operations.