About Me

▼
Showing posts with label AlgoMuse. Show all posts
Showing posts with label AlgoMuse. Show all posts
Thursday, February 9, 2012

How many paths from one corner to the diagonally opposite corner in an n x n matrix do not cross the diagonal?

›
1 comment:

The Britney Spears Problem ,Tracking who's HOT and who's not , presents an algorithmic challenge ?

›
  By Brian Hayes Back in 1999, the operators of the Lycos Internet portal began publishing a weekly list of the 50 most popular quer...
Thursday, January 19, 2012

Resilient Binary Search-search an element in O(log n) time in the perturbed array?

›
You are about to search for an element in a sorted array A [1.. n ] using binary search when the array suddenly gets perturbed . By pe...

Valid Strings-erase the smallest possible number of characters such that the remaining string after the erasures is valid

›
A string over the characters (, [, ] and ) is said to be valid if one can reduce the string to the null string by repeatedly erasing two ...
1 comment:

Nab the thief-prove that Alice can win in at most 3n moves.

›
Alice and Bob play the following game: Two cops( c ) and a thief( t ) are positioned at some vertices of an n x n grid. Alice controls th...
1 comment:

Estimating Distance-Find maximum distance between any pair of points in a plane

›
A set of n points are on a plane. Let d denote the maximum distance between any pair of points. Design a linear time algorithm to gu...

Beaded Necklace-Find a sequence of such operations with minimum total cost for a given initial distribution of beads.

›
You are given a circular necklace containing n beads. Each bead maybe black or white. You have to rearrange the beads so that beads of the...