ahmedcs2600/algoexpert

Solutions to problems that I solved on AlgoExpert.

My solutions to coding interview questions on AlgoExpert

Difficulty Levels

🟢 Easy
🔵 Medium
🔴 Hard
⚫️ Very Hard
⭐ Good to review

Questions

1. 🟢 Two Number Sum
   Category: Arrays
   Approach: Hash Table, Two Pointers
2. 🟢 Validate Subsequence
   Category: Arrays (Subsequence)
   Approach: Two Pointers
3. 🔵 Three Number Sum
   Category: Arrays
   Approach: Two Pointers
4. 🟢 ⭐ Sorted Squared Array
   Category: Arrays
   Approach: Two Pointers
5. 🟢 Tournament Winner
   Category: Arrays
   Approach: Hash Table
6. 🟢 ⭐ Non-Constructible Change
   Category: Arrays
7. 🟢 Find Closest Value In BST
   Category: Binary Search Trees
8. 🔵 ⭐ Smallest Difference
   Category: Arrays Approach: Two Pointers
9. 🟢 Branch Sums Category: Binary Trees Approach: Depth-First Search
10. 🟢 Node Depths Category: Binary Trees Approach: Depth-First Search
11. 🟢 Depth-first Search Category: Graphs
12. 🟢 Minimum Waiting Time Category: Arrays Approach Greedy Algorithm
13. 🟢 Class Photos Category: Arrays
14. 🟢 Tandem Bicycle Category: Arrays
15. 🟢 Remove Duplicates From Linked List Category: Linked Lists