LeetCode Experience

#2791 Count Paths That Can Form a Palindrome in a Tree

SWE coding Hard

Interview Experience

LeetCode #2791: Count Paths That Can Form a Palindrome in a Tree. Difficulty: Hard. Topics: Hash Table, Bit Manipulation, Tree, Depth-First Search. Asked at Uber 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

Depth-First Search Tree Bit Manipulation Graph Hash Table Strings

More from Uber

Reddit Left industry for 5 years, how fucked am I? Reddit Uber | System Design Round | L5 Reddit Uber SWE-1 India Hiring – Cleared OA but Ended Up Waitlisted (Which Basically Means Rejected) Reddit Uber EM Interview Experience Reddit Uber Strategic Operations Interview

← All Uber questions Uber Software Engineer Questions → All Bit Manipulation,Depth First Search,Hash Table,Tree Questions →