A search algorithm is any algorithm which solves the Search problem, namely, to retrieve information stored within some data structure, or calculated in the search space of a problem domain. Examples of such structures include but are not limited to a Linked List, an Array data structure, or a Search tree.

#### Square Root

Given a non-negative number num find the square root of the number. If the square root is not a integer return the whole part. (Ex sqrt(10) = 3) Try to do it without using system libraries. Please ...
Ali Ahmet Bingül
Published on Feb 26th, 2018

#### The Painter's Partition Problem

We have to paint n boards of length [A1, A2, ..., An]. There are k painters available and each takes 1 unit time to paint 1 unit of board. The problem is to find the minimum time to get this job done ...
Berkan Teber
Published on Jan 15th, 2018

#### 1 to 10 Logic Test

Problem Given a number n, return True if n is in the range 1..10, both are included. Unless outSideMode is True, in which case return True if the number is less or equal to 1, or greater or equal t ...
Erkan Ercan
Published on Jan 12th, 2018

#### Search an element in a sorted and rotated array

An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array at some pivot unknown to you beforehand. So for instance, [ 1, 2, 3 ...
Murat Sütunç
Published on Jan 4th, 2018