Summer Sale
Limited Time Deal: Unlock all premium questions for over 30% off
$10.42$7.08
14
:
03
:
45
:
42
Back to Dashboard
OA [CodeSignal] Count Palindrome Paths in Tree
Hard
Given a tree with n nodes where each node has a lowercase English character c[i].
A path is palindromic if the characters along the path can be rearranged to form a palindrome. This means at most one character appears an odd number of times. ...
OfferRetriever
Master technical interviews with real questions from top companies. Build your confidence and career.
LEGAL
© 2026 Purple Business Holdings LLC. All rights reserved. See Terms of Service.