• 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

BlueStone E-commerce Interview Experience

May 15, 2016 by Dhaval Dave

Two  Code :
Q.1 Sort stack in place. : Solution
Q.2 Recursively reverse Linked List

Round 1 :

Q.1 : Explain and discussion on both Codes, especially on sorting stack.
Q.2 : Loop in Lined List, why Incrementing fast pointer as thrice may not work : Solution
Q.3 : Find Nearest Minimum number in left side in O(n) : Solutio

Q.4 : Puzzle for 4abcd=dcba, solve a,b,c,d values : Solution
Q.5 : Left view of Binary Tree, and how to solve issue when two branches intersect etc.
Q.6 : Difference of code for finding minimum value in
a. sorted rotated array
b. merged array from two sorted arrays.

Q.7 : Present work, issues solved in backend and forntend in details.

 

Similar Articles

Filed Under: Interview Experience

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

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

LeetCode: Container With Most Water

SAP Off Campus Hiring_ March 2015 Sample Questions

Circular Linked List

CodeChef Code SGARDEN

Flipkart Set 1 On Campus with Answers

Diagonal Traversal of Binary Tree

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

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

Python Dictionaries

Printing intermediate Integers between one element & next element of array

Sort Stack in place

Test Cases for Round Function

Walmart Labs Interview Experience

Amazon Interview Experience – SDE Chennai

Daughter’s Age VeryGood Puzzle

Practo Hiring Experience

Singly linked list

Password Predictor

Reliance Jio Software Developer Interview Experience

Edit Distance ( Dynamic Programming )

Binary Tree in Java

Maximum occurred Smallest integer in n ranges

Maximum of all subarrays of size k

Common Ancestor in a Binary Tree or Binary Search Tree

Knight Tour Problem (Graph – Breadth First Search)

LeetCode: Binary Tree Maximum Path Sum

Find if a binary tree is height balanced ?

Code Chef PRGIFT Solution

Find the smallest window in a string containing all characters of another string

Copyright © 2026 · Genesis Framework · WordPress · Log in