Minimum Depth of Binary Tree issue 3%：Caculate minimum depth of binary tree. Find the shortest path from top-node to bottom-node. Expected Result 3% ： Return the shortest path from top(root) to bottom(leaf). Conditions 4%: The leaf is defined that a node which doesn't have any childred(left/right). Logics of Examples 20%： 1.使用 DSF 去追蹤每個 leaf, 最後回傳最小路徑(慢但省 memory) 2.使用 BFS 去追蹤每個 leaf, 最後回傳最小路徑(快但耗 memory) Issue & Expected Result & ConditionsCaculate minimum depth of binary tree. Find the shortest path from top-node to bottom-node and Return it. The leaf is defined that a node which doesn't have any childred(left/right). Therefore, we will keep tack of each node until getting the shortest path to any leaf.

1802. Maximum Value at a Given Index in a Bounded Array You are given three positive integers: n, index, and maxSum. You want to construct an array nums (0-indexed) that satisfies the following conditions: The Five conditions nums.length == n The length of nums is equal to n. nums[i] is a positive integer where 0 <= i < n. Any value of array is positive integer. The range is from 0 to n.

contributed by <tina0405> github: tina0405/raspberry-pi3-mini-os 硬體選擇： Raspberry Pi 3 model B item specfication SoC Broadcom BCM2837