Competitive programming problems from various origins.
| Bear and Steady Gene | Longest Substring Without Repeating Characters |
| Skyline Problem @@ | Merge k Sorted Lists |
| Buy and Sell Stock 2 | Jumping Game | Jumping Game 2 @@ |
| Zebra (Codeforces 949a) |
| Climbing Stairs | Min Cost Climbing the Stairs | Longest Increasing Subsequence |
| Maximum Pathsum | Edit Distance | Maximum Subarray @ |
| Continuous Subarray Sum @ | Longest Valid parentheses @ | Distinct Subsequence @@@ |
| Class Sleep (Codeforces 961b) |
Graph Connectivity
| Dominator @ (UVa11902) | Symmetric Tree | Surrounded Region |
@ stands for difficulty. @ means the problem is solved after reading the solution. @@ means the solution was not entirely understood before trying to solve the problem. @@@ means that the solution is still not entirely understood even after solving the problem.
+ means the problem is hard but solved independently.