• 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

Amazon Interview On-Campus For Internship – 1

March 25, 2014 by Dhaval Dave

 Amazon Interview On-Campus For Internship – 1

Online Round Coding Question:
Q1. Given a float number 7.64, convert it into the string WITHOUT using any inbuilt function/library.
for eg:
input
float no.: 7.64
output
string: 7.64
Answer : Click here
Q2. Given the inorder and preorder traversals of a Binary Tree, output the postorder traversal of it.
Answer : Click here

Round 1 written:

Q1. Given a string find the length of longest substring which has none of its character repeated?

for eg:
i/p string:
abcabcbb
length of longest substring with no repeating charcters: 3 (abc)
Answer : Click Here
Q2. Given a link list with right pointers and each element of the list has a down link contains another link list with down pointers as:

5 -> 7 ->  9 -> 18
 |    |    |    |
10    8    14   20
 |    |    |    |
11    8.5  19   22
 |    |         |
12    13        24
 |    
15

each right and down list are sorted.
Write a function flatten() which flattens this link list to a single link list with all the elements in sorted order as:
5->6->7->8->9->10->11->12->13->14->15->18->19->20->22->24
Answer : Click Here
PI Round 1:
The interview started with discussions and questioning about the internship project and other projects mentioned in my Resume.
After the discussions about projects interviewer asked a question on string the question was:
Q1. A string of length n and an integer m was given, give an algo. to rotate the string counter clockwise by m. I was asked to give all the check conditions for input m.
Then the interviewer asked me to write a code for the same with a strict guideline that there should not be any mistake in the code ;).

Q2. After this he asked me about heap, min and max heap, insertion and deletion in a heap. He asked me to prove that the time complexity of inserting n elements in a heap.
At-least he asked about the uses of heap data structure and other data structure which are implemented using heap.

PI Round 2:

Q1) What is the difference b/w abstract and interface class?
Q2) Write a program to create single thread and print “Hello World”, stating all the arguments of createThread function?
Q3) What is a deadlock and what are the condition necessary for the deadlock to occur?
Q4) What is a cache memory and how it is implemented?
Q5) Explain LRU, FIFO and other page replacement algorithms?
Q6) Write a code to implement LRU cache and then implement full cache memory? Answer Click Here
-IF YOU LIKE OUR EFFORT, PLEASE LIKE AND SHARE OUR FB-PAGE AND SITE

Similar Articles

Filed Under: Amazon Interview Question, Interview Experience Tagged With: Amazon

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

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

Facebook Interview Question : Interleave List

Print Power Set of a Set

Find if a binary tree is height balanced ?

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

CodeChef Code SGARDEN

Reversal of LinkedList

Flipkart Set 1 On Campus with Answers

Find two non repeating elements in an array of repeating elements

How Radix sort works

Right view of Binary tree

Flipkart SDET Interview Experience

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

Hackerearth : Counting Subarrays

Sort an array according to the order defined by another array

Best Java Book | Top Java Programming Book for Beginners

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

Leetcode: Edit Distance

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

Printing Longest Common Subsequence

Doubly linked list

BlueStone E-commerce Interview Experience

SAP Off Campus Hiring_ March 2015 Verbal Skills

Amazon Interview Experience – SDE Chennai

Maximum of all subarrays of size k

Generate next palindrome number

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

Printing each word reverse in string

Find if two rectangles overlap

Common Ancestor in a Binary Tree or Binary Search Tree

Copyright © 2025 · Genesis Framework · WordPress · Log in