Skip to content

Data Structures and Algorithms Implementation. Common Interview Problems

Notifications You must be signed in to change notification settings

vousmevayez/data_structures

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

96 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

data_structures

Data Structures and Algorithms Implementation

Topics

  1. Priority Queue
  2. Hash Table
  3. Heaps
  4. Trees and Advanced Trees
  5. Graphs
  6. Greedy Algorithms
  7. Dynamic Programming
  8. Sorting and Searching (already done, but will do it in a systematic manner again)

Problems that are hard for me

  1. Replace 'Pi'.
  2. Holiday Accomodation.

Revision (Must)

Revise from Apni Kaksha

  1. Quick Sort
  2. Merge Sort (Not so much, but still)
  3. All recursion problems. (N Queen (isSafe function), Sudoku Solver)
  4. Binary Search Problems (Book Allocation, Aggressive Cows etc)
  5. Dynamic Programming Problems (Coin Change)
  6. BackTracking (Rat in a Maze, N Queen, Sudoku, Knights Tour)
  7. TSP
  8. SSSP
  9. STL revision.
  10. Greedy Problems.
  11. BFS Problem (Snake and Ladders). I'll have to revisit later.
  12. Topological Sorting using BFS.

Data-Structures that I enjoyed the most

  1. Segment Trees.
  2. Segment Trees with Lazy Propagation.
  3. Graph BFS/DFS.
  4. BST Implementation.

Expected Areas of Work

  1. Floorplanning.
  2. Routing.
  3. Timing Problems.

CP Practice

About

Data Structures and Algorithms Implementation. Common Interview Problems

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • C++ 100.0%