I use O(n^2) to solve it, there will be a better solution!
Think it over using binary search.
Search a 2D Matrix II
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||
I use O(n^2) to solve it, there will be a better solution!
Think it over using binary search.