mirror of
https://github.com/kamranahmedse/developer-roadmap.git
synced 2025-08-30 04:30:01 +02:00
Add data structures and algorithm roadmap
This commit is contained in:
BIN
public/pdfs/roadmaps/datastructures-and-algorithms.pdf
Normal file
BIN
public/pdfs/roadmaps/datastructures-and-algorithms.pdf
Normal file
Binary file not shown.
@@ -48,11 +48,10 @@ const {
|
|||||||
{
|
{
|
||||||
isNew && (
|
isNew && (
|
||||||
<span class='absolute bottom-1.5 right-2 flex items-center rounded-br rounded-tl text-xs font-medium text-purple-300'>
|
<span class='absolute bottom-1.5 right-2 flex items-center rounded-br rounded-tl text-xs font-medium text-purple-300'>
|
||||||
<span class='mr-1.5 flex h-2 w-2'>
|
<span class='flex h-2 w-2'>
|
||||||
<span class='absolute inline-flex h-2 w-2 animate-ping rounded-full bg-purple-400 opacity-75' />
|
<span class='absolute inline-flex h-2 w-2 animate-ping rounded-full bg-purple-400 opacity-75' />
|
||||||
<span class='relative inline-flex h-2 w-2 rounded-full bg-purple-500' />
|
<span class='relative inline-flex h-2 w-2 rounded-full bg-purple-500' />
|
||||||
</span>
|
</span>
|
||||||
New
|
|
||||||
</span>
|
</span>
|
||||||
)
|
)
|
||||||
}
|
}
|
||||||
|
@@ -0,0 +1 @@
|
|||||||
|
# Javascript
|
@@ -0,0 +1 @@
|
|||||||
|
# Java
|
@@ -0,0 +1 @@
|
|||||||
|
# Go
|
@@ -0,0 +1 @@
|
|||||||
|
# Csharp
|
@@ -0,0 +1 @@
|
|||||||
|
# Cpp
|
@@ -0,0 +1 @@
|
|||||||
|
# Python
|
@@ -0,0 +1 @@
|
|||||||
|
# Rust
|
@@ -0,0 +1 @@
|
|||||||
|
# Ruby
|
@@ -0,0 +1 @@
|
|||||||
|
# Language
|
@@ -0,0 +1 @@
|
|||||||
|
# Language syntax
|
@@ -0,0 +1 @@
|
|||||||
|
# Control structures
|
@@ -0,0 +1 @@
|
|||||||
|
# Functions
|
@@ -0,0 +1 @@
|
|||||||
|
# Oop basics
|
@@ -0,0 +1 @@
|
|||||||
|
# Pseudo code
|
@@ -0,0 +1 @@
|
|||||||
|
# Programming fundamentals
|
@@ -0,0 +1 @@
|
|||||||
|
# What are datastructures
|
@@ -0,0 +1 @@
|
|||||||
|
# Importance of datastructures
|
@@ -0,0 +1 @@
|
|||||||
|
# Data structures
|
@@ -0,0 +1 @@
|
|||||||
|
# Array
|
@@ -0,0 +1 @@
|
|||||||
|
# Linked lists
|
@@ -0,0 +1 @@
|
|||||||
|
# Stacks
|
@@ -0,0 +1 @@
|
|||||||
|
# Queues
|
@@ -0,0 +1 @@
|
|||||||
|
# Hash tables
|
@@ -0,0 +1 @@
|
|||||||
|
# Basic data structures
|
@@ -0,0 +1 @@
|
|||||||
|
# Time vs space
|
@@ -0,0 +1 @@
|
|||||||
|
# Calculating
|
@@ -0,0 +1 @@
|
|||||||
|
# Constant
|
@@ -0,0 +1 @@
|
|||||||
|
# Logarithmic
|
@@ -0,0 +1 @@
|
|||||||
|
# Linear
|
@@ -0,0 +1 @@
|
|||||||
|
# Polynomial
|
@@ -0,0 +1 @@
|
|||||||
|
# Exponential
|
@@ -0,0 +1 @@
|
|||||||
|
# Factorial
|
@@ -0,0 +1 @@
|
|||||||
|
# Common runtimes
|
@@ -0,0 +1 @@
|
|||||||
|
# Big o
|
@@ -0,0 +1 @@
|
|||||||
|
# Big theta
|
@@ -0,0 +1 @@
|
|||||||
|
# Big omega
|
@@ -0,0 +1 @@
|
|||||||
|
# Asymptotic notation
|
@@ -0,0 +1 @@
|
|||||||
|
# Algorithmic complexity
|
@@ -0,0 +1 @@
|
|||||||
|
# Bubble sort
|
@@ -0,0 +1 @@
|
|||||||
|
# Merge sort
|
@@ -0,0 +1 @@
|
|||||||
|
# Insertion sort
|
@@ -0,0 +1 @@
|
|||||||
|
# Quick sort
|
@@ -0,0 +1 @@
|
|||||||
|
# Selection sort
|
@@ -0,0 +1 @@
|
|||||||
|
# Heap sort
|
@@ -0,0 +1 @@
|
|||||||
|
# Sorting algorithms
|
@@ -0,0 +1 @@
|
|||||||
|
# Linear search
|
@@ -0,0 +1 @@
|
|||||||
|
# Binary search
|
@@ -0,0 +1 @@
|
|||||||
|
# Search algorithms
|
@@ -0,0 +1 @@
|
|||||||
|
# Binary trees
|
@@ -0,0 +1 @@
|
|||||||
|
# Binary search trees
|
@@ -0,0 +1 @@
|
|||||||
|
# Avl trees
|
@@ -0,0 +1 @@
|
|||||||
|
# B trees
|
@@ -0,0 +1 @@
|
|||||||
|
# In order traversal
|
@@ -0,0 +1 @@
|
|||||||
|
# Pre order traversal
|
@@ -0,0 +1 @@
|
|||||||
|
# Post order traversal
|
@@ -0,0 +1 @@
|
|||||||
|
# Tree traversal
|
@@ -0,0 +1 @@
|
|||||||
|
# Breadth first search
|
@@ -0,0 +1 @@
|
|||||||
|
# Depth first search
|
@@ -0,0 +1 @@
|
|||||||
|
# Search algorithms
|
@@ -0,0 +1 @@
|
|||||||
|
# Tree data structure
|
@@ -0,0 +1 @@
|
|||||||
|
# Directed graph
|
@@ -0,0 +1 @@
|
|||||||
|
# Undirected graph
|
@@ -0,0 +1 @@
|
|||||||
|
# Breadth first search
|
@@ -0,0 +1 @@
|
|||||||
|
# Depth first search
|
@@ -0,0 +1 @@
|
|||||||
|
# Search algorithms
|
@@ -0,0 +1 @@
|
|||||||
|
# Dijkstra algorithm
|
@@ -0,0 +1 @@
|
|||||||
|
# Bellman ford
|
@@ -0,0 +1 @@
|
|||||||
|
# Shortest path algorithms
|
@@ -0,0 +1 @@
|
|||||||
|
# Prims algorithm
|
@@ -0,0 +1 @@
|
|||||||
|
# Kruskal algorithm
|
@@ -0,0 +1 @@
|
|||||||
|
# Minimum spanning tree
|
@@ -0,0 +1 @@
|
|||||||
|
# Graph data structure
|
@@ -0,0 +1 @@
|
|||||||
|
# Trie
|
@@ -0,0 +1 @@
|
|||||||
|
# Segment trees
|
@@ -0,0 +1 @@
|
|||||||
|
# Fenwick trees
|
@@ -0,0 +1 @@
|
|||||||
|
# Disjoint set
|
@@ -0,0 +1 @@
|
|||||||
|
# Suffix trees arrays
|
@@ -0,0 +1 @@
|
|||||||
|
# Advanced data structures
|
@@ -0,0 +1 @@
|
|||||||
|
# B bplus trees
|
@@ -0,0 +1 @@
|
|||||||
|
# Skip list
|
@@ -0,0 +1 @@
|
|||||||
|
# Isam
|
@@ -0,0 +1 @@
|
|||||||
|
# 3 trees
|
@@ -0,0 +1 @@
|
|||||||
|
# Complex data structures
|
@@ -0,0 +1 @@
|
|||||||
|
# Linear indexing
|
@@ -0,0 +1 @@
|
|||||||
|
# Tree based indexing
|
@@ -0,0 +1 @@
|
|||||||
|
# Indexing
|
@@ -0,0 +1 @@
|
|||||||
|
# Brute force
|
@@ -0,0 +1 @@
|
|||||||
|
# Backtracking
|
@@ -0,0 +1 @@
|
|||||||
|
# Greedy algorithms
|
@@ -0,0 +1 @@
|
|||||||
|
# Randomised algorithms
|
@@ -0,0 +1 @@
|
|||||||
|
# Divide and conquer
|
@@ -0,0 +1 @@
|
|||||||
|
# Recursion
|
@@ -0,0 +1 @@
|
|||||||
|
# Dynamic programming
|
@@ -0,0 +1 @@
|
|||||||
|
# Two pointer techniques
|
@@ -0,0 +1 @@
|
|||||||
|
# Sliding window technique
|
@@ -0,0 +1 @@
|
|||||||
|
# Problem solving techniques
|
@@ -0,0 +1 @@
|
|||||||
|
# Leetcode
|
@@ -0,0 +1 @@
|
|||||||
|
# Edabit
|
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user