Microsoft Interview Questions

Printing each word reverse in string

July 29, 2014 by Dhaval Dave

Below is the code to print each word backward
Example if Input is “This is Sparta”
Out put should be “sihT si atrapS”

Thanks to Dhaval for suggesting this approach

#include<stdio.h>
#include<string.h>

int main()
{

CodeChef’ RRCOPY

July 26, 2014 by Dhaval Dave

Def:
You had an array of integer numbers. You also had a beautiful operations called “Copy-Paste” which allowed you to copy any contiguous sub-sequence of your array and paste it in any position of your

Wrong Directions given find minimum moves so that he can reach to the destination

July 20, 2014 by Dhaval Dave

A person wants to go from origin to a particular location, he can move in only 4 directions(i.e East, West, North, South) but his friend gave him a long route, help a person to find

Find the kth number with prime factors 3, 5 and 7

July 17, 2014 by Dhaval Dave

Find the kth number with prime factors 3, 5 and 7

Design an algorithm such that we have to find the k th element in the array such that their only prime factors are 3,5

Print vertical sum of all the axis in the given binary tree

July 15, 2014 by Dhaval Dave

Print Vertical Sum of all the axis in the given binary Tree.

Most of times in written test , you will encounter this very good question.

given a binary tree.

(most of times a complete

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

July 11, 2014 by Dhaval Dave

Find the first circular tour that visits all petrol pumps

There are n petrol bunks arranged in circle. Each bunk is separated from the rest by a certain distance. You choose some mode of travel

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

July 10, 2014 by Dhaval Dave

Robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it.

Printing Longest Common Subsequence

April 25, 2014 by Dhaval Dave

Printing Longest Common Subsequence

Given two sequences, print the longest subsequence present in both of them.

Examples:
LCS for input Sequences “ABCDGH” and “AEDFHR” is “ADH” of length 3.
LCS for input Sequences “AGGTAB” and

flattens 2 D linked list to a single sorted link list

March 27, 2014 by Dhaval Dave

Write a function flatten() which flattens this linked list with each node down sorted link list to a single link list with all the elements in sorted order.

We have given Two methods in O(n^2)

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

March 25, 2014 by Dhaval Dave

Generate Postorder traversal of Tree from Inorder and Preorder traversal of tree without generating Tree.

Input:
In-order traversal in[] = {4, 2, 5, 1, 3, 6}
Pre-order traversal pre[] = {1, 2, 4, 5, 3,

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Microsoft Interview Questions

Printing each word reverse in string

CodeChef’ RRCOPY

Wrong Directions given find minimum moves so that he can reach to the destination

Find the kth number with prime factors 3, 5 and 7

Find the kth number with prime factors 3, 5 and 7

Print vertical sum of all the axis in the given binary tree

Print Vertical Sum of all the axis in the given binary Tree.

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

Find the first circular tour that visits all petrol pumps

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

Robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it.

Printing Longest Common Subsequence

Printing Longest Common Subsequence

flattens 2 D linked list to a single sorted link list

Write a function flatten() which flattens this linked list with each node down sorted link list to a single link list with all the elements in sorted order.

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

Generate Postorder traversal of Tree from Inorder and Preorder traversal of tree without generating Tree.

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR