Count Paths That Can Form a Palindrome in a Tree
Given a tree parent array and edge character string, calculate how many unordered node pairs have at most one odd letter frequency in this Uber problem.
Check more interview questions and experiences about Uber
