1p3a_oj
Question
Minimum Path Sum to Target in Binary Tree (Variant of LC 112)
Question Details
Problem: Minimum Path to Target in a Binary Tree (Variant of LC 112) Given the root of a binary tree root and an integer targetSum. A root-to-leaf path is a sequence of nodes starting at t
Full Details
🔒
Unlock all Citadel questions
Full insider details, leaked discussions, and candidate experiences.
or every company, $100/year →About This Question
This is a reported interview question from a citadel interview for a swe role during the coding round.
It covers the following topics: Binary Tree, Trees, Arrays .