• 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

Best Java Book | Top Java Programming Book for Beginners

TicTacToe Game As Asked in Flipkart

SAP Off Campus Hiring_ March 2015 Sample Questions

Adobe Interview Questions 8 month Exp

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Check if an array has duplicate numbers in O(n) time and O(1) space

Sequence Finder Dynamic Programming

Templates in C++

Cisco Hiring Event 21st – 22nd Feb 2015

Leetcode: Edit Distance

C Program for TAIL command of UNIX

Python Array String

LeetCode : Word Search

Reverse a Linked List in groups of given size

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

Introduction To Number Theory ( Part 1 )

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

Practo Hiring Experience

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

flattens 2 D linked list to a single sorted link list

Print Power Set of a Set

SAP Hiring Off-Campus General Aptitude

Code Chef PRGIFT Solution

Implement LRU Cache

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

Convert number to words java

Skiing on Mountains Matrix

Edit Distance ( Dynamic Programming )

DFS (Depth First Search)

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Copyright © 2026 · Genesis Framework · WordPress · Log in