From 07544ad3b1f823eb4ccbe6e0132ca5723cf3c48c Mon Sep 17 00:00:00 2001
From: Abhijeet Chakraborty <16278759+abhijeet1403@users.noreply.github.com>
Date: Fri, 9 Apr 2021 23:41:46 +0530
Subject: [PATCH] Removing similar question

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.`
---
 contents/algorithms/sorting-searching.md | 1 -
 1 file changed, 1 deletion(-)

diff --git a/contents/algorithms/sorting-searching.md b/contents/algorithms/sorting-searching.md
index ddbea156..77ea6b55 100644
--- a/contents/algorithms/sorting-searching.md
+++ b/contents/algorithms/sorting-searching.md
@@ -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.