Practice Uber Coding Question | Real Coding Interviews

Quick Summary

Determine for each k from 1 to n whether the values 1 through k occupy a contiguous segment in the permutation.
Output a binary array where each entry indicates if the corresponding prefix set forms a valid contiguous subarray.
The large constraint (up to 10^5) demands an O(n) time solution rather than brute-force subarray checks.

What This Tests

Common Patterns

Hashing

Greedy

Test Cases

Input

Output

Expected