UberCodingMembers
Count Paths That Can Form a Palindrome in a Tree
Members only
Given a tree where each edge carries a lowercase character, count the unordered pairs of distinct nodes whose path edge-characters can be rearranged into a palindrome. The path is palindrome-formable ...
SWE
tree
bitmask
bit-manipulation
hashmap
dfs
palindromes
hard
Frequency
Single report
Last asked
2026-03-22
Stage
oa · onsite-coding
Log in to continue reading the full content
Comments
Sign in to join the discussion
Loading...
