رتبها

Swapna Kumar Panda

21 تغريدة 7 قراءة Oct 16, 2022

👩‍💻 Practice 125+ Algorithms
Using your favourite language
❍ C
❍ C++
❍ Java
❍ C#
❍ Golang
❍ Python
❍ JavaScript
❍ Rust
❍ Dart
Covering 25+ Data Structures.
⇩

If you are learning or planning to learn DSA in the near future, here is the most effective roadmap.
Take a look and practice the given algorithms.

➊ Data Structures
➀ Array
❯ One-Dimensional Array
❯ Multi-Dimensional Array
➁ Linked List
❯ Singly Linked List
❯ Doubly Linked List
❯ Circular Linked List

.
➂ Stack
➃ Queue
❯ Simple Queue
❯ Circular Queue
❯ Priority Queue
❯ Double Ended Queue (Deque)
➄ Hash Table
➅ Heap
❯ Max Heap
❯ Min Heap
❯ Fibonacci Heap

.
➆ Tree
❯ General Tree
❯ Binary Tree
❯ Binary Search Tree
❯ AVL Tree
❯ B-Tree
❯ B+ Tree
❯ Red Black Tree
❯ Trie
➇ Graph
❯ Directed Graph
❯ Undirected Graph

➋.➀ Array - Algorithms
➀ Creating an Array
➁ Iterate through Array
➂ Get an Element
➃ Search an Element
➄ Insert Element(s)
➅ Delete Element(s)
➆ Filter an Array
➇ Fetch a Sub-Array
➈ Merging Arrays
➉ Reverse Array
➀➀ Rotate Array

➋.➁ Linked List - Algorithms
➀ Creating a Linked List
➁ Iterate through Linked List
➂ Get an Element
➃ Find an Element

➤ Insert Element(s)
➄ At Start
➅ At End
➆ At Anywhere
➤ Delete Element(s)
➇ From Start
➈ From End
➉ From Anywhere
➀➀ IsEmpty
➀➁ Merging Linked Lists
➀➂ Reverse Linked List
➀➃ Check for Cycles

➋.➂ Stack - Algorithms
➀ Push
➁ Pop
➂ IsEmpty
➃ IsFull
➄ Peek

➋.➃ Queue - Algorithms
➀ Enqueue
➁ Dequeue
➂ IsEmpty
➃ IsFull
➄ Peek

➋.➄ Hash Table - Algorithms
➤ Hash Function
➀ Division Method
➁ Multiplication Method
➂ Universal Hashing
➤ Hash Collision
➃ Collision Resolution
➤ Open Addressing
➄ Linear Probing
➅ Quadratic Probing
➆ Double Hashing

➋.➅ Heap - Algorithms
➀ Heapify
➁ Insert Element
➂ Delete Element
➃ Peek (Max/Min Element)
➄ Extract (Max/Min Element)

➋.➆ Tree - Algorithms
➀ Traversal
➁ Height of a Node/Tree
➂ Depth of a Node
➃ Degree of a Node
➤ Traversal
➄ In Order
➅ Pre Order
➆ Post Order
➇ Level Order
➈ Insert
➉ Delete

➋.➇ Graph - Algorithms
➤ Adjacency Matrix
➀ Add Edge
➁ Remove Edge
➤ Adjacency List
➂ Add Edge
➃ Remove Edge
➤ Traverse Nodes
➄ Depth First Search
➅ Breadth First Search

➤ Shortest Path
➆ Dijkstra's Algorithm
➇ Floyd-Warshall Algorithm
➈ Bellman Ford Algorithm
➤ Minimum Spanning Tree
➉ Kruskal's Algorithm
➀➀ Prim's Algorithm

➤ Connectivity
➀➁ Check connectivity b/w nodes
➀➂ Find all paths
➀➃ Articulation points
➀➄ Bridges
➀➅ Hamiltonian Path
➀➆ Hamiltonian Cycle
➀➇ Eulerian Path
➀➈ Eulerian Cycle
20. Find # of islands
➁➀ Transitive Closure

➁➁ Graph Cycle
➤ Topological Sorting
➁➂ Find all topological sorting
➁➃ Kahn's Algorithm
➁➄ Longest Path
➤ Flow Network
➁➅ Ford-Fulkerson Algorithm
➁➆ Edmonds–Karp algorithm
➁➇ Dinic's Algorithm

➌ Search Algorithms
➀ Linear Search
➁ Jump Search
➂ Binary Search
➃ Interpolation Search
➄ Exponential Search
➅ Ternary Search

➍ Sorting Algorithms
➀ Bubble Sort
➁ Selection Sort
➂ Insertion Sort
➃ Merge Sort
➄ Quick Sort
And, a few advanced ones,
➅ Binary Insertion Sort
➆ 3-way Merge Sort
➇ 3-way Quick Sort
➈ Counting Sort
➉ Radix Sort
➀➀ Bucket Sort
➀➁ Heap Sort

➀➂ Shell Sort
➀➃ Tim Sort
➀➄ Odd-Even Sort
➀➅ Comb Sort
➀➆ Cocktail Sort
➀➇ Tree Sort
➀➈ Cartesian Sort
20. Pigeonhole Sort
➁➀ Cycle Sort
➁➁ Strand Sort
➁➂ Pancake Sort
➁➃ Permutation Sort
➁➄ Gnome Sort
➁➅ Bitonic Sort
➁➆ Sleep Sort

Hey 👋
I am a Tech Writer, Educator, and Mentor from India 🇮🇳, here sharing
✰ Tutorials
✰ Tricks
✰ Career Tips
✰ Cheat Sheets
✰ Practice Questions
✰ Roadmaps
on
➠ Web Development
➠ Data Structures and Algorithms
➠ Databases
Thanks for reading. 🙏

جاري تحميل الاقتراحات...

التصنيفات

المزيد من هذا الكاتب

مواضيع ذات صلة

الأكثر اعجابا

التصنيفات

المزيد من هذا الكاتب

مواضيع ذات صلة

الأكثر اعجابا

فك الثريد