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

getkmin

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

SAP Hiring Off-Campus General Aptitude

Find the smallest window in a string containing all characters of another string

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

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

C++ OOPs Part2

Reverse a Linked List in groups of given size

Knight Tour Problem (Graph – Breadth First Search)

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

Regular Expression Matching

Flipkart Set 1 On Campus with Answers

Reversal of LinkedList

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

Python List

Amazon Interview On-Campus For Internship – 1

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

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

Maximum sum contiguous subarray of an Array

Trapping Rain Water

Max Sum in circularly situated Values

BFS (Breath First Search)

HackeEarth Flipkart’s Drone

C++ OOPs Part1

Best Java Book | Top Java Programming Book for Beginners

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

Coin Collection Dynamic Programming

LeetCode: Binary Tree Maximum Path Sum

Serialise Deserialise N-ary Tree

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 ?

Connect n ropes with minimum cost

Binary Tree Isomorphic to each other

Copyright © 2026 · Genesis Framework · WordPress · Log in