Leetcode 666. Path Sum IV
Given a list of three-digit integers encoding a binary tree (hundreds=d epth, tens=position in level, ones=node value), compute the sum of all root-to-leaf path sums. The challenge is to reconstruct or traverse the implicitly encoded tree via index mapping and aggregate path totals efficiently.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.