01What is the key requirement for Dynamic Programming?
02What is 'Memoization'?
03A Greedy algorithm always:
04Backtracking is basically:
05The '0/1 Knapsack Problem' is typically solved using:
06Which algorithm is used for string pattern matching?
07What is 'Tabulation' in DP?
08The 'N-Queens' problem is a classic example of:
09Complexity of Recursive Fibonacci without DP is:
10A 'Bitmask' is often used in DP to: