Subjects
Data-structures Subjects
Arrays
Learn about arrays — the fundamental data structure behind almost every other collection in computing. Contiguous memory, O(1) access, and the building block for everything else.
Last updated: 08/03/2026Linked Lists
Singly and doubly linked lists — nodes, pointers, and traversal patterns.
Last updated: 15/03/2026Stacks & Queues
LIFO and FIFO data structures — the building blocks of algorithms and system design.
Last updated: 15/03/2026Hash Tables
Key-value stores, hashing functions, and collision resolution strategies.
Last updated: 15/03/2026Binary Trees
Tree fundamentals — nodes, edges, traversals, and the recursive nature of trees.
Last updated: 15/03/2026Binary Search Trees
Ordered trees that enable O(log n) search, insert, and delete.
Last updated: 15/03/2026Heaps
Priority queues and heap-based algorithms — min heaps, max heaps, and heapify.
Last updated: 15/03/2026Graphs
Vertices, edges, adjacency representations, and when to use each.
Last updated: 15/03/2026