Algorithms

Learn Algorithms as a connected topic across chapters, concepts, simulations, and interview reasoning.

Resources

10h 46m

Total Learning Time

0/43

Completed

Start Learning

Choose your learning style

Multiple ways to learn the same concept. Pick what works best for you.

Algorithms

Choose your learning style

Recommended Articles

Algorithms for AI: Trie, Graph Sorting, and K-Way Merge for LLM Systems

BFS — Breadth-First Search: Level-by-Level Graph Exploration

Exploring Backtracking Techniques in Data Structures

Exploring Different Types of Binary Trees

Big O Notation Explained: Time Complexity, Space Complexity, and Why They Matter in Interviews

Binary Search Patterns: Five Variants Every Senior Engineer Knows

Bloom Filters Explained: Membership Testing with Zero False Negatives

Count-Min Sketch Explained: Frequency Estimation at Streaming Scale

Cyclic Sort: Find Missing and Duplicate Numbers in O(n) Time, O(1) Space

Fast and Slow Pointer: Floyd's Cycle Detection Algorithm Explained

DFS — Depth-First Search: Go Deep Before Going Wide

How Bloom Filters Work: The Probabilistic Set

What are Hash Tables? Basics Explained

HyperLogLog Explained: Counting Billions of Unique Items with 12 KB

Understanding Inverted Index and Its Benefits in Software Development

In-Place Reversal of a Linked List: The 3-Pointer Dance Every Interviewer Expects

K-Way Merge Pattern: Merge K Sorted Sequences with a Min-Heap

Mastering Binary Tree Traversal: A Beginner's Guide

Merge Intervals Pattern: Solve Scheduling Problems with Sort and Sweep

Probabilistic Data Structures: A Practical Guide to Bloom Filters, HyperLogLog, and Count-Min Sketch

Segment Trees and Fenwick Trees: Mastering Range Query Optimization

Sliding Window Technique: From O(n·k) Scans to O(n) in One Pass

Top K Elements Pattern: Find the Best K Without Sorting Everything

Tarjan’s Algorithm: Finding Strongly Connected Components (SCC) step-by-step

The Ultimate Data Structures Cheat Sheet

Two Heaps Pattern: Find the Median of a Data Stream Without Sorting

Two Pointer Technique: Solving Pair and Partition Problems in O(n)

Tree Data Structure Explained: Concepts, Implementation, and Interview Guide

Tries (Prefix Trees): The Data Structure Behind Autocomplete

Sliding Window Technique

Two Pointers Technique

Monotonic Stack Pattern: Efficiently Solving Range Queries and Next Greater Element Problems

Topological Sort Pattern: Solving Dependency Scheduling and Cycle Detection Problems

Advanced Graph Algorithms: Dijkstra, Topological Sort, and Disjoint Set Union (DSU)

A Guide to Raft, Paxos, and Consensus Algorithms

Supervised Learning Algorithms: A Deep Dive into Regression and Classification

Load Balancing Algorithms

Mastering the Strategy Pattern: Decoupling Algorithms and Behaviors

Feature Engineering: Transforming Raw Data into ML-Ready Features

Dynamic Programming Patterns: Solving the 0/1 Knapsack and LCS Series

Strategy Design Pattern: Simplifying Software Design

System Design Advanced: Security, Rate Limiting, and Reliability

Lock-Free Union‑Find with Atomic Path Compression: Scaling Disjoint‑Set Operations for Massive Parallel Graph Workloads