Archives
- 14 Feb LeetCode 994: Rotting Oranges
- 14 Feb LeetCode 876: Finding the Middle Node of a Linked List
- 14 Feb LeetCode 141: Detecting Linked List Cycles
- 14 Feb LeetCode 17: Letter Combinations of Phone Numbers
- 21 Jan LeetCode 139: Word Break
- 21 Jan LeetCode 876: Middle Node in a Linked List
- 21 Jan LeetCode 141: Linked List Cycle
- 20 Jan LeetCode 8: String to Integer (atoi)
- 20 Jan LeetCode 383: Ransom Note
- 20 Jan LeetCode 11: Container With Most Water
- 20 Jan LeetCode 133: Clone Graph
- 18 Jan LeetCode 5: Longest Palindromic Substring
- 17 Jan LeetCode 3: Longest Substring Without Repeating Characters
- 16 Jan LeetCode 1: Two Sum
- 15 Jan Backtracking: Solving Sudoku and N-Queens
- 14 Jan Kruskal's Algorithm: Finding Minimum Spanning Trees in Kotlin
- 13 Jan Dynamic Programming: Optimizing Recursion
- 12 Jan Recursion: From Basics to The Knapsack Problem
- 11 Jan Disjoint Set Union (DSU) in Kotlin: Mastering Union-Find
- 10 Jan Tries in Kotlin: Building an Autocomplete System
- 09 Jan Graph Theory: BFS, DFS, and Dijkstra's Algorithm
- 07 Jan Heaps: Mastering the Top-K Elements Pattern
- 05 Jan Binary Search Trees: Efficient Lookups in Kotlin
- 05 Jan Binary Tree : DFS and BFS Explained
- 03 Jan Singly Linked Lists in Kotlin: The Complete Guide
- 02 Jan Two Pointers: Reversing and De-duplicating Arrays
- 02 Jan Sliding Window Pattern: Efficient Subarray Operations
- 01 Jan QuickSort: The Divide and Conquer King
- 01 Jan Merge Sort: The Stable Divide and Conquer Algorithm