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

GoHired

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

Certificates

To Join us as Interns or Student please reach out to us on Enroll Now

GoHired Certificates

Course Completion Internship
Sowmyadhar Gourishetty Parminal Prasoon
Vijaya Kumar Gulli Diksha P
Pranav Ganorkar Farhaz A
Umesh Chandra Patnaik Abhey Rana
Girish Ballampalli Krishnendu Ghorui
Kinchit Jain Arnab ghosh
Kirit Jain Arshdeep Singh
Shakti Prasad Dathi Sreekar Naga sai
Sandeep Singh
Shaoib Md.
Tanuja Soni
Riyaz S
Pranit Kothari
Sai Teja
Tumati J
Nilesh Verma
Nikitha G M
Chokkalinge Gowda
Chetan Kumar
Shikhar Chandra
Nikhil DA Rocha
Subhodip Banerjee
Santosh Surimani
Sukanya Sinha
Atharva Puranik
Anukalp Desai
Anil Kongari
Sagar Ekbote
Vivek Dhiman
Purushottam Kumar
Nilesh Verma
Vivke Sangle
Sneha K
Saalis Umer
Srinivas G
Renjith Regi
Shipra Gupta
Reetika Malhotra
Chetan Chandan
Vikas Sangle

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

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

Common Ancestor in a Binary Tree or Binary Search Tree

Implement LRU Cache

Get K Max and Delete K Max in stream of incoming integers

Binary Tree in Java

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

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

Implement a generic binary search algorithm for Integer Double String etc

HackeEarth Flipkart’s Drone

VMWare SDEII Interview

Find position of the only set bit

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

simple sql injection

Stickler thief

BlueStone E-commerce Interview Experience

Difference between a LinkedList and a Binary Search Tree BST

Amazon Interview On-Campus For Internship – 1

Printing each word reverse in string

Practo Hiring Experience

Closed Parentheses checker

Daughter’s Age VeryGood Puzzle

TicTacToe Game As Asked in Flipkart

DFS (Depth First Search)

C++ OOPs Part1

Doubly linked list

Serialise Deserialise N-ary Tree

Sort Stack in place

Find min element in Sorted Rotated Array (With Duplicates)

Max Sum in circularly situated Values

Stock Buy Sell to Maximize Profit

Copyright © 2026 · Genesis Framework · WordPress · Log in