Skip to content

MrinmoiHossain/Algorithms

Repository files navigation

Algorithms

Data Structure

  • Linked list
  • Stack
  • Queue - Priority Queue
  • Heap
  • Hash table
  • Map, HashMap
  • Disjoint Set, Union Find
  • Tree, Binary Tree
  • Binary Search Tree
  • Trie
  • Suffix Array
  • Segmented Tree, Range minimum Query
  • Binary Indexed Tree(BIT)
  • Heavy light Decomposition

Sorting

Searching

-Linear Search -Binary Search -Ternary Search

Dynamic Programming

Rod Cutting
Maximum Sum (1D, 2D)
Coin Change
Longest Common Subsequence
Longest Increasing subsequence, Longest Decreasing Subsequence
Matrix Chain multiplication
Edit Distance
0-1 Knapsack
Bitmask DP
Traveling Salesman problem
Digit DP

Greedy Algorithm:

Activity selection/Task scheduling problem
Huffman coding
Knapsack problem

Graph Theory:

Graph Representation(matrix, list/vector)
Breadth First Search(BFS)
Depth First Search(DFS)
Topological Sort
Strongly Connected Component(SCC)
Minimum Spanning Tree(kruskal, prim)
All pair's shortest path(Floyd Warshall)
Djkastra algorithm
Bellman Ford Algorithm
Directed Acyclic Graph
Bipartite Matching
Max-Flow, Min-cost max-flow
Cayley's Theorem
Articulation Point, Bridge
Euler tour/path
Hamiltonian Cycle
Stable Marriage problem
Chinese Postman problem

Mathematics and Number Theory:

Computational Geometry:

Pick's Theorem
Convex hull
Line Intersection
Point in a polygon
Area of a polygon
Line Sweeping
Polygon intersection
Closest Pair

Game Theory:

Take Away game
Nim
Sprague-grundy Number

String:

Naive String matching
Rabin karp Algo
Finite Automata
Knuth-Marris-Pratt Algo
Manacher's Algo
Aho korasick's Algo
Boyer-Moore algo

Others

Releases

No releases published

Packages

No packages published