## Microsoft Interview | Set 4

Hi, this is Ishita Gupta. I have been one of the lucky hires of Microsoft this year through oncampus. So wanted to share my experience… Read More »

## Microsoft Interview | Set 3

I would like to thank GEEKSFORGEEKS team that they made my confidence level high when it comes to coding. I finished my interview today, hope… Read More »

## Find four elements that sum to a given value | Set 2 ( O(n^2Logn) Solution)

Given an array of integers, find any one combination of four elements in the array whose sum is equal to a given value X. For… Read More »

## Microsoft Interview | Set 2

Please find the details of my Microsoft Interview below. Date Of Interview: 3rd August,2012 No. of Rounds: 2 online exams + 4 rounds of PI… Read More »

## Microsoft Interview | Set 1

Following are the details of my Microsoft interviews. Date of Interviews: 30th July, 31st July and 3rd August, 2012 No of Rounds: 1 aptitude test,… Read More »

## Word Wrap Problem | DP-19

Given a sequence of words, and a limit on the number of characters that can be put in one line (line width). Put line breaks… Read More »

## DFA based division

Deterministic Finite Automaton (DFA) can be used to check whether a number “num” is divisible by “k” or not. If the number is not divisible,… Read More »

## Maximum Product Subarray

Given an array that contains both positive and negative integers, find the product of the maximum product subarray. Expected Time complexity is O(n) and only… Read More »

## Sudoku | Backtracking-7

Given a partially filled 9×9 2D array ‘grid[9][9]’, the goal is to assign digits (from 1 to 9) to the empty cells so that every… Read More »

## Longest Bitonic Subsequence | DP-15

Given an array arr[0 … n-1] containing n positive integers, a subsequence of arr[] is called Bitonic if it is first increasing, then decreasing. Write… Read More »

## The Celebrity Problem

In a party of N people, only one person is known to everyone. Such a person may be present in the party, if yes, (s)he… Read More »

## Merge two BSTs with limited extra space

Given two Binary Search Trees(BST), print the elements of both BSTs in sorted form. The expected time complexity is O(m+n) where m is the number… Read More »

## Implement two stacks in an array

Create a data structure twoStacks that represents two stacks. Implementation of twoStacks should use only one array, i.e., both stacks should use the same array… Read More »

## Detect Cycle in a Directed Graph

Given a directed graph, check whether the graph contains a cycle or not. Your function should return true if the given graph contains at least… Read More »

## Union and Intersection of two Linked Lists

Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in the given lists. Order of elments… Read More »