Your way of explaining using recursion tree and then applying the same in code explanation is awesome. Best video I have seen so far. Thank you so much and keep making good videos.
My two cents about time complexity. min is the minimal value of among the numbers. The search tree level is target/min. At each level, the number of fan out is n. Then the upper bound is O(n^(target/min)). It should be the upper bound, but it's not tight because the fan out is getting smaller when traverse down the tree.
Simple sweet and awesome explanation on the whole internet I am beginner and u just explained it so beautifully I understood it very clearly. Thanks for the video and please keep making these wonderful and amazing videos
