Are you new to Data Structures and Algorithms (DSA)?
Let's get to know about all of those we would be learning.
🧵 👇
Let's get to know about all of those we would be learning.
🧵 👇
1️⃣ Array
👉 Data Structures
1️⃣ One-Dimensional Array
2️⃣ Multi-Dimensional Array
👉 Algorithms
1️⃣ Traverse
2️⃣ Insert
3️⃣ Delete
4️⃣ Get
5️⃣ Search
6️⃣ Size
7️⃣ Reverse
👉 Data Structures
1️⃣ One-Dimensional Array
2️⃣ Multi-Dimensional Array
👉 Algorithms
1️⃣ Traverse
2️⃣ Insert
3️⃣ Delete
4️⃣ Get
5️⃣ Search
6️⃣ Size
7️⃣ Reverse
2️⃣ Linked List
👉 Data Structures
1️⃣ Singly Linked List
2️⃣ Doubly Linked List
👉 Algorithms
1️⃣ Traverse
2️⃣ InsertAtHead
3️⃣ InsertAtEnd
4️⃣ Insert
5️⃣ DeleteAtHead
6️⃣ DeleteAtEnd
7️⃣ Delete
8️⃣ Update
9️⃣ Get
1️⃣0️⃣ Search
1️⃣1️⃣ IsEmpty
1️⃣2️⃣ Reverse
👉 Data Structures
1️⃣ Singly Linked List
2️⃣ Doubly Linked List
👉 Algorithms
1️⃣ Traverse
2️⃣ InsertAtHead
3️⃣ InsertAtEnd
4️⃣ Insert
5️⃣ DeleteAtHead
6️⃣ DeleteAtEnd
7️⃣ Delete
8️⃣ Update
9️⃣ Get
1️⃣0️⃣ Search
1️⃣1️⃣ IsEmpty
1️⃣2️⃣ Reverse
3️⃣ Stack
👉 Data Structures
1️⃣ Stack
👉 Algorithms
1️⃣ Push
2️⃣ Pop
3️⃣ IsEmpty
4️⃣ Top
👉 Data Structures
1️⃣ Stack
👉 Algorithms
1️⃣ Push
2️⃣ Pop
3️⃣ IsEmpty
4️⃣ Top
4️⃣ Queues
👉 Data Structures
1️⃣ Queue
2️⃣ Circular Queue
3️⃣ Priority Queue
4️⃣ Dequeue
👉 Algorithms
1️⃣ Enqueue
2️⃣ Dequeue
3️⃣ IsEmpty
4️⃣ Top
👉 Data Structures
1️⃣ Queue
2️⃣ Circular Queue
3️⃣ Priority Queue
4️⃣ Dequeue
👉 Algorithms
1️⃣ Enqueue
2️⃣ Dequeue
3️⃣ IsEmpty
4️⃣ Top
5️⃣ Hash Table
👉 Data Structures
1️⃣ Hash Table
👉 Algorithms
1️⃣ Hashing/Hash Function (Division Method, Multiplication Method)
2️⃣ Hash Collision (Collision Resolution, Open Addressing like Linear Probing, Quadratic Probing, Double Hashing)
👉 Data Structures
1️⃣ Hash Table
👉 Algorithms
1️⃣ Hashing/Hash Function (Division Method, Multiplication Method)
2️⃣ Hash Collision (Collision Resolution, Open Addressing like Linear Probing, Quadratic Probing, Double Hashing)
6️⃣.1️⃣ Tree
👉 Data Structures
1️⃣ Binary Tree
2️⃣ Binary Search Tree
3️⃣ AVL Tree
4️⃣ B-Tree
5️⃣ B+ Tree
6️⃣ Red Black Tree
7️⃣ Trie
👉 Algorithms
1️⃣ Traversal
2️⃣ Height of a Node/Tree
3️⃣ Depth of a Node
4️⃣ Degree of a Node
5️⃣ Insert
6️⃣ Delete
7️⃣ Get
8️⃣ Search
👉 Data Structures
1️⃣ Binary Tree
2️⃣ Binary Search Tree
3️⃣ AVL Tree
4️⃣ B-Tree
5️⃣ B+ Tree
6️⃣ Red Black Tree
7️⃣ Trie
👉 Algorithms
1️⃣ Traversal
2️⃣ Height of a Node/Tree
3️⃣ Depth of a Node
4️⃣ Degree of a Node
5️⃣ Insert
6️⃣ Delete
7️⃣ Get
8️⃣ Search
6️⃣ .2️⃣ Heap
👉 Data Structures
1️⃣ Heap
2️⃣ Fibonacci Heap
👉 Algorithms
1️⃣ Heapify
2️⃣ Insert
3️⃣ Delete
4️⃣ Peek (Max/Min Element)
5️⃣ Extract (Max/Min Element)
👉 Data Structures
1️⃣ Heap
2️⃣ Fibonacci Heap
👉 Algorithms
1️⃣ Heapify
2️⃣ Insert
3️⃣ Delete
4️⃣ Peek (Max/Min Element)
5️⃣ Extract (Max/Min Element)
7️⃣ Graph
👉 Data Structures
1️⃣ Graph (Directed, Undirected)
👉 Algorithms
1️⃣ Graph Traversal
2️⃣ Depth First Search
3️⃣ Breadth First Search
4️⃣ Add Element
5️⃣ Delete Element
6️⃣ Find the path between 2 elements
👉 Data Structures
1️⃣ Graph (Directed, Undirected)
👉 Algorithms
1️⃣ Graph Traversal
2️⃣ Depth First Search
3️⃣ Breadth First Search
4️⃣ Add Element
5️⃣ Delete Element
6️⃣ Find the path between 2 elements
8️⃣ Sorting Algorithms
1️⃣ Bubble Sort
2️⃣ Selection Sort
3️⃣ Insertion Sort
4️⃣ Merge Sort
5️⃣ Quick Sort
6️⃣ Counting Sort
7️⃣ Radix Sort
8️⃣ Bucket Sort
9️⃣ Heap Sort
1️⃣0️⃣ Shell Sort
1️⃣ Bubble Sort
2️⃣ Selection Sort
3️⃣ Insertion Sort
4️⃣ Merge Sort
5️⃣ Quick Sort
6️⃣ Counting Sort
7️⃣ Radix Sort
8️⃣ Bucket Sort
9️⃣ Heap Sort
1️⃣0️⃣ Shell Sort
9️⃣ Search Algorithms
1️⃣ Linear Search
2️⃣ Binary Search
1️⃣ Linear Search
2️⃣ Binary Search
1️⃣0️⃣ Other Algorithms
1️⃣ Divide and Conquer Algorithms
2️⃣ Greedy Algorithms
3️⃣ Dynamic Programming
1️⃣ Divide and Conquer Algorithms
2️⃣ Greedy Algorithms
3️⃣ Dynamic Programming
In coming days I will be posting threads and infographics on all these topics as part of DSA series.
Are you interested? Reply about it.
Reply if you see any algorithms/data structures are missed.
Stay tuned. See you soon. 👋
Are you interested? Reply about it.
Reply if you see any algorithms/data structures are missed.
Stay tuned. See you soon. 👋
Loading suggestions...