About Me

▼
Showing posts with label Microsoft Interview. Show all posts
Showing posts with label Microsoft Interview. Show all posts
Sunday, September 30, 2012

While travelling in a cycle race, there are several pit stops. A cyclist can travel upto 50 km without stopping at any pit stop, where he can have a health drink and refill his energy. Given a start point ’t’ and let ’k’ be the distance needed to be travelled by the cyclist, find an efficient algorithm to reach the destination ’d’ so as to have minimum pit stops and prove your algorithm is the most optimal one.

›

You have given n numbers from 1 to n. You have to sort numbers with increasing number of set bits.

›
for ex: n=5. output: 1,2,4,3,5 Note: If you have two number with equal number of set bits, then number with lowest value come first in ...
Monday, September 24, 2012

Write a function to convert Hexadecimal number (String) to Decimal Number (Int)

›
Sunday, September 23, 2012

Maximum Sum Subsequence in an unsorted array of size n

›
We are given an array A having n integers. What we want to find is a contiguous subseqnence (A[i], A[i+1], …, A[j]) such that the sum of ...
Saturday, September 1, 2012

Remove all two zeros in the given string. Example: a3409jd00dk000d Output: a3409jddk000d Note: If there are less/more than two zeros consecutive, it should not be replaced.

›
#include<iostream> #include <string.h> using namespace std ;   void removeDoubleZeros ( char * src ) { int len = str...

You have a book will billion pages. Each Page P has L lines and each lines has W number of words. Design a search algorithm which gives me best match search results. Best match is when all the words given by user exactly matches.

›

Given two string, check whether the other is permutation of first one or not. Eg: abc cba Ans: True Eg: abca abbc: Ans: False

›
1.take an array of 256 size,(for ascii characters), initialize with 0. 2.iterate through the both string,increment the value of array1 by ...
Sunday, August 26, 2012

Given an expression remove the unnecessary brackets in it with out creating an ambiguity in its execution. input output

›
 ex1: (a+(b)+c) a+b+c ex2: (a*b)+c a*b+c
Saturday, August 25, 2012

Given n find all possible representations of n in Fibonacci binary number system.

›
Consider the Fibonacci Seies 1, 2, 3, 5, 8, 13..... Now consider a Fibonacci binary number system of numbers where numbers are considere...
Sunday, April 29, 2012

Find the kth smallest element in a (MxN) matrix.

›
PS:Think how efficiently u can do same for an array .
3 comments:
Monday, February 27, 2012

Write an algorithm that prints an unordered sets of k elements chosen from a set of size n.

›
Example, let the size of the give set be n and set = {0, 1, 2, 3, 4} and we need to find all the subsets of size 3, then there will be a t...
2 comments:
Saturday, December 10, 2011

give an algorithm for finding duplicate parenthesis in a expression. (( a + b ) * (( c + d )))

›
Tuesday, November 29, 2011

Find the sum of contiguous subarray within a one-dimensional array of numbers which has the largest sum.

›
Tuesday, November 15, 2011

Given Table of Cities , Find Minimum Number of Hopes Required to Fly From One to Other City

›
There is a very Primitive Database and it has a table say "Travel". The content of table is as follows: Source | Dest --------...
Friday, August 19, 2011

Count the number of islands in an ocean where ocean is represented as a grid. Cells, having a part of any island, are marked as 'x' otherwise 'o'.

›
Saturday, August 6, 2011

Coin Denomination Problem

›
Let us say we have an amount we have to pay someone: say $97. The given currency has notes worth $1, $5, $10 and $50. Now, what is the minim...
2 comments:
Tuesday, July 26, 2011

Find The Number of Unique Path in Maze Where Robot is Sitting at Top-Left Corner & Can Move According to Given Constraints

›
A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below). The robot can only move either down or righ...
1 comment:
Saturday, July 16, 2011

How to Count Number of Set Bits e.g. Number of 1's efficiently ?

›
This Question is asked in almost all core s/w companies & most of we know logarithmic solution of this problem but there exist a consta...
Saturday, June 25, 2011

Write a program to merge two BST efficiently in O(n)

›
There are two methods to do this :- 1st 1)convert both tree into doubly linked list 2) merge both these doubly linked list 3) then crea...
Thursday, June 23, 2011

Wap to Replace all the instances of ’%’ with this string s,offered that the length of the array

›
Given an array of dimension n with very first l positions crammed with characters and a string s ,replace all the instances of ’%’ with thi...
2 comments: