π° Interview Cake Solutions Master Track
Comprehensive C# (.NET 8/9) solutions for the Interview Cake curriculum, structured into clean topic categories with runnable test harnesses and shared benchmarking via DSA.Common.
π Category Breakdown & Problems (37 Problems Total)
π Array and String Manipulation (5 Problems)
- 01.Merging-Meeting-Times
- 02.Reverse-String-in-Place
- 03.Reverse-Words
- 04.Merge-Sorted-Arrays
- 05.Cafe-Order-Checker
π Hashing and Hash Tables (4 Problems)
π Greedy Algorithms (5 Problems)
- 10.Apple-Stocks
- 11.Highest-Product-of-3
- 12.Product-of-All-Other-Numbers
- 13.In-Place-Shuffle
- 14.Single-Riffle-Shuffle
π Sorting and Searching (3 Problems)
π Trees and Graphs (5 Problems)
- 18.Balanced-Binary-Tree
- 19.Binary-Search-Tree-Checker
- 20.2nd-Largest-Item-in-a-BST
- 21.Graph-Coloring
- 22.MeshMessage
π Dynamic Programming and Recursion (4 Problems)
π Queues and Stacks (4 Problems)
π System Design (2 Problems)
π Bit Manipulation (1 Problems)
π Math and Logic (4 Problems)
π οΈ Verification & Test Harness
All 37 problem solutions are isolated in src/ and can be built and tested via the Visual Studio Solution:
# Build entire Interview Cake suite
dotnet build "01_DSA/02_dsa_solutions/interview_cake_solutions/InterviewCake_Solutions.slnx"
# Run individual problem
dotnet run --project "01_DSA/02_dsa_solutions/interview_cake_solutions/src/01.Merging-Meeting-Times"