Available question text
Given a permutation P of length N, determine for each k (1 ≤ k ≤ N) if k is balanced, where k is balanced if there exists a contiguous subarray that forms a permutation of numbers 1 to k. Return a binary string where the i-th character is '1' if k is balanced, otherwise '0'.
Related questions
Continue with questions that share topics or the same question type.
- Find All Lonely Numbers in the Array
Coding · Array · Counting · Hash Table
- Find All Numbers Disappeared in an Array
Coding
- Find Lexicographically Smallest Permutation Maximizing Information Gain
Coding
- Find Median Given Frequency of Numbers
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Uber
Find Balanced Numbers in a Permutation
Reported Feb 8, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source