• 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

problem

Find if a binary tree is height balanced ?

January 12, 2015 by Dhaval Dave

A Height Balanced Tree is tree where for each node this condition is true.
– The difference between heights of left subtree and right subtree for any node is not more than 1.So we can
… Read More

Filed Under: Amazon Interview Question, Interview Questions, Microsoft Interview Questions, problem Tagged With: Binary Tree, tree

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

January 8, 2015 by Dhaval Dave

We have array  a[ ]= {1, 2, 3, 4, 5, 6, 7, 8, 4, 10};
And we need to find a number which is duplicate in O(n) and Space complexity O(1)

Method 1 ) Sorting

… Read More

Filed Under: Adobe Interview Questions, Interview Questions, problem Tagged With: Array

Find the number ABCD such that when multipled by 4 gives DCBA.

January 7, 2015 by Dhaval Dave

We need to find a number ABCD such that,  4(ABCD) = DCBA
These problems can be tricky and/or tedious, but this one isn’t too bad.Method 1 ) Forming Equations and Solving them
… Read More

Filed Under: Flipkart Interview Questions, Interview Questions, Microsoft Interview Questions, problem Tagged With: Mathematical, Puzzle

Word Break Problem

December 30, 2014 by Dhaval Dave

Wordbreak Problem
Given an input string and a dictionary of words, find out if the input string can be segmented into a space-separated sequence of dictionary words. See following examples for more details.
This is a famous
… Read More

Filed Under: Amazon Interview Question, Flipkart Interview Questions, Interview Questions, Microsoft Interview Questions, problem Tagged With: Dynamic Programming, string

Longest Increasing Subsequence

December 22, 2014 by Dhaval Dave

The longest Increasing Subsequence (LIS) problem is to find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order.For example, length of LIS
… Read More

Filed Under: Amazon Interview Question, Flipkart Interview Questions, Hacker Earth Questions, Interview Questions, Microsoft Interview Questions, problem Tagged With: Array, Dynamic Programming

Level order traversal in Spiral form

December 21, 2014 by Dhaval Dave

Write a function to print spiral order traversal of a tree or Write function for Tree traversal in Spiral ZigZag form
For below tree, function should print 1, 2, 3, 7, 6, 5, 4.

           [1]
          
… Read More

Filed Under: Amazon Interview Question, Interview Questions, Microsoft Interview Questions, problem Tagged With: Binary Tree, Stack, tree

Maximum of all subarrays of size k

December 20, 2014 by Dhaval Dave

Given an array and an integer k, find the maximum for each and every contiguous subarray of size k.
Input :
arr[] = {1, 2, 3, 1, 4, 5, 2, 3, 6}
k = 3
… Read More

Filed Under: Flipkart Interview Questions, Microsoft Interview Questions, problem Tagged With: Array

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

December 14, 2014 by Dhaval Dave

Given LinkedList and K=2, N=41->2->3->4->5->6->7->8->9

so Partitioned LinkedList will be

1->2->3->4->5->6->7->8->9

Now delete first K nodes from each subpart and return

… Read More

Filed Under: Amazon Interview Question, Flipkart Interview Questions, Interview Questions, Microsoft Interview Questions, problem Tagged With: Linked List

Possible sizes of bus to carry n groups of friends

December 14, 2014 by Dhaval Dave

There are n groups of friends, and each group is numbered from 1 to n. The ith group contains ai people. 
They live near a bus stop, and only a single bus operates on this
… Read More

Filed Under: Interview Questions, problem Tagged With: Mathematical

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

December 14, 2014 by Dhaval Dave

Consider above question with specific input.
Consider a series in which 8 teams are participating. Each team plays twice with all other teams.
4 of them will go to the semi final.
Minimum and Maximum
… Read More

Filed Under: Adobe Interview Questions, Interview Questions, problem Tagged With: Puzzle

  • « Previous Page
  • Page 1
  • …
  • Page 3
  • Page 4
  • Page 5
  • Page 6
  • Page 7
  • …
  • Page 12
  • Next Page »

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

25 horses 5 tracks Find 3 fastest puzzle

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

Coin Collection Dynamic Programming

Find loop in Singly linked list

Maximum occurred Smallest integer in n ranges

Find position of the only set bit

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

Best Java Book | Top Java Programming Book for Beginners

Closed Parentheses checker

Given Set of words or A String find whether chain is possible from these words or not

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

Naurki.com Security Breach

Maximum path sum between two leaves

LeetCode: Binary Tree Maximum Path Sum

Reversal of LinkedList

1014 Practice Question of New GRE – Princeton

Binary Tree in Java

SAP Off Campus Hiring_ March 2015 Sample Questions

Stickler thief

Find next greater number with same set of digits

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

Advanced SQL Injection

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

Sequence Finder Dynamic Programming

Binary Tree Isomorphic to each other

The greedy coins game Dynamic Programming

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Leetcode: Merge Intervals

Hackerearth : Counting Subarrays

Maximum sum contiguous subarray of an Array

Copyright © 2026 · Genesis Framework · WordPress · Log in