4 Rounds

1. Validate BST
2. Search in sorted 2D matrix
3. Min cost path in graph
4. Find common longest substring in an array of strings