This is a HackerRank problem set. I never went past this step. It included:

• One frequency array problem.
• One statistics and probability problem.
• One binary search problem.
• An ad hoc problem (I guess).

1. Easy frequency array problem (standard).

2. Probability of killing a monster who has H health points with K swings, such that each swing has an evenly distributed value between [0, M].

3. You have 2 memory slots. Print after how many steps you go out of memory (OOM). Step 1 takes 1 memory slot, step 2 takes 2 memory slots, and so on. You should decrease from the biggest of the 2 slots or decrease from the first if they're equal.

0 8 11 1 8 10 2 8 8 3 5 8 4 5 4 5 0 4 6 OOM

Print out 6 steps and also print out the last form of the 2 memory slots.

1. Minimum character transformation (You can find it on Chegg).