algorithm/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2025-07-30 05:34:33 +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

2
algorithms/sorting-searching.md
View File

@ -8,10 +8,8 @@ Sorting and Searching
- Search for an element in a sorted and rotated array.
- [Source](http://blog.gainlo.co/index.php/2017/01/12/rotated-array-binary-search/)
- Sort a list where each element is no more than k positions away from its sorted position.
- If you have `N` revisions of a program, write a program that will find and return the first bad revision given a `isBad(revision i)` function.
- Search for an item in a sorted, but rotated, array.
- Merge two sorted lists together.
- Given a list of numbers and a function that returns Low, Medium, or High, sort the list by Lows, then Mediums, then Highs.
- Give 3 distinct algorithms to find the K largest values in a list of N items.
- Find the minimum element in a sorted rotated array in faster than O(n) time.
- Write a function that takes a number as input and outputs the biggest number with the same set of digits.