CodingMedium
Full binary tree last level nodes and knapsack holiday satisfaction
Filed under Disney+ Hotstar
The question
Solved a binary tree problem to find the number of nodes in the last level of a full binary tree in O(logn) time, and a dynamic programming knapsack problem to maximize satisfaction from holiday costs under a fixed budget.
No write-up yet. Related questions below have one.
Related Disney+ Hotstar questions
Collected from public candidate posts and coding forums. Updated Nov 2026.