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 | |
|---|---|---|---|---|
| To Roman Numerals | Easy | 0 | — | |
| Reverse a String | Easy | 0 | — | |
| Valid Palindrome | Easy | 0 | — | |
| Count the Vowels | Easy | 0 | — | |
| Count the Words | Easy | 0 | — | |
| Anagram Check | Easy | 0 | — | |
| First Non-Repeating Character | Easy | 0 | — | |
| Run-Length Encoding | Easy | 0 | — | |
| Reverse the Words | Easy | 0 | — | |
| Toggle Case | Easy | 0 | — | |
| Caesar Cipher | Easy | 0 | — | |
| Most Frequent Character | Easy | 0 | — | |
| Longest Common Prefix | Easy | 0 | — | |
| Balanced Brackets | Medium | 0 | — | |
| Longest Substring Without Repeats | Medium | 0 | — | |
| Pangram | Easy | 0 | — | |
| Count Occurrences | Easy | 0 | — | |
| Longest Palindromic Substring | Medium | 0 | — | |
| Parse an Integer | Easy | 0 | — | |
| Anagram Groups | Medium | 0 | — | |
| Find the Pattern | Hard | 0 | — | |
| Isomorphic Strings | Medium | 0 | — | |
| Distinct Substrings | Medium | 0 | — | |
| Longest Common Subsequence | Medium | 0 | — | |
| Edit Distance | Hard | 0 | — | |
| Decode Ways | Medium | 0 | — | |
| Resistor Colour Code | Easy | 0 | — |