LeetCode Experience

#1339 Maximum Product of Splitted Binary Tree

SWE coding Medium

Interview Experience

LeetCode #1339: Maximum Product of Splitted Binary Tree. Difficulty: Medium. Topics: Tree, Depth-First Search, Binary Tree. 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 Tree Depth-First Search Tree Binary Tree Graph

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