← Back
00:00

OA [CodeSignal] Count Palindrome Paths in Tree

Uber interview questions · Hard · OA round · 5 tests

Count node pairs whose path characters have at most one odd frequency.

The full question, tests and reference solution are available with a plan that includes Uber.

Idle