tech-interview-handbook/algorithms/sorting-searching.md

Sorting and Searching

• Sorting search results on a page given a certain set of criteria.
• Sort a list of numbers in which each number is at a distance K from its actual position.
• Given an array of integers, sort the array so that all odd indexes are greater than the even indexes.
• 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
• 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.
  • Source