LeetCode
Experience
#2791 Count Paths That Can Form a Palindrome in a Tree
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 WeRide in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →About This Question
This is a candidate experience report from a weride interview for a swe role during the coding round.
It covers the following topics: Depth-First Search, Tree, Bit Manipulation, Graph, Hash Table, Strings .
Difficulty rating: Hard