Are you sure you're getting this? Could you figure out the right sequence for this list?
Order the steps for the following problem, solved using dynamic programming.
Given n friends, each one can remain single or can be paired up with some other friend. Each friend can be paired only once. Find out the total number of ways in which friends can remain single or can be paired up.
Press the below buttons in the order in which they should occur. Click on them again to un-select.
Options:
- Initialize an array
- Add base case
- Fill array using recursive formula
- Loop from 0...n