algorithm/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2025-07-28 04:33:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

contents: integrate best-practice-questions into rest of the docs

Browse Source
This commit is contained in:
Yangshun
2022-04-10 12:30:07 +08:00
parent 54b317849f
commit 99490862b3
2 changed files with 13 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
contents/algorithms/graph.md
View File

@ -52,11 +52,11 @@ In algorithm interviews, graphs are commonly given in the input as 2D matrices w
`|V|` is the number of vertices while `|E|` is the number of edges.
| Algorithm | Big-O |
| -------------------- | --------------------------------- |
| Depth-first search | O(|V| + O|E|) |
| Breadth-first search | O(|V| + O|E|) |
| Topological sort | O(|V| + O|E|) |
| Algorithm | Big-O |
| -------------------- | -------------------------------- |
| Depth-first search | O(|V| + |E|) |
| Breadth-first search | O(|V| + |E|) |
| Topological sort | O(|V| + |E|) |
## Things to look out for during interviews