All courses
Pito · Backend developer
Algorithms and Data Structures
Big-O, searching, sorting, stacks and queues, recursion, hash tables, graphs (BFS, DFS, Dijkstra), dynamic programming and interview patterns — in Python.
15 lessons
~6 h
Chapter 1. Algorithmic thinking
5 lessons- Algorithms and their speed (Big-O) ro‘yxatsiz sinab ko‘ring Practice 4 questions 20 min
- Searching: linear and binary ro‘yxatdan o‘tgach Practice 4 questions 20 min
- Sorting algorithms ro‘yxatdan o‘tgach Practice 4 questions 25 min
- Stacks and queues ro‘yxatdan o‘tgach Practice 4 questions 20 min
- Recursion ro‘yxatdan o‘tgach Practice 4 questions 25 min
Intermediate level
Ro‘yxatdan o‘tib, oldingi darajani tugatgach — kirish imtihoni bilan ochiladi.
Chapter 2. Graphs, dynamic programming and interview patterns
5 lessons- Hash tables: why a dict is so fast ro‘yxatdan o‘tgach Practice 3 questions 20 min
- Graphs: BFS and DFS ro‘yxatdan o‘tgach Practice 3 questions 25 min
- Dijkstra's algorithm: the shortest distance ro‘yxatdan o‘tgach Practice 3 questions 20 min
- Dynamic programming ro‘yxatdan o‘tgach Practice 3 questions 25 min
- Interview problems: two pointers and the sliding window ro‘yxatdan o‘tgach Practice 3 questions 25 min
Advanced level
Ro‘yxatdan o‘tib, oldingi darajani tugatgach — kirish imtihoni bilan ochiladi.
Chapter 3. Heaps, trees, backtracking and DSU
5 lessons- Heaps: getting the smallest fast ro‘yxatdan o‘tgach Practice 3 questions 20 min
- Trees and binary search trees ro‘yxatdan o‘tgach Practice 3 questions 25 min
- Backtracking ro‘yxatdan o‘tgach Practice 3 questions 25 min
- Union-Find (DSU) ro‘yxatdan o‘tgach Practice 3 questions 20 min
- Topological sort: what comes before what ro‘yxatdan o‘tgach Practice 3 questions 20 min