it works on a smaller subset of the original problem until a base case is reached, allowing the recursion to terminate. the advantages of recursion include conciseness and elegance in code, as well as the abilit
Subsequence Problem is one of themost common algorithm problem, which is not easy to figure out. First of all, the subsequence problem itself is more difficult than those for substring and subarray, since the former needs to deal with discontinuous sequence, while the latter two are continuous....
Day 7 - Sum of Subarray Minimums Day 8 - House Robber Day 9 - Set Mismatch Day 10 - Maximum Length of a Concatenated String with Unique Characters Day 11 - Pseudo-Palindromic Paths in a Binary Tree Day 12 - Longest Common Subsequence Day 13 - Out of Boundary Paths Day 14 - K Invers...