algorithm/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2025-08-02 19:46:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

algo: remove similar question (#202)

Browse Source 
Removed
`- Sort a list where each element is no more than k positions away from its sorted position.`
as it is same as 
`Sort a list of numbers in which each number is at a distance K from its actual position.`
This commit is contained in:
Abhijeet Chakraborty
2021-04-13 06:53:09 +05:30
committed by GitHub
parent 1f64c84450
commit 5d1265df24
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

@ -11,7 +11,6 @@ title: Sorting and Searching
- Given users with locations in a list and a logged-in user with locations, find their travel buddies (people who shared more than half of your locations).
- 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.
- Merge two sorted lists together.
- 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.