← Back
00:00

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, where parent[0] = -1 and parent[i] is the parent of node i
  • s, where for i > 0, s[i] is the lowercase letter on the edge from parent[i] to i
Idle