Skip to content

Latest commit

 

History

History
71 lines (59 loc) · 1.67 KB

List_Of_Algorithms.md

File metadata and controls

71 lines (59 loc) · 1.67 KB

List of ALgorithms

Searching and Sorting (Carries 1 point)

  • Linear Search
  • Binary Search
  • Jump Search
  • Interpolation Search
  • Exponential Search
  • Ternary Search
  • Breadth First Search for a Graph
  • Depth First Search for a Graph
  • Selection Sort
  • Bubble Sort
  • Insertion Sort
  • Merge Sort
  • Heap Sort
  • QuickSort
  • Pigeonhole Sort

Greedy Algorithms (Carries 2 points)

  • Activity Selection Problem
  • Kruskal’s Minimum Spanning Tree Algorithm
  • Huffman Coding
  • Prim’s Minimum Spanning Tree Algorithm
  • Dijkstra’s Shortest Path Algorithm
  • Job Sequencing Problem
  • K Centers Problem

Divide and Conquer (Carries 2 points)

  • Median of two sorted arrays
  • Count Inversions
  • Closest Pair of Points
  • Strassen’s Matrix Multiplication

String Algorithms (Carries 2 points)

  • Naive Pattern Searching
  • KMP Algorithm
  • Rabin-Karp Algorithm
  • Boyer Moore Algorithm – Bad Character Heuristic
  • Anagram Substring Search
  • Aho-Corasick Algorithm for Pattern Searching
  • Longest Even Length Substring such that Sum of First and Second Half is same

Dynamic Programming and Backtracking (Carries 3 points)

  • Longest Increasing Subsequence
  • Longest Common Subsequence
  • Edit Distance
  • Matrix Chain Multiplication
  • 0-1 Knapsack Problem
  • Longest Palindromic Subsequence
  • Egg Dropping Puzzle
  • The Knight’s tour problem
  • Rat in a Maze
  • N Queen Problem
  • Subset Sum
  • Sudoku

Graph Algorithms (Carries 3 points)

  • Longest Path in a Directed Acyclic Graph
  • Topological Sorting
  • Snake and Ladder Problem
  • Biconnected Components
  • Articulation Points (or Cut Vertices) in a Graph
  • Strongly Connected Components
  • Travelling Salesman Problem (Approximate using MST)