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

Add lonely number problem (#37)

Browse Source
This commit is contained in:
Jorge Gonzalez
2017-10-09 13:44:08 -04:00
committed by Yangshun Tay
parent 5f5f0cde51
commit 0516f5e974
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
algorithms/array.md
View File

@ -56,3 +56,5 @@ Arrays
- Given an array, return the length of the longest increasing contiguous subarray.
- E.g., `[1, 3, 2, 3, 4, 8, 7, 9]`, should return `4` because the longest increasing array is `[2, 3, 4, 8]`.
- [Source](http://blog.gainlo.co/index.php/2017/02/02/uber-interview-questions-longest-increasing-subarray/).
- Given an array of integers where every value appears twice except one, find the single, non-repeating value. Do so with a running time of O(1).
- E.g., `[2, 5, 3, 2, 1, 3, 4, 5, 1]` returns 4, because it is the only value that appears in the array only once.