Problem 1457 · Medium

Pseudo-Palindromic Paths in a Binary Tree

Track each digit’s parity as a bitmask down the tree; a path is pseudo-palindromic when at most one digit has odd count.

Open the interactive visualisation