My solutions to coding interview questions on AlgoExpert

Difficulty Levels

🟢 Easy
🔵 Medium
🔴 Hard
⚫️ Very Hard

Questions

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
Insertion Sort	🟢	Sorting Algorithms
Selection Sort	🟢	Sorting Algorithms
Palindrome Check	🟢	Strings	Two Pointers
Cesar Cipher Encryptor	🟢	Strings
Run-Length Encoding	🟢	Strings