🚀 02_dsa_solutions
Welcome to the Data Structures & Algorithms Solutions Catalog. This repository contains enterprise-grade C# (.NET 9) implementations, formal complexity proofs, edge-case audit notes, and runnable test suites.
📂 Solution Tracks
- 🎯 NeetCode 150 Master Track: Systematically scaffolded solutions spanning all 18 DSA core patterns.
- 🧩 LeetCode Solutions Catalog: Curated problem breakdowns with comprehensive unit tests and asymptotic proofs.
- 🍰 Interview Cake Master Track: Comprehensive 37-problem track across 10 algorithmic categories with shared benchmarking.
- 📦 DSA.Common Test Harness: High-performance test framework and memory benchmark runner.
🧭 Featured Problem Breakdowns
| Problem | Difficulty | Category | Key Concept | Solution Link |
|---|---|---|---|---|
| LeetCode 1 | Easy | Arrays & Hashing | Complement lookup via Hash Map | [[01_DSA/02_dsa_solutions/leetcode_solutions/01_Arrays_and_Hashing/01.Two-Sum |
| LeetCode 3 | Medium | Sliding Window | Dynamic window expansion & hash set | [[01_DSA/02_dsa_solutions/leetcode_solutions/03_Sliding_Window/03.Longest-Substring-Without-Repeating-Characters |
| LeetCode 217 | Easy | Arrays & Sets | Early termination set insertion | [[01_DSA/02_dsa_solutions/leetcode_solutions/01_Arrays_and_Hashing/217.Contains-Duplicate |
| NeetCode 01 | Easy | Arrays & Hashing | Duplicate Detection via Set | [[01_DSA/02_dsa_solutions/neetcode_solutions/01_Arrays_and_Hashing/01.Duplicate-Integer |
| NeetCode 70 | Easy | 1-D Dynamic Programming | State transition | [[01_DSA/02_dsa_solutions/neetcode_solutions/13_1D_Dynamic_Programming/99.Climbing-Stairs |
| Cake 01 | Medium | Array & String | Sorting intervals by start time | [[01_DSA/02_dsa_solutions/interview_cake_solutions/01_Array_and_String_Manipulation/01.Merging-Meeting-Times |