π©βπ» 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
Loading suggestions...