Algorithms Forever ...

Given an sorted array of integers, perform binary search to find the index of the range in which the number lies. A range is specified by ...

Given an array of N distinct integers sorted in ascending order, write a function that returns a Fixed Point in the array, if there is any...

Given an unsorted array of nonnegative integers, find a continuous subarray which adds to a given number. Examples: Input: arr[] = {1...

Given an integer k and an sorted array A (can consist of both positive and negative numbers), output 2 integers from A such that a-b=k in ...

Given three numbers a, b and c. Write a program to swap them circularly (as per following example) using only one single statement in any ...

An integer obtained by reversing the bits of a given integer A is denoted as bit-rev(A). For example, bit-rev(25) = 19, because the binar...

Consider a Linked List with each Node, in addition to having a 'next' pointer also has a 'random' pointer. The 'random...

Given a sorted array input[] of size N with possible duplicate integer elements. Devise an algorithm to find out the count of occurrences ...

There is a big file containing 10^8 integers, one per line. Devise an algorithm to find the largest 100 integers among them. Remember you ...

Given an array of N distinct integers with the property that there exists an index K (0 <= K <= N-1) such that input[0], ..., input...

Given a sequence of N integers, devise an algorithm to find a sub-sequence S[] for which sum of its elements is maximum and such that S c...

Given a string. Write an algorithm to remove adjacent characters if they are same. Ex. Input = abccbcba remove cc => abbcba remove bb =...

Given an array of integers with size 2N+1 such that N elements appear twice in arbitrary positions and 1 element appears only once. Devis...

Write a function that takes an int array of size M, and returns (true/false) if the array consists of the numbers only within the range [...

Given an array of size N which contains all the numbers from 1 to N-1. Find the number which is repeated in O(N) time. How do you proceed ...