#### Top algorithms –

Every computer science student is expected to know below algorithms –

Lee algorithm | Shortest path in a Maze

Floyd’s Cycle Detection Algorithm

Longest Increasing Subsequence

Inorder, Preorder, Postorder Tree Traversals

Disjoint-Set Data Structure (Union-Find Algorithm)

Kruskal’s Algorithm for finding Minimum Spanning Tree

#### Top Data Structures –

Along with above algorithms, every computer science student is expected to implement below data structures –

Linked List Implementation | Part 2

Insertion in BST

Search given key in BST

Deletion from BST

Graph Implementation using STL

Graph Implementation in C++ without using STL

Trie Implementation | Insert, Search and Delete

Memory efficient Trie Implementation using Map | Insert, Search and Delete

One is also expected to be familiar with other programming paradigms like Backtracking, Dynamic Programming, Divide & Conquer, Greedy Algorithms and concepts like Hashing and Recursion.

**Thank you for being with us. 🙂**

## Leave a Reply

This list just about covers the entirety of my Data Structures and Algorithms classes.

It’s nice that they provide a breakdown and example for each concept.

Yeah this is great review. Will definitely help with interviews. Thanks!

I found your site so helpfull in my exam preparation. Thanks for the great job.

It gave me great help. Thanks for the great job.

very nice!!

Very good. As a new grad they will test you for this in interviews. 20 years later they will still expect you to know this.