Fall SalePremium questions, over 25% offUnlock all premium questions for over 25% off
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. ...
More CodeSignal OAs interview questions
- OA [CodeSignal] Balanced Numbers in Permutationhard
- OA [CodeSignal] Adventure Levelshard
- OA [CodeSignal] Shortest Good Subarraymedium
- OA [CodeSignal] Purchase Optimizationhard
- OA [CodeSignal] Minimum Operation To Reduce n To 0medium
- OA [CodeSignal] Minimum Edge Reversal Roothard
- OA [CodeSignal] Max Throughput With Budgethard
- OA [CodeSignal] Longest Subsequence With Limited Summedium
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.