Available question text
Given a binary sequence that evolves each row by replacing 0→01 and 1→10 (so row lengths double each time), return the k-th symbol in the n-th row without constructing the full row. The challenge is to use the parent-child recursion or bit-parity of flips (rather than building the string) to determine the symbol efficiently.
Related questions
Continue with questions that share topics or the same question type.
- Add Binary
Coding · Bit Manipulation · Math · Simulation
- Add Two Numbers
Coding · Linked List · Math · Recursion
- Basic Calculator III
Coding · Math · Recursion · Stack
- Find the Winner of the Circular Game
Coding · Array · Math · Queue
Sources · 2 references
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 779. K-th Symbol in Grammar
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
D. E. Shaw
K-th Symbol in Grammar
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 91.4. This is not an interview probability.
View source