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

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

5

March 29, 2015 by Dhaval Dave

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

Urban Ladder Written Test.

C++ OOPs Part1

Subset Sum Problem Dynamic programming

Closed Parentheses checker

Practo Hiring Experience

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

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

The greedy coins game Dynamic Programming

SAP Off Campus Hiring_ March 2015 Sample Questions

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

Print vertical sum of all the axis in the given binary tree

LeetCode : Word Search

Find min element in Sorted Rotated Array (Without Duplicates)

SAP Off Campus Hiring_ March 2015 Verbal Skills

LeetCode: Binary Tree Maximum Path Sum

ADOBE Aptitude C Language Test

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

Diagonal Traversal of Binary Tree

Maximum sum contiguous subarray of an Array

Word Break Problem

Trie Dictionary

Coin Collection Dynamic Programming

Apriori algorithm C Code Data Mining

Find Percentage of Words matching in Two Strings

Implement LRU Cache

Binary Tree Isomorphic to each other

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

Password Predictor

The Magic HackerEarth Nirvana solutions Hiring Challenge

BlueStone E-commerce Interview Experience

Copyright © 2026 · Genesis Framework · WordPress · Log in