My solutions to coding interview questions on AlgoExpert
π’ Easy
π΅ Medium
π΄ Hard
β«οΈ Very Hard
Question | Difficulty | Category | Approach | Good to review |
---|---|---|---|---|
Two Number Sum | π’ | Arrays | Hash Table, Two Pointers | |
Validate Subsequence | π’ | Arrays | Two Pointers | |
Three Number Sum | π΅ | Arrays | Two Pointers | |
Sorted Squared Array | π’ | Arrays | Two Pointers | β |
Tournament Winner | π’ | Arrays | Hash Table | |
Non-Constructible Change | π’ | Arrays | β | |
Find Closest Value In BST | π’ | Binary Search Trees | ||
Smallest Difference | π΅ | Arrays | Two Pointers | β |
Branch Sums | π’ | Binary Trees | Depth-First Search | |
Node Depths | π’ | Binary Trees | Depth-First Search | |
Depth-first Search | π’ | Graphs | ||
Minimum Waiting Time | π’ | Arrays | Greedy Algorithm | |
Class Photos | π’ | Arrays | Greedy Algorithm | |
Tandem Bicycle | π’ | Arrays | Greedy Algorithm | |
Remove Duplicates From Linked List | π’ | Linked Lists | ||
Nth Fibonacci | π’ | |||
Product Sum | π’ | Arrays | ||
Binary Search | π’ | Searching Algorithms | ||
Find Three Largest Numbers | π’ | Arrays | ||
Bubble Sort | π’ | Sorting Algorithms |