👩💻 Practice these 125+ Algorithms in
❍ C++
❍ Java
❍ Python
❍ JavaScript
Or, any language of your choice
Stay in top 5% of programmers.
⇩
❍ C++
❍ Java
❍ Python
❍ JavaScript
Or, any language of your choice
Stay in top 5% of programmers.
⇩
➊ 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
➀ 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 [1]
➀ Creating a Linked List
➁ Iterate through Linked List
➂ Get an Element
➃ Find an Element
➤ Insert Element(s)
➄ At Start
➅ At End
➆ At Anywhere
➀ Creating a Linked List
➁ Iterate through Linked List
➂ Get an Element
➃ Find an Element
➤ Insert Element(s)
➄ At Start
➅ At End
➆ At Anywhere
➋ Linked List - Algorithms [2]
➤ Delete Element(s)
➇ From Start
➈ From End
➉ From Anywhere
➀➀ IsEmpty
➀➁ Merging Linked Lists
➀➂ Reverse Linked List
➀➃ Check for Cycles
➤ 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
➀ 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
➤ Hash Function
➀ Division Method
➁ Multiplication Method
➂ Universal Hashing
➤ Hash Collision
➃ Collision Resolution
➤ Open Addressing
➄ Linear Probing
➅ Quadratic Probing
➆ Double Hashing
➏ 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
➀ 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
➐ Heap - Algorithms
➀ Heapify
➁ Insert Element
➂ Delete Element
➃ Peek (Max/Min Element)
➄ Extract (Max/Min Element)
➀ Heapify
➁ Insert Element
➂ Delete Element
➃ Peek (Max/Min Element)
➄ Extract (Max/Min Element)
➑ Graph - Algorithms [1]
➤ Adjacency Matrix
➀ Add Edge
➁ Remove Edge
➤ Adjacency List
➂ Add Edge
➃ Remove Edge
➤ Traverse Nodes
➄ Depth First Search
➅ Breadth First Search
➤ Adjacency Matrix
➀ Add Edge
➁ Remove Edge
➤ Adjacency List
➂ Add Edge
➃ Remove Edge
➤ Traverse Nodes
➄ Depth First Search
➅ Breadth First Search
➑ Graph - Algorithms [2]
➤ Shortest Path
➆ Dijkstra's Algorithm
➇ Floyd-Warshall Algorithm
➈ Bellman Ford Algorithm
➤ Minimum Spanning Tree
➉ Kruskal's Algorithm
➀➀ Prim's Algorithm
➤ Shortest Path
➆ Dijkstra's Algorithm
➇ Floyd-Warshall Algorithm
➈ Bellman Ford Algorithm
➤ Minimum Spanning Tree
➉ Kruskal's Algorithm
➀➀ Prim's Algorithm
➑ Graph - Algorithms [3]
➤ 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
➤ 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 - Algorithms [4]
➁➁ Graph Cycle
➤ Topological Sorting
➁➂ Find all topological sorting
➁➃ Kahn's Algorithm
➁➄ Longest Path
➤ Flow Network
➁➅ Ford-Fulkerson Algorithm
➁➆ Edmonds–Karp algorithm
➁➇ Dinic's Algorithm
➁➁ 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
➀ Linear Search
➁ Jump Search
➂ Binary Search
➃ Interpolation Search
➄ Exponential Search
➅ Ternary Search
➓ Sorting Algorithms [1]
➀ 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
➀ 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
➓ Sorting Algorithms [2]
➀➃ 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
➀➃ 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
جاري تحميل الاقتراحات...