• 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

Amazon Interview Question

Right view of Binary tree

July 24, 2016 by Dhaval Dave

We are given a Binary Tree, Print the Right view of Binary tree,
Right view of binary tree is  : List of all nodes which are visible If you look at Binary tree from right … Read More

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

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

May 15, 2016 by Dhaval Dave

Given an array of integers, find the nearest smaller number for every element such that the smaller element is on left side.

Examples:

Input:  arr[] = {1, 6, 4, 10, 2, 5}
Output:         {-1, 1, 
… Read More

Filed Under: Adobe Interview Questions, Amazon Interview Question, Flipkart Interview Questions, Interview Questions, Microsoft Interview Questions, problem Tagged With: Array, Stack

Calculate price of parking from parking start end time prices

January 5, 2016 by Dhaval Dave

Given a price rules of parking and start time and end time of parking. Calculate the price

(Below is the table of price rule) Come up with data structure you can store these price rules

… Read More

Filed Under: Amazon Interview Question, Interview Questions, problem Tagged With: Array

Maximum path sum between two leaves

May 11, 2015 by Dhaval Dave

maximum path sum between two leaves

If a binary tree is given, how to find Maximum path sum between two leaves  of binary tree.

All should be numbers
The maximum sum path may or may not go through root. For example,
… Read More

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

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

May 10, 2015 by Dhaval Dave

Roman number conversion

Set of Numbers are given to you.
convert them to Roman numbers.
Solution is in Hacker Earth style… Read More

Filed Under: Adobe Interview Questions, Amazon Interview Question, Flipkart Interview Questions, Hacker Earth Questions, Interview Questions, Microsoft Interview Questions, problem Tagged With: Mathematical, string

Stock Buy Sell to Maximize Profit

April 18, 2015 by Dhaval Dave

Stock Price on each day is given in an array.
Example : [ 10, 12, 7, 5, 9, 15, 13, 18 ] Find the max profit that you can make by buying and selling in … Read More

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

Maximum difference between two elements s.t larger element appears after the smaller number

April 15, 2015 by Dhaval Dave

Find maximum profit if you can buy & sell share just once.

Given an array of integers, find out the difference between any two elements such that larger element appears after the smaller number.

Examples: … Read More

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

Trie Dictionary

April 14, 2015 by Dhaval Dave

tries

Trie also called prefix tree (as they can be searched by prefixes).
The term trie comes from retrieval.
In the example shown, keys are listed in the nodes and values below them. Each … Read More

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

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

April 13, 2015 by Dhaval Dave

A building has n steps. A person can take 1,2 or 3 steps. In how many ways can a person reach top of building.

In order to build logic, lets think from first step
If … Read More

Filed Under: Adobe Interview Questions, Amazon Interview Question, Microsoft Interview Questions, problem Tagged With: Dynamic Programming, Mathematical, Recursion

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

April 13, 2015 by Dhaval Dave

Campus Interview Questions

Couple of years ago when me and my friends appeared for campus interviews in IITs, NITs and BITs we faced many challenging interview questions like N petrol bunks arranged in a city, Sort Stack … Read More

Filed Under: Adobe Interview Questions, Amazon Interview Question, Flipkart Interview Questions, Hacker Earth Questions, Interview Experience, Microsoft Interview Questions

  • « Previous Page
  • Page 1
  • Page 2
  • Page 3
  • Page 4
  • Page 5
  • …
  • Page 8
  • 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

Microsoft BING Interview Experience

VMWare Openings

Find if two rectangles overlap

Python Dictionaries

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

Serialise Deserialise N-ary Tree

The Magic HackerEarth Nirvana solutions Hiring Challenge

Urban Ladder Written Test.

Check Binary Tree is Binary Search Tree or not

Convert number to words java

CodeChef’ RRCOPY

FizzBuzz Solution C C++

Find Percentage of Words matching in Two Strings

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

Singly linked list

Walmart Labs Interview Experience

Flipkart Set 1 On Campus with Answers

Memory Efficient LinkedList

Password Predictor

Subset Sum Problem Dynamic programming

Templates in C++

Introduction To Number Theory ( Part 1 )

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

Minimum insertions to form a palindrome

K’th Largest Element in BST when modification to BST is not allowed

Hackerearth : Counting Subarrays

Binary Tree in Java

Diagonal Traversal of Binary Tree

Circular Linked List

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

Copyright © 2025 · Genesis Framework · WordPress · Log in