Coders for Life
Solve. Score. Show it off.
Original problems in C, C++, Python and Java — from your first loop to graphs and dynamic programming. Every first solve earns points toward UPEEC goodies, and your stats card goes straight onto your GitHub profile.
80
Easy
56
Medium
18
Hard
#math#strings#arrays#basics#dynamic-programming#engineering#hashing#sorting#graphs#electronics#conditionals#loops#binary-search#matrix#bit-manipulation#two-pointers#stack#greedy#searching#recursion#bfs#primes#backtracking#dfs
| Problem | Level | Solved by | Success rate | |
|---|---|---|---|---|
| Longest Palindromic Substring | Medium | 0 | — | |
| Maximum Subarray Sum | Medium | 0 | — | |
| Climbing Stairs | Easy | 0 | — | |
| Non-Adjacent Maximum Sum | Medium | 0 | — | |
| Coin Change (Fewest Coins) | Medium | 0 | — | |
| Coin Change (Number of Ways) | Medium | 0 | — | |
| Longest Common Subsequence | Medium | 0 | — | |
| Edit Distance | Hard | 0 | — | |
| Longest Increasing Subsequence | Hard | 0 | — | |
| 0/1 Knapsack | Medium | 0 | — | |
| Minimum Path Sum | Medium | 0 | — | |
| Grid Paths with Obstacles | Medium | 0 | — | |
| Subset Sum | Medium | 0 | — | |
| Decode Ways | Medium | 0 | — | |
| Matrix Chain Multiplication | Hard | 0 | — | |
| Balanced Load Split | Hard | 0 | — |