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: add tip on traversing arrays (#171)

Browse Source
This commit is contained in:
Rafat Bin Islam
2020-08-03 13:25:39 +06:00
committed by GitHub
parent d355e90f50
commit 256c3847fe
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
contents/algorithms/array.md
View File

@ -13,6 +13,8 @@ For questions where summation or multiplication of a subarray is involved, pre-c
If you are given a sequence and the interviewer asks for O(1) space, it might be possible to use the array itself as a hash table. For example, if the array only has values from 1 to N, where N is the length of the array, negate the value at that index (minus one) to indicate presence of that number.
Also O(n) doesn't mean you can only traverse the array once. Sometimes traversing the array more than once can help you solve the problem easily.
## Arrays are sequences
Are there duplicate values in the array, would it affect the answer?