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

algorithms: remove duplicate question from sorting-searching.md (#134)

Browse Source
This commit is contained in:
Sameer Indarapu
2019-08-25 19:07:53 +05:30
committed by Yangshun Tay
parent c80f43a4f3
commit 0da41f944f
1 changed files with 0 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
contents/algorithms/sorting-searching.md
View File

@ -12,7 +12,6 @@ title: Sorting and Searching
- Search for an element in a sorted and rotated array. - Search for an element in a sorted and rotated array.
- [Source](http://blog.gainlo.co/index.php/2017/01/12/rotated-array-binary-search/) - [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. - Sort a list where each element is no more than k positions away from its sorted position.
- Search for an item in a sorted, but rotated, array.
- Merge two sorted lists together. - Merge two sorted lists together.
- Give 3 distinct algorithms to find the K largest values in a list of N items. - 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. - Find the minimum element in a sorted rotated array in faster than O(n) time.