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

blogger

Reader Interactions

Leave a ReplyCancel reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.

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

Subset Sum Problem Dynamic programming

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

Handle duplicates in Binary Search Tree

Practo Hiring Experience

Leetcode: Edit Distance

Apriori algorithm C Code Data Mining

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

Number of Islands BFS/DFS

Templates in C++

C++ OOPs Part1

Find two non repeating elements in an array of repeating elements

Convert number to words java

Maximum of all subarrays of size k

Python Array String

BFS (Breath First Search)

Maximum occurred Smallest integer in n ranges

Maximum path sum between two leaves

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

1014 Practice Question of New GRE – Princeton

Trie Dictionary

Leetcode: Merge Intervals

Find position of the only set bit

HackeEarth Flipkart’s Drone

Reversal of LinkedList

Max Sum in circularly situated Values

Microsoft BING Interview Experience

Implement LRU Cache

Mirror of Tree

Possible sizes of bus to carry n groups of friends

Copyright © 2025 · Genesis Framework · WordPress · Log in