Please enable JavaScript.
Coggle requires JavaScript to display documents.
Interview Preparation - Coggle Diagram
Interview Preparation
DS and Algo
String Algorithms
- Longest Palindromic Substring
- String Matching with Wildcard
-
- Longest Repeating Subsequence
- Count all distinct substrings of a given string
- Reverse words in a given string
- Check if a string is a rotated palindrome
- KMP Algorithm for Pattern Searching
- Minimum characters to be added at front to make string palindrome
-
Searching Algorithms
-
-
-
-
- Breadth-First Search (BFS)
-
-
Greedy Algorithms
-
-
- Job Sequencing with Deadlines
- Activity Selection Problem
- Greedy Algorithm to find Minimum number of Coins
- Minimum Number of Platforms Required for a Railway/Bus Station
- Maximum Length Chain of Pairs
- Minimize Cash Flow among a given set of friends who have borrowed money from each other
- Connect n Ropes with Minimum Cost
- Prim’s Minimum Spanning Tree (MST)
Tree Algorithms
- Lowest Common Ancestor (LCA)
-
- Binary Tree Level Order Traversal
- Serialize and Deserialize a Binary Tree
- Check if a Binary Tree is BST
- Inorder Traversal without Recursion
- Convert Binary Tree to Doubly Linked List
- Check if Two Trees are Identical
- Maximum Width of a Binary Tree
-
-
Graph Algorithms
-
-
-
-
-
-
- Depth-First Traversal of a Graph
- Breadth-First Traversal of a Graph
- Detect Cycle in a Directed Graph
- Articulation Points (or Cut Vertices) in a Graph
-
Array Algorithms
-
-
-
- Find the equilibrium index of an array
-
- Minimum Platforms Required for a Railway/Bus Station
- Rotate an array to the right by k steps
- Kth smallest/largest element in an array
- Maximum Length Bitonic Subarray
-
-