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 | |
|---|---|---|---|---|
| Sum of Two Numbers | Easy | 0 | — | |
| Sum from 1 to N | Easy | 0 | — | |
| Factorial | Easy | 0 | — | |
| Sum of Digits | Easy | 0 | — | |
| Reverse a Number | Easy | 0 | — | |
| Is It Prime? | Easy | 0 | — | |
| Celsius to Fahrenheit | Easy | 0 | — | |
| Rectangle: Perimeter and Area | Easy | 0 | — | |
| Seconds to HH:MM:SS | Easy | 0 | — | |
| GCD and LCM | Easy | 0 | — | |
| Count the Primes | Medium | 0 | — | |
| Prime Factorisation | Medium | 0 | — | |
| Perfect Number | Easy | 0 | — | |
| Armstrong Number | Easy | 0 | — | |
| Palindrome Number | Easy | 0 | — | |
| Power Modulo | Medium | 0 | — | |
| Binomial Coefficient | Medium | 0 | — | |
| Convert to Base B | Easy | 0 | — | |
| Digital Root | Easy | 0 | — | |
| Trailing Zeros of N! | Medium | 0 | — | |
| All Divisors | Easy | 0 | — | |
| Sum of Squares | Medium | 0 | — | |
| Quadratic Equation | Easy | 0 | — | |
| Collatz Steps | Easy | 0 | — | |
| Row of Pascal's Triangle | Easy | 0 | — | |
| Modular Inverse | Hard | 0 | — | |
| Count the Multiples | Easy | 0 | — | |
| Euler's Totient | Hard | 0 | — | |
| Mean and Median | Easy | 0 | — | |
| To Roman Numerals | Easy | 0 | — | |
| Integer Square Root | Medium | 0 | — | |
| Find the Missing Number | Easy | 0 | — | |
| Matrix Multiplication | Medium | 0 | — | |
| Ohm's Law | Easy | 0 | — | |
| RC Charging | Medium | 0 | — |