Skip to content
Codeloom

Topics

Pick a topic to dive in. New tutorials are added every week.

Languages

Web & Frontend

Backend

DevOps & Cloud

AI & Data

System Design

Data Engineering

Tools & Craft

DSA

🔢
33 posts

Arrays

The most common interview topic — and the building block of almost every other data structure.

Browse tutorials
📝
28 posts

Strings

String manipulation problems — palindromes, anagrams, pattern matching, and substring tricks.

Browse tutorials
🔗
17 posts

Linked Lists

Pointer-driven data structures — singly, doubly, cycles, reversal, and the slow/fast trick.

Browse tutorials
📚
36 posts

Stacks

LIFO data structure — the secret behind balanced parentheses, monotonic stacks, and undo systems.

Browse tutorials
🚦
29 posts

Queues

FIFO data structure — powering BFS, scheduling, sliding-window maxima, and rate limiters.

Browse tutorials
#️⃣
7 posts

Hashing

Hash maps and sets — the O(1) lookup that turns hard problems into easy ones.

Browse tutorials
🌳
33 posts

Trees

Binary trees, BSTs, traversals, and the recursion patterns that solve most tree problems in 10 lines.

Browse tutorials
🕸️
35 posts

Graphs

The most versatile data structure — BFS, DFS, shortest paths, topological sort, and connected components.

Browse tutorials
🌀
4 posts

Recursion

Base case, recursive case, and the call stack — the mental model behind trees, DP, and backtracking.

Browse tutorials
↔️
9 posts

Two Pointers

Two indices walking an array — the technique behind 3Sum, palindrome checks, and container problems.

Browse tutorials
🪟
5 posts

Sliding Window

A moving window over a sequence — fixed and variable size, with O(n) substring and subarray solutions.

Browse tutorials
🎯
15 posts

Binary Search

The O(log n) workhorse — classic, lower/upper bound, and binary search on the answer.

Browse tutorials
📊
7 posts

Sorting

Bubble, insertion, merge, quick, heap — and the engineering judgement to just call sort().

Browse tutorials
9 posts

Greedy

When making the locally best choice produces the globally best answer.

Browse tutorials
🧩
21 posts

Dynamic Programming

Overlapping subproblems + optimal substructure — memoization and tabulation, demystified.

Browse tutorials
💡
4 posts

Bit Manipulation

AND, OR, XOR, shifts, and the little tricks (n & -n, n & (n-1)) that win interviews.

Browse tutorials