• 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

Binary Search

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

November 14, 2014 by Dhaval Dave

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1
Example : 00001111
Output : 4Method 1 : in O(n) we can do it .
… Read More

Filed Under: Adobe Interview Questions, Amazon Interview Question, Interview Questions, Microsoft Interview Questions, problem Tagged With: Array, Binary Search

Search element in a matrix with all rows and columns in sorted order

August 27, 2014 by Dhaval Dave

Given a matrix containing unique numbers in which all rows and columns are in sorted order.
And You have to search an element output its location row,column number .
If no such element the just
… Read More

Filed Under: Amazon Interview Question, Flipkart Interview Questions, Interview Questions, Microsoft Interview Questions, problem Tagged With: 2d matrix, Binary Search

Find min element in Sorted Rotated Array (With Duplicates)

August 4, 2014 by Dhaval Dave

Problem: Find the minimum element in a sorted and rotated array if duplicates are allowed:
Example: { 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 1, 1, 2}   output: 0
Algorithm:

This problem

… Read More

Filed Under: Amazon Interview Question, Flipkart Interview Questions, Interview Questions, Microsoft Interview Questions Tagged With: Array, Binary Search

Find min element in Sorted Rotated Array (Without Duplicates)

August 4, 2014 by Dhaval Dave

Problem: Find the minimum element in a sorted and rotated array if duplicates not allowed:
Example: {3, 4, 5, 6, 7, 1, 2} output: 1

Algorithm:
This problem can be easily solved in O(n) time

… Read More

Filed Under: Amazon Interview Question, Flipkart Interview Questions, Interview Questions, Microsoft Interview Questions, problem Tagged With: Array, Binary Search

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

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

Given a sorted array and a number x, find the pair in array whose sum is closest to x

Sort an array according to the order defined by another array

LeetCode: Binary Tree Maximum Path Sum

Closed Parentheses checker

Implement LRU Cache

VMWare Openings

Practo Hiring Experience

Adobe Interview Questions 8 month Exp

Common Ancestor in a Binary Tree or Binary Search Tree

Find two non repeating elements in an array of repeating elements

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

Connect n ropes with minimum cost

Find if a binary tree is height balanced ?

Count Possible Decodings of a given Digit Sequence

25 horses 5 tracks Find 3 fastest puzzle

Microsoft BING Interview Experience

Coin Collection Dynamic Programming

Reverse a Linked List in groups of given size

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

SAP Hiring Off-Campus General Aptitude

Binary Tree Isomorphic to each other

Binary Tree in Java

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

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

Count number of ways to reach a given score in a game

Max Sum in circularly situated Values

Check Binary Tree is Binary Search Tree or not

1014 Practice Question of New GRE – Princeton

Copyright © 2026 · Genesis Framework · WordPress · Log in