The Repository contains Problems and Solutions for the AlgoExpert Algorithms Interview Questions. Solutions will be available in three languages: Python, Java and JavaScript.
🟩 : Easy 🟦 : Medium 🟧 : Hard 🟥 : Very Hard ⬛ : Extremely Hard
| Problem ID | Problem Statement | Difficulty | Solution | Approaches |
|---|---|---|---|---|
| 001 | Two Number Sum | 🟩 | Python Java JavaScript |
Bruteforce, Pointers, Dictionary/Hashmaps |
| 002 | Validate Subsequence | 🟩 | Python Java JavaScript |
Pointers |
| 003 | Sorted Square Array | 🟩 | Python Java JavaScript |
Brute Force, Pointers |
| 004 | Tournament Winner | 🟩 | Python Java JavaScript |
Dictionary/Hashmaps + One Pass |
| 005 | Non Constructible Change | 🟩 | Python Java JavaScript |
Optimized Logic |
| 006 | Find Closest Value In BST | 🟩 | Python Java JavaScript |
Recursion, Iterative Approach |
| 007 | Branch Sums | 🟩 | Python Java JavaScript |
Recursion, Iterative Approach |
| 008 | Node Depths | 🟩 | Python Java JavaScript |
Iterative Approach, Recursion |
| 009 | Depth First Search | 🟩 | Python Java JavaScript |
Classical(Recursion) |
| 010 | Minimum Waiting Time | 🟩 | Python Java JavaScript |
Greedy, Greedy + Better Logic |
| 011 |
If you have any feedback, please reach out to me via my socials. Hope you enjoy the Repo !!!
