• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

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

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Microsoft BING Interview Experience

April 24, 2016 by Dhaval Dave

Hi Today I want to share my Microsoft’s Interview Experience with BING Team, Hyderabd India.

Round 1 : Written Test

HackerEarth 2 Questions, Simple algorithm but complex to handle input, conversion etc, better to practice String, int, vector, arrayList, Stack properly before starting code.

F-2-F

Interviewers were pretty experienced and cool, they understands your work, make you feel relaxed and then start interview.
Round 1 : Asked About my present work, IEEE paper and then Question
Question : How to print all permutation of a String say i/p is ABC then O/p should be
ABC, ACB, BAC, BCA, CAB, CBA.

Round 2 : Several Logical questions, I tried to push my self to show that I have knowledge, which made me select in this round as well.
Q:1) Dictionary based, word break problem (solved using Array, and LinkedList, and also told how hasmap works in Java in similar pattern)
Q:2) Find Cities/Point in diameter X, how to store this information in DS, which Algorithm will be useful
Solved using Graph, and more optimized with 2D matrix.
Q:3) Can you implement own itoa function: code for this.
Q:4) Trie based question

Round 3 : Telephonic Based
Merge sort for Linked List discussed and Discussion on Almost sorted array’s sorting methods.

Round 4 : With Project Manager : Telephonic
Based upon my work and on Machine Learning, AS I don’t have background of Machine Learning, He asked in general, if I want to write Machine learning algorithm for Crawlers, or DataMining, what strategy or Algo I’ll prefer.

Finally I was happily rejected. Due to No previous experience in Machine Learning though I have 3+ years Experience.

Similar Articles

Filed Under: Interview Experience, Microsoft Interview Questions

Reader Interactions

Primary Sidebar

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

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

C++ OOPs Part2

SAP Off Campus Hiring_ March 2015 Sample Questions

Maximum of all subarrays of size k

Check if an array has duplicate numbers in O(n) time and O(1) space

Add Sub Multiply very large number stored as string

LeetCode: Container With Most Water

Edit Distance ( Dynamic Programming )

Find if two rectangles overlap

HackeEarth Flipkart’s Drone

Client Server C program

Maximum occurred Smallest integer in n ranges

Naurki.com Security Breach

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

Find loop in Singly linked list

C++ OOPs Part1

Find Nearest Minimum number in left side in O(n)

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Maximum size of square sub matrix with all 1’s in a binary matrix

LeetCode: Binary Tree Maximum Path Sum

Max Sum in circularly situated Values

TicTacToe Game As Asked in Flipkart

Amazon Interview Experience – SDE Chennai

Find next greater number with same set of digits

1014 Practice Question of New GRE – Princeton

Binary Tree Isomorphic to each other

strtok()

Print all nodes that are at distance k from a leaf node

Given a string, find the first character which is non-repetitive

Cisco Hiring Event 21st – 22nd Feb 2015

Printing each word reverse in string

Copyright © 2026 · Genesis Framework · WordPress · Log in