raul-sauco/coding-challenges
Coding challenges of the style found in technical interviews. The problems come from different sources like LeetCode, LintCode, CodeWars, Cracking The Coding Interview, etc.
Coding challenges
LeetCode problems
Solutions to LeetCode problems. The first column links to the problem in
LeetCode, the second one is the problem's difficulty the last one links
to the solution in this repository.
CodeWars problems
First column links to the problem in CodeWars, second is the problem's
difficulty, in descending order, the last column links to solutions in
this repository.
| CodeWars Link | Difficulty | Solutions |
|---|---|---|
| Convert string to camel case | 6kyu | ![]() |
| Who won the election? | 6kyu | ![]() |
AlgoExpert problems
First column links to the problem in AlgoExpert, second is the problem's
difficulty, in descending order, the last column links to solutions in
this repository.
HackerRank problems
First column links to the problem in HackerRank, second is the problem's
difficulty, in descending order, the last column links to solutions in
this repository.
| HackerRank Link | Difficulty | Solutions |
|---|---|---|
| Diagonal Difference | π’ Easy | ![]() |
| Java Deque | π Medium | ![]() |
| Java Priority Queue | π Medium | ![]() |
| Merge Tools | π Medium | ![]() |
| Mini Max Sum | π’ Easy | ![]() |
| Phone Book JAVA MAP | π’ Easy | ![]() |
| Plus Minus | π’ Easy | ![]() |
| Runner-Up Score! | π’ Easy | ![]() |





