CS_learn/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2026-04-13 10:19:46 +08:00
Code Issues Packages Projects Releases Wiki Activity

chore: remove freeform questions

Browse Source
This commit is contained in:
Yangshun Tay
2019-09-25 19:05:35 -07:00
parent 9631a1d8d9
commit 002c7f1215
21 changed files with 33 additions and 311 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
contents/algorithms/recursion.md
View File

@@ -11,7 +11,7 @@ Remember to always define a base case so that your recursion will end.
Recursion implicitly uses a stack. Hence all recursive approaches can be rewritten iteratively using a stack. Beware of cases where the recursion level goes too deep and causes a stack overflow (the default limit in Python is 1000). You may get bonus points for pointing this out to the interviewer. Recursion will never be O(1) space complexity because a stack is involved, unless there is [tail-call optimization](https://stackoverflow.com/questions/310974/what-is-tail-call-optimization) (TCO). Find out if your chosen language supports TCO.
## Recommended Leetcode questions
## Recommended LeetCode questions
- [Subsets](https://leetcode.com/problems/subsets/) and [Subsets II](https://leetcode.com/problems/subsets-ii/)
- [Strobogrammatic Number II (Leetcode Premium)](https://leetcode.com/problems/strobogrammatic-number-ii/)
- [Strobogrammatic Number II (LeetCode Premium)](https://leetcode.com/problems/strobogrammatic-number-ii/)