LeetCode
Experience
#987 Vertical Order Traversal of a Binary Tree
Interview Experience
LeetCode #987: Vertical Order Traversal of a Binary Tree. Difficulty: Hard. Topics: Hash Table, Tree, Depth-First Search, Breadth-First Search, Sorting, Binary Tree. Asked at Oracle 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 Tree
Breadth-First Search
Depth-First Search
Tree
Binary Tree
Graph
Hash Table
Sorting
More from Oracle
1p3a
Oracle Software Engineer 3 Technical Interview, 6 YOE, Rejected, Q3 2025
1p3a
Oracle OCI SMTS Interview Experience with 5 YOE System Design and Coding
1p3a
Oracle OCI IC3 Software Engineer Interview Experience Networking Team
1p3a
Oracle Senior Application Developer Interview Questions and Experience
1p3a
Oracle Senior Software Engineer Technical Phone Interview Throttling Design