Practice Courses Roadmap

Practice Courses Roadmap

NT

Natnael T.

dotphicc@gmail.com

14d streak

Diamond II

Algorithms & Data Structures for Beginners

Progress

27/ 35

About

0 Introduction FREE 1m

Arrays

1 RAM FREE 6m
2 Static Arrays 15m
3 Dynamic Arrays 16m
4 Stacks 4m

Linked Lists

5 Singly Linked Lists FREE 12m
6 Doubly Linked Lists 10m
7 Queues 4m

Recursion

8 Factorial 11m
9 Fibonacci Sequence 13m

Sorting

10 Insertion Sort 19m
11 Merge Sort 22m
12 Quick Sort 17m
13 Bucket Sort 14m

Binary Search

14 Search Array 16m
15 Search Range 8m

Trees

16 Binary Tree 11m
17 Binary Search Tree 15m
18 BST Insert and Remove 22m
19 Depth-First Search 15m
20 Breadth-First Search 11m
21 BST Sets and Maps 6m

Backtracking

22 Tree Maze 14m

Heap / Priority Queue

23 Heap Properties 14m
24 Push and Pop 18m
25 Heapify 15m

Hashing

26 Hash Usage 10m
27 Hash Implementation 29m

Graphs

28 Intro to Graphs 22m
29 Matrix DFS 22m
30 Matrix BFS 14m
31 Adjacency List 20m

Dynamic Programming

32 1-Dimension DP 20m
33 2-Dimension DP 22m

Bit Manipulation

34 Bit Operations 17m

Hashing · Chapter 26 · 10 min

Hash Usage

Chapter content coming soon.

Previous

Heapify

Next

Hash Implementation