algorithm/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2025-07-29 21:23:14 +08:00
Code Issues Packages Projects Releases Wiki Activity

Restructure preparation section

Browse Source
This commit is contained in:
Tay Yang Shun
2017-09-25 09:44:24 +08:00
parent 671b874b43
commit 359490ba47
8 changed files with 96 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
algorithms/tree.md
View File

@ -15,7 +15,6 @@ Tree
- Given a directory of files and folders (and relevant functions), how would you parse through it to find equivalent files?
- Write a basic file system and implement the commands ls, pwd, mkdir, create, rm, cd, cat, mv.
- Compute the intersection of two binary search trees.
- Given a tree, where the parent has any number of nodes and each node has a number, return the average of all the nodes on each level in an array.
- Given a binary tree, output all the node to leaf paths of it.
- Given a string of characters without spaces, is there a way to break the string into valid words without leftover characters?
- Print a binary tree level by level.