• 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

Get Minimum element in O(1) from input numbers or Stack

Level order traversal in Spiral form

Apriori algorithm C Code Data Mining

Count Possible Decodings of a given Digit Sequence

Maximum occurred Smallest integer in n ranges

Connect n ropes with minimum cost

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

Sequence Finder 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

Printing Longest Common Subsequence

Longest Increasing Subsequence

Trie Dictionary

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

Client Server C program

Mirror of Tree

Given a float number convert it into the string WITHOUT using any inbuilt Function

BlueStone E-commerce Interview Experience

Generic Object Oriented Stack with Template

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Printing each word reverse in string

Find two non repeating elements in an array of repeating elements

Max Sum in circularly situated Values

Circular Linked List

Walmart Labs Interview Experience

Hackerearth : Counting Subarrays

C++ OOPs Part1

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

Serialise Deserialise N-ary Tree

Find the kth number with prime factors 3, 5 and 7

Given a sorted array and a number x, find the pair in array whose sum is closest to x

Copyright © 2026 · Genesis Framework · WordPress · Log in