| 0 |
Dummy Problem |
Submission |
Dummy |
| 1 |
Ways to place chess pieces |
Submission |
Dynamic Programming |
| 2 |
Find maximum difference |
Submission |
Divide and Conquer |
| 3 |
Minimum Maximum Sum |
Submission |
Backtracking |
| 4 |
Finding path with minimal cost |
Submission |
Dynamic Programming |
| 5 |
Reconstruct Binary Tree |
Submission |
Recursion |
| 6 |
Graph Traversal |
Submission |
Graph |
| 7 |
Finding Strong Components |
Submission |
Graph |
| 8 |
Evaluating Arithmetic Expressions |
Submission |
|
| 9 |
Longest Bitonic Subsequence |
Submission |
Dynamic Programming |
| 10 |
Palidrome |
Submission |
Dynamic Programming |
| 11 |
Single Source Longest Path |
Submission |
|
| 12 |
Divide positive integers in sets of k consecutive numbers |
Submission |
Recursion |
| 13 |
Distances in Binary Search Trees |
Submission |
|
| 14 |
Chess Wins and Losses |
Submission |
|
| 15 |
Recursive Method to Traverse Staircase |
Submission |
|
| 16 |
Last Remaining Number |
Submission |
Recursion |
| 17 |
Divide and Conquer Algorithms for Rotated Sorted Arrays |
Submission |
|
| 18 |
Serialization and De-serialization of Binary Tree |
Submission |
|
| 19 |
Random Number Game |
Submission |
|
| 20 |
Stepping Number |
Submission |
Backtracking |
| 21 |
Solving For Digits |
Submission |
Backtracking |
| 22 |
Backtracking Algorithm for Maximum Possible Integer Through Digit Swaps |
Submission |
|
| 23 |
Optimal Skiing Route |
Submission |
Dynamic Programming |
| 24 |
Text Fitting |
Submission |
Dynamic Programming |
| 25 |
Optimal Job Profit Scheduling |
Submission |
Dynamic Programming |
| 26 |
Well-Connected Towns |
Submission |
Graph |
| 27 |
Cyclic Dependency Removal |
Submission |
Graph |
| 28 |
Reachable Islands |
Submission |
Graph |
| 29 |
Dynamic Programming Algorithm for Maximizing the Revenue of Juice Bottling |
Submission |
|
| 30 |
Test DFS Traversal Tree |
Submission |
Graph, DFS |