Top 10 algorithms in Interview Questions
- Breadth First Search(BFS)
- Depth First Search(DFS)
- Shorest Path from source to all vertices(Dijkstra)
- All Pairs Shorest Path problem.(Floyd)
- To detect a cycle in a Graph(Union Find)
- Quick Sort(Divide and Conquer)
- Bubble Sort
- Insert Sort
- Heap Sort(Binary Heap)
- Merge Sort(Divide and Conquer)
- Binary Search
- Search an element in a sorted and rotated array(O(logN),BinarySearch)
- Find minimum depth of binary tree(Recursive)
- Maximum Path Sum in a Binary Tree(Recursive)
- Maximum Path Sum from Leaf to Root in Binary Tree(Recursive)