LeetCode Experience

#1022 Sum of Root To Leaf Binary Numbers

SWE coding Easy

Interview Experience

LeetCode #1022: Sum of Root To Leaf Binary Numbers. Difficulty: Easy. Topics: Tree, Depth-First Search, 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 Depth-First Search Tree Binary Tree Graph

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 Binary Tree,Depth First Search,Tree Questions →