dsa 17
- Backtracking: Solving Sudoku and N-Queens
- Kruskal's Algorithm: Finding Minimum Spanning Trees in Kotlin
- Dynamic Programming: Optimizing Recursion
- Recursion: From Basics to The Knapsack Problem
- Disjoint Set Union (DSU) in Kotlin: Mastering Union-Find
- Tries in Kotlin: Building an Autocomplete System
- Graph Theory: BFS, DFS, and Dijkstra's Algorithm
- Heaps: Mastering the Top-K Elements Pattern
- Binary Search Trees: Efficient Lookups in Kotlin
- Binary Tree : DFS and BFS Explained
- Singly Linked Lists in Kotlin: The Complete Guide
- Two Pointers: Reversing and De-duplicating Arrays
- Sliding Window Pattern: Efficient Subarray Operations
- QuickSort: The Divide and Conquer King
- Merge Sort: The Stable Divide and Conquer Algorithm
- Binary Search: From Basics to Visualization
- Mastering Binary Search in Kotlin: From Basics to Visualization