LeetCode Experience

#105 Construct Binary Tree from Preorder and Inorder Traversal

SWE coding Medium

Interview Experience

LeetCode #105: Construct Binary Tree from Preorder and Inorder Traversal. Difficulty: Medium. Topics: Array, Hash Table, Divide and Conquer, Tree, Binary Tree. Asked at Bloomberg 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 Divide And Conquer Tree Arrays Binary Tree Hash Table Recursion

More from Bloomberg

Reddit What would you grind for Bloomberg? Reddit Bloomberg Tokyo Software Engineer Rejection after Five Rounds Reddit Bloomberg, senior C++ role – what to expect? 1p3a Bloomberg Fulltime SDE Interview Experience and Coding Challenges 1p3a Bloomberg SSE Bquant SF Interview Experience and Reject

← All Bloomberg questions Bloomberg Software Engineer Questions → All Arrays,Hash Table,Divide And Conquer,Tree,Binary Tree,Recursion Questions →