OA [CodeSignal] Count Palindrome Paths in Tree
CodeSignal OA Bank interview questions · Hard · OA round · 5 tests
You are given a rooted tree described by:
parent, whereparent[0] = -1andparent[i]is the parent of nodeis, where fori > 0,s[i]is the lowercase letter on the edge fromparent[i]toi
Run your code with Ctrl+Enter to see results.