DSA

The line

Data Structures and Algorithms30 stations4 legs180 lessons

Leg A: Foundations

Open7 stations · 45 lessons
  1. PYTH

    Python for DSAoptional warm-upyou are here

    0/6 lessons · 0/5 problems · 74 min
    PYTH Python for DSA: lessons and problems
    CodeLesson or problemMinStatus
    PYTH-1Lists, indexing and slicing12Not started
    PYTH-2Loops and comprehensions13Not started
    PYTH-3Functions12Not started
    PYTH-4Dicts, sets and tuples14Not started
    PYTH-5Classes for nodes13Not started
    PYTH-6How practice and tests work10Not started
    PYTH-P1Rotate the departure boardPracticeNot solved
    PYTH-P2Running totalsPracticeNot solved
    PYTH-P3The first repeated codePracticeNot solved
    PYTH-P4The codes seen oncePracticeNot solved
    PYTH-P5Build a trainPracticeNot solved
  2. CORR

    Correctness

    0/5 lessons · 0/5 problems · 74 min
  3. BIGO

    Cost: Big-O and friends

    0/8 lessons · 0/5 problems · 110 min
  4. ARRS

    Arrays and strings

    0/6 lessons · 0/5 problems · 85 min
  5. BSRC

    Binary search

    0/6 lessons · 0/5 problems · 91 min
  6. RECR

    Recursion and backtracking

    0/6 lessons · 0/6 problems · 83 min
  7. SORT

    Sorting

    0/8 lessons · 0/6 problems · 113 min

Leg B: Data structures

Open9 stations · 55 lessons
  1. STAQ

    Stacks and queues

    0/6 lessons · 0/6 problems · 79 min
  2. HASH

    Hashing

    0/8 lessons · 0/6 problems · 114 min
  3. TREE

    Trees and BSTs

    0/7 lessons · 0/6 problems · 95 min
  4. BALT

    Balanced trees

    0/6 lessons · 0/6 problems · 85 min
  5. HEAP

    Heaps

    0/6 lessons · 0/6 problems · 80 min
  6. TRIE

    Tries

    0/5 lessons · 0/5 problems · 66 min
  7. DSUF

    Union-find

    0/5 lessons · 0/5 problems · 63 min
  8. RNGQ

    Range queries

    0/6 lessons · 0/6 problems · 83 min

Leg C: Design techniques

Open5 stations · 32 lessons
  1. GRDY

    Greedy algorithms

    0/5 lessons · 0/6 problems · 69 min
  2. DVCQ

    Divide and conquer

    0/6 lessons · 0/6 problems · 85 min
  3. DYNP

    Dynamic programming

    0/9 lessons · 0/9 problems · 122 min
  4. BITS

    Bit manipulation

    0/5 lessons · 0/5 problems · 62 min
  5. MATH

    Number theory and counting

    0/7 lessons · 0/7 problems · 91 min

Leg D: Graphs and beyond

Open9 stations · 48 lessons
  1. GRPH

    Graphs

    0/7 lessons · 0/7 problems · 89 min
  2. PATH

    Shortest paths

    0/7 lessons · 0/7 problems · 90 min
  3. SPAN

    Minimum spanning trees

    0/4 lessons · 0/4 problems · 46 min
  4. CONN

    Connectivity

    0/4 lessons · 0/4 problems · 54 min
  5. FLOW

    Network flow

    0/5 lessons · 0/5 problems · 66 min
  6. STRG

    String algorithms

    0/6 lessons · 0/6 problems · 81 min
  7. GEOM

    Computational geometry

    0/4 lessons · 0/4 problems · 58 min
  8. ADDP

    Advanced DP

    0/6 lessons · 0/6 problems · 91 min
  9. HARD

    Hard problemslast station

    0/5 lessons · 0/5 problems · 82 min