DATA
    STRUCTURES

    Master the fundamentals of computer science through a structured and interactive milestone journey.

    0Topics
    0Mastered
    25Potential
    Overall Progress0%
    ► scroll horizontally ►
    ArrayFundamental linear data structure for storing collections of items.
    01
    Array
    Sliding WindowSubset of two pointers for tracking contiguous subarrays.
    02
    Sliding Window
    Binary SearchEfficient O(log n) algorithm for searching sorted arrays.
    03
    Binary Search
    Linked ListLinear structure where elements point to the next node.
    04
    Linked List
    StackLIFO data structure for push/pop operations.
    05
    Stack
    StringSequence of characters, foundational for text manipulation algorithms.
    06
    String
    BacktrackingAlgorithmic technique for solving problems recursively.
    07
    Backtracking
    Breadth First SearchMaster the fundamentals of Breadth First Search.
    08
    Breadth First Search
    Binary TreeTree structure where each node has at most two children.
    09
    Binary Tree
    Bit ManipulationOperators that act on the binary representations of values.
    10
    Bit Manipulation
    Binary Search TreeA binary tree organized for O(log n) searching.
    11
    Binary Search Tree
    Depth First SearchMaster the fundamentals of Depth First Search.
    12
    Depth First Search
    Dynamic ProgrammingMaster the fundamentals of Dynamic Programming.
    13
    Dynamic Programming
    GraphMaster the fundamentals of Graph.
    14
    Graph
    GreedyMaking the locally optimal choice at each step.
    15
    Greedy
    HashMapKey-value pairs using hash functions for O(1) average time complexity.
    16
    HashMap
    HeapMaster the fundamentals of Heap.
    17
    Heap
    MathMathematical algorithms and number theory logic.
    18
    Math
    Prefix SumPrecomputed array for fast range sum queries.
    19
    Prefix Sum
    QueueFIFO data structure for processing items strictly in order.
    20
    Queue
    SortingAlgorithms to arrange data in a specific order.
    21
    Sorting
    TreeHierarchical data structure with a root, branches, and leaves.
    22
    Tree
    TrieMaster the fundamentals of Trie.
    23
    Trie
    Two PointersTechnique to optimize searches by using two moving indices.
    24
    Two Pointers
    Union FindMaster the fundamentals of Union Find.
    25
    Union Find