LeetCode Experience

#406 Queue Reconstruction by Height

SWE coding Medium

Interview Experience

LeetCode #406: Queue Reconstruction by Height. Difficulty: Medium. Topics: Array, Binary Indexed Tree, Segment Tree, Sorting. Asked at Google in the last 6 months.

Original Source

This is a frequency-tagged signal. The full problem statement lives on the original source.

View original →

Topics

Binary Indexed Tree Segment Tree Arrays Queue Sorting

More from Google

Reddit Why did you create those day in a life video? Reddit It works Reddit Brave Software director screening went south fast, these companies are weird Reddit Job finished Reddit Anxiety and brain freeze during interview

← All Google questions Google Software Engineer Questions → All Arrays,Queue,Sorting,Segment Tree Questions →