Home Previous year paper Algorithms Notes About us

Topics

Algorithms

Bit Algorithms:

  1. Bit Representation
  2. Bit Operations
  3. Representing Sets
  4. Hamming Distances
  5. Counting subgrids

Mathematical Algorithms:

  1. Check if a Number is Multiple of 3
  2. Efficient way to multiply with 7
  3. Square root algorithms
  4. Combinatorics
  5. Sweep line algorithms
  6. Lucky Numbers
  7. Find day of the week for a given date
  8. MagicSquare

Searching:

  1. Linear Search
  2. Binary Search
  3. Jump Search
  4. Exponential Search
  5. Ternary Search

Sorting:

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

Divide and Conquer:

  1. Calculate Power
  2. Count Inversion In Array
  3. Median Of Two Sorted Arrays
  4. Strassan Matrix

Greedy Algorithms:

  1. Bit Algorithms
  2. Mathematical Algorithms
  3. Data Structures
  4. Searching
  5. Sorting
  6. Divide and Conquer
  7. Greedy Algorithms
  8. Dynamic Programming
  9. Backtracking
  10. Branch and Bound

Dynamic Programming:

  1. Bit Algorithms
  2. Mathematical Algorithms
  3. Data Structures
  4. Searching
  5. Sorting
  6. Divide and Conquer
  7. Greedy Algorithms
  8. Dynamic Programming
  9. Backtracking
  10. Branch and Bound

Backtracking:

  1. Partition of a set into K subsets with equal sum
  2. Find shortest safe route in a path with landmines
  3. Max Number By Swapping
  4. N Queen Problem
  5. Rat in a Maze
  6. Remove Invalid Parentheses
  7. Solving Cryptarithmetic Puzzles
  8. Tug of War Algorithm
  9. Warnsdorff’s algorithm for Knight’s tour problem
  10. Word Break Algorithm
Quote of the Day