Skip to content

Latest commit

 

History

History
101 lines (81 loc) · 5.04 KB

DOCUMENTATION.md

File metadata and controls

101 lines (81 loc) · 5.04 KB

Table of Contents

Data Structures Implementation

  1. Priority Queue
  2. Hashmaps
  3. Trees
  4. Graphs
  5. Tries
  6. Segment Trees
  7. Fenwick Trees
  8. Stacks
  9. Queues
  10. Linked List
  11. Queues with linked list
  12. Stacks with linked list
  13. Double Linked List
  14. Circular Linked List

Important Algorithms

  1. Sorting Algos
  2. Backtracking
  3. Dynamic Programming
  4. Graphs
  5. String-Matching
  6. Tree Algorithms
  7. Searching Algorithms
  8. Others

Sorting Algos

  1. Bubble Sort
  2. Insertion Sort
  3. Merge Sort
  4. Selection Sort
  5. Quick Sort
  6. Counting Sort
  7. Radix Sort
  8. Heap Sort

BackTracking

  1. Selection Problems
  2. Binary strings that can be formed from given wildcard pattern
  3. Determine-pattern-matches-string-not
  4. Find Longest Possible Route in a Matrix
  5. Find-combinations-of-elements-satisfies-given-constraints
  6. Find-shortest-path-in-maze
  7. Find-ways-calculate-target-elements-array
  8. Generate-list-of-possible-words-from-a-character-matrix
  9. Hamiltonian_paths
  10. k-partition-problem-print-all-subsets
  11. kcolor_graph
  12. knight
  13. N-Queen
  14. Permutations of a given string

Dynamic Programming

  1. 0-1 Knapsack
  2. Edit Distance
  3. Longest Increasing Subsequence
  4. Longest Palindromic Substring
  5. Rod Cutting Problem
  6. Matrix Chain Multiplication

Graphs

  1. All Pair Shortest Path
  2. Bipartite Graph
  3. Cycle Detection
  4. DSU
  5. Euler Path and Cycle
  6. Hamiltonian Path and Cycle
  7. Longest Path in a DAG
  8. Minimum Spanning Tree
  9. Single Source Shortest Path
  10. Topological Sort
  11. Traversals

String Matching

  1. KMP Algorithm
  2. Z-algo

Tree Algorithms

  1. Traversals
  2. LCA
  3. BST

Searching Algorithms

  1. Binary Search
  2. Linear search
  3. Ternary Search

Other Algorithms

  1. Stable Matching