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

PradeepK

May 18, 2017 by Dhaval Dave Leave a Comment

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

Singly linked list

HackeEarth Flipkart’s Drone

BlueStone E-commerce Interview Experience

Best Java Book | Top Java Programming Book for Beginners

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

Max Sum in circularly situated Values

Python String and numbers

The Magic HackerEarth Nirvana solutions Hiring Challenge

Sort Stack in place

Printing each word reverse in string

Handle duplicates in Binary Search Tree

Find the element that appears once others appears thrice

Python Dictionaries

Maximum of all subarrays of size k

Interfaces in C++ (Abstract Classes in C++)

Flipkart Set 1 On Campus with Answers

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

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 ?

Closed Parentheses checker

Sort an array according to the order defined by another array

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

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

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

Memory Efficient LinkedList

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

Longest Increasing Subsequence

Minimum insertions to form a palindrome

Mirror of Tree

SAP Off Campus Hiring_ March 2015 Verbal Skills

Copyright © 2023 · Genesis Framework · WordPress · Log in