• 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

SAP Off Campus Hiring_ March 2015 Sample Questions

Python String and numbers

Find and print longest consecutive number sequence in a given sequence in O(n)

C++ OOPs Part1

C++ OOPs Part2

1014 Practice Question of New GRE – Princeton

Common Ancestor in a Binary Tree or Binary Search Tree

Maximum sum contiguous subarray of an Array

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

Hackerearth : Counting Subarrays

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

Binary Tree in Java

Fibonacci Hashing & Fastest Hashtable

Stickler thief

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

Printing each word reverse in string

Test Cases for Round Function

Subset Sum Problem Dynamic programming

25 horses 5 tracks Find 3 fastest puzzle

Leetcode: Merge Intervals

Find Nearest Minimum number in left side in O(n)

Sequence Finder Dynamic Programming

Print Power Set of a Set

Maximum occurred Smallest integer in n ranges

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

Best Java Book | Top Java Programming Book for Beginners

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

Adobe Interview Questions 8 month Exp

Mirror of Tree

Reversal of LinkedList

Copyright © 2025 · Genesis Framework · WordPress · Log in