Skip to main content

7.3 Exercises

Basic Difficulty​

932. Beautiful Array​

Try solving this using a top-down divide-and-conquer (recursive) approach with memoization for optimization; then attempt a bottom-up dynamic programming approach.

Advanced Difficulty​

312. Burst Balloons​

Try solving this using a top-down divide-and-conquer (recursive) approach with memoization for optimization; then attempt a bottom-up dynamic programming approach.