Available question text
Given S1 = "0" and Si = S{i-1} + "1" + reverse(invert(S{i-1})), return the k-th bit of S_n. Use the string's length (2^n−1) and its central symmetry/inversion property to compute the bit recursively by reflecting k across the middle and flipping bits as needed, avoiding full string construction.
Related questions
Continue with questions that share topics or the same question type.
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
No company association
Leetcode 1545. Find Kth Bit in Nth Binary String
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source