Skip to content

Data Structure And Algorithms Roadmap

Guides lead a user through a specific task they want to accomplish, often with a sequence of steps. Writing a good guide requires thinking about what your users are trying to do.

Pick a Language

💁 Javascript
💁 Java
💁 Go
💁 C#
💁 C++
💁 Python
💁 Rust
💁 Ruby

Programming Fundamentals

💁 Language Syntax
💁 Control Structures
💁 Functions
💁 OOP Basics
💁 Pseudo Code

Data Structures

💁 What are Data Structures
💁 Importance of Data Structures

Basic Data Structures

💁 Array
💁 Linked Lists
💁 Stacks
💁 Queues
💁 Hash Tables

Algorithmic Complexity

💁 Time vs Space Complexity
💁 How to Calculate Complexity

Common Runtimes

💁 Constants
💁 Logarithmic
💁 Linear
💁 Polynomial
💁 Exponential
💁 Factorial

Asymptotic Notation

💁 Big O Notation
💁 Big-θ
💁 Big-Ω

Sorting Algoriths

💁 Bubble Sort
💁 Merge Sort
💁 Insertion Sort
💁 Quick Sort
💁 Selection Sort
💁 Heap Sort

Search Algorithms

💁 Linear Search
💁 Unidirected Sort

Tree Data Structures

💁 Binary Trees
💁 Binary Search Trees
💁 AVL Trees
💁 B-Trees
💁 Tree Traversal
- 💁 In-order Traversal
- 💁 Pre-order Traversal
- 💁 Post-order Traversal
💁 Search Algorithms
- 💁 Breadth first Search
- 💁 Depth first Search

Graph Data Structures

💁 Directed Graph
💁 Unidirected Graph
💁 Search Algorithms
- 💁 Breadth first Search
- 💁 Depth first Search
💁 Sortest Path Algorithms
- 💁 Dijkstra’s Algorithms
- 💁 Bellman Ford
💁 Minimum Spanning Tree
- 💁 Prism Algorithm
- 💁 Kruskal’s Algorithm

Advanced Data Structures

💁 Trie
💁 Segment Trees
💁 Fenwick Trees
💁 Disjoint Set(Union-Find)
💁 Suffix Tress and Arrays

Complex Data Structures

💁 B/B+ Tress
💁 Skip List
💁 ISAM
💁 2-3 Trees

Indexing

💁 Linear Indexing
💁 Tree-Based Indexing

Problem Solving Techniques

💁 Brute Force
💁 Backtracking
💁 Greedy Algorithms
💁 Randomised Algorithms
💁 Divide and Conquer
💁 Recusrion
💁 Dyanamic Programming
💁 Two Pointer Techniques
💁 Sliding Window Techniques

Platforms For Practice

💁 Leetcode
💁 Edabit
💁 Codechef
💁 CodeStudio