# Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. # The minimum path sum from top to bottom is 11 (i.e., 2 + 3 + 5 + 1 = 11 ...
Given a binary tree, we install cameras on the nodes of the tree. Each camera at a node can monitor its parent, itself, and its immediate children. Calculate the minimum number of cameras needed to ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results