Data Structures and Algorithms Study Guide2 min read

0
1357
How to Prepare Data Structures and Algorithms for Interviews
2

How to Prepare Data Structures and Algorithms for Interviews ?

Worried about How to Prepare Data Structures and Algorithms for Interviews ? Finding a Comprehensive Data Structures and Algorithms Study Guide ? Then you are at right webpage. In this post you will get a complete guide to learn and proceed in Data Structure Courses.

Topics

Data Structures

  • Time Complexity
  • Mathematics
  • Bitwise Operators
  • Recursion
  • Array
  • Hashing
  • Strings
  • Linked List
  • Stack
  • Queue
  • Tree
  • Heap
  • Graph
  • Greedy Algorithm
  • Backtracking
  • Dynamic Programming
  • Trie
  • Disjoint Set

Algorithms

  • Number Theory
    • Prime Numbers (Sieve of Eratosthenes)
    • GCD and LCM Euclid’s Algorithm
    • Modular Exponentiation
    • Long arithmetic (Multi, Add)
    • Efficient Prime Factorization
  • Combinatorics(Probability-Combinations-Permutations-Matrix..)
  • Computational geometry
    • Primitive Operations
      • Intuition
      • Polygon Inside, Outside
      • Implementing CCW
      • Immutable Point ADT
    • Convex Hull
    • Closest pair problem
    • Line intersection
  • Sorting
    • QuickSort
    • Counting Sort
    • Merge Sort
  • Searching
    • Binary Search
    • Ternary Search
  • Graph Theory
    • Depth First Search (DFS)
    • Breadth First Search (BFS)
    • Dijkstra’s Shortest Path
    • Minimum Spanning Tree
    • Ford Bellman
    • Floyd Warshall
    • LCA (Lowest Common Ancestor)
    • Max Flow / Min Cut
  • Dynamic programming
    • Knapsack
    • Matrix chain multiplication
    • Coin Change
    • Kadane
    • Longest increasing Subsequence (with RMQ)
  • Strings
    • Z algorithm
    • Suffix Trees/Arrays
    • Knuth-Morris-Pratt Algorithm (KMP)
    • Rabin-Karp Algorithm
    • Hash
  • Bit Manipulation
  • Game theory
    • Nim game
    • Grundy numbers
    • Sprague-Grundy theorem
  • Optional Advanced Algorithms
    • AVL Trees
    • Graph Coloring
    • Mo’s Algorithm
    • Palindromic Tree
    • Heavy Light Decomposition
    • Dynamic Programming by Profile
    • Rod Cutting
    • Topological Sorting
    • DP with Bitmask – Dynamic Programming
    • Diobhantine Equation – Math
    • Flood Fill – Graph

How to Prepare Data Structures and Algorithms for Interviews in 10 Weeks ?

Curriculum

WEEK TOPICSALGORITHMS
1I) Mathematics – Prime Numbers, AP, GP, Equations, LCM, HCF, Factorials, Modular Exponential
II) Bitwise
III) Recursion – Base Cases, Tail Recursion
• GCD and LCM Euclid’s Algorithm
• Josephus Problem
• Tower of Hanoi
2I) Array – Types & Operations
II) Searching
III) String – Operations
• Linear Search
• Binary Search
• Two pointer approach
3I) Sorting – Bubble, Insertion, Selection, Quick Sort, Merge Sort
II) Hashing – Types of Hashing Techniques
4I) Linked List – Singly, Doubly & Circular Linked List
5I) Stack – Operations
II) Queues – Operations, Priority Queue
6I) Tree – Binary Tree & Binary Search Tree• Minimum Spanning Tree (MST)
7I) Binary Heap
II) Graph – Types, Breadth First Search, Depth First Search
• Heap Sort
• Topological Sorting
• Dijkstra’s Shortest Path
• Floyd–Warshall
• Connected Components
• Graph Coloring
8I) Backtracking
II) Dynamic Programming
• Knapsack
• Coin Change
• Kadane
• Painting Fence Algorithm
• Longest Increasing Subsequence
9I) Trie – Insert, Delete & Search
II) Segment Tree
III) Disjoint Set
• Krushkal’s Algorithm
10I) Advanced Pattern Searching• Knuth-Morris-Pratt Algorithm
• Rabin-Karp Algorithm
• Z algorithm

Download Curriculum

How to Prepare Data Structures and Algorithms for Interviews

How to Prepare Data Structures and Algorithms for Interviews ?

Also See – Government of India TULIP Internship Programme

LEAVE A REPLY

Please enter your comment!
Please enter your name here