Graph Theory: BFS, DFS, and Dijkstra's Algorithm
A comprehensive guide to traversing graphs and finding the shortest path between nodes using Kotlin.
Purushottam Yadav
Heaps: Mastering the Top-K Elements Pattern
A deep dive into using Priority Queues to solve Top-K frequency and K-largest/smallest element problems efficiently.
Binary Search Trees: Efficient Lookups in Kotlin
A Binary Search Tree (BST) is a special type of binary tree that maintains a strict order. This order allows us to search for elements in $O(h)$ time, where $h$ is the height of the tree. In a bala...
Binary Tree : DFS and BFS Explained
Binary Tree Traversals in Kotlin: DFS and BFS Explained
Singly Linked Lists in Kotlin: The Complete Guide
Singly Linked Lists in Kotlin: The Complete Guide
Two Pointers: Reversing and De-duplicating Arrays
The Power of Two Pointers: Reversing and De-duplicating Arrays
Sliding Window Pattern: Efficient Subarray Operations
Sliding Window Pattern: Efficient Subarray Operations
QuickSort: The Divide and Conquer King
Mastering QuickSort in Kotlin: The Divide and Conquer King
Merge Sort: The Stable Divide and Conquer Algorithm
Mastering Merge Sort in Kotlin: The Stable Divide and Conquer Algorithm
Binary Search: From Basics to Visualization
Mastering Binary Search in Kotlin: From Basics to Visualization