Recursion, Greedy & DP

Break a hard problem into subproblems and choose between divide-and-conquer, greedy and DP.

4 challenges · ~4 h

1. 1Implement Merge Sort and QuickselectFreedivide and conquer, partitioningIntermediate~55 minNot started
2. 2Implement Backtracking SearchFreechoose, explore, unchooseAdvanced~60 minNot started
3. 3Implement Greedy Interval SchedulingFreesort-then-sweep over intervalsIntermediate~55 minNot started
4. 4Implement Dynamic Programming SolversFreememoization vs tabulationAdvanced~60 minNot started