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

type3

October 1, 2019 by Arshdeep Singh 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

Password Predictor

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

Python Array String

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

Practo Hiring Experience

Doubly linked list

Reversal of LinkedList

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

Minimum insertions to form a palindrome

Flipkart SDET Interview Experience

Given Set of words or A String find whether chain is possible from these words or not

Regular Expression Matching

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

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

SAP Interview Questions

C++ OOPs Part1

Find Pythagorean Triplets in an array in O(N)

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

Generate largest number arranging a no. of given non negative integer numbers

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

Generate next palindrome number

Convert number to words java

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

SAP Hiring Off-Campus General Aptitude

Find two non repeating elements in an array of repeating elements

BFS (Breath First Search)

Add Sub Multiply very large number stored as string

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

Maximum path sum between two leaves

LeetCode : Word Search

Copyright © 2023 · Genesis Framework · WordPress · Log in