SMALL PROBLEMS. REAL PROGRESS.
A little practice, every day.
Turn what you know into what you can do. Start small, explore different approaches, and learn from every attempt.
24 challenges · JavaScript · Immediate test feedback
| # | Challenge | Difficulty | Topic | Time | |
|---|---|---|---|---|---|
| 01 | Reverse a String | Beginner | Strings | 5 min | |
| 02 | Sum of an Array | Beginner | Arrays | 5 min | |
| 03 | Count the Vowels | Easy | Strings | 10 min | |
| 04 | Find the Maximum | Beginner | Arrays | 5 min | |
| 05 | Even or Odd? | Beginner | Mathematics | 5 min | |
| 06 | Calculate a Factorial | Easy | Loops | 10 min | |
| 07 | Palindrome Check | Easy | Strings | 10 min | |
| 08 | FizzBuzz | Easy | Loops | 10 min | |
| 09 | Find the Missing Number | Easy | Arrays | 10 min | |
| 10 | Remove Duplicates | Easy | Arrays | 10 min | |
| 11 | Binary Search | Medium | Searching | 20 min | |
| 12 | Sort the Numbers | Easy | Sorting | 10 min | |
| 13 | Fibonacci Number | Medium | Dynamic Programming | 20 min | |
| 14 | Balanced Brackets | Medium | Stacks | 20 min | |
| 15 | Flatten an Array | Medium | Recursion | 20 min | |
| 16 | First Unique Character | Medium | Strings | 20 min | |
| 17 | Two Sum | Medium | Algorithms | 20 min | |
| 18 | Rotate an Array | Medium | Arrays | 20 min | |
| 19 | Maximum Subarray Sum | Hard | Dynamic Programming | 35 min | |
| 20 | Depth of a Tree | Hard | Trees | 35 min | |
| 21 | Path in a Graph | Hard | Graphs | 35 min | |
| 22 | Process a Queue | Easy | Queues | 10 min | |
| 23 | Read a Linked List | Medium | Linked Lists | 20 min | |
| 24 | Longest Increasing Subsequence | Expert | Dynamic Programming | 35 min |