LeetCode 133: Clone Graph
A step-by-step guide to deep copying a graph using Breadth-First Search (BFS) and HashMaps in Kotlin.
Purushottam Yadav
LeetCode 5: Longest Palindromic Substring
Comparing two powerful solutions for finding palindromes: the space-efficient 'Expand Around Center' and the classic Dynamic Programming approach.
LeetCode 3: Longest Substring Without Repeating Characters
Solving the classic Longest Substring problem using the optimized Sliding Window technique with a HashMap for O(n) time complexity.
LeetCode 1: Two Sum
A detailed walkthrough of the classic Two Sum problem, moving from a brute-force approach to an optimized O(n) solution using HashMaps.
Backtracking: Solving Sudoku and N-Queens
Master the art of Backtracking by building a Sudoku Solver and finding all solutions to the N-Queens problem in Kotlin.
Kruskal's Algorithm: Finding Minimum Spanning Trees in Kotlin
Learn how to find the Minimum Spanning Tree (MST) of a graph using Kruskal's Algorithm and the Disjoint Set Union (DSU) data structure.
Dynamic Programming: Optimizing Recursion
A practical guide to Dynamic Programming (DP), covering Memoization (Top-Down) and Tabulation (Bottom-Up) for Fibonacci, Knapsack, and LCS.
Recursion: From Basics to The Knapsack Problem
A comprehensive guide to understanding recursive algorithms, covering Factorials, Fibonacci, and complex decision trees like the 0/1 Knapsack problem.
Disjoint Set Union (DSU) in Kotlin: Mastering Union-Find
A guide to implementing the Disjoint Set Union (DSU) data structure with Path Compression and Union by Rank optimizations.
Tries in Kotlin: Building an Autocomplete System
A deep dive into the Trie (Prefix Tree) data structure for efficient string searching, prefix matching, and word suggestions.