• 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

Stickler thief

Doubly linked list

Serialise Deserialise N-ary Tree

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

VMWare Openings

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 Binary Tree is Binary Search Tree or not

SAP Off Campus Hiring_ March 2015 Sample Questions

Find two non repeating elements in an array of repeating elements

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

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

Diagonal Traversal of Binary Tree

Find Percentage of Words matching in Two Strings

FizzBuzz Solution C C++

Find if a binary tree is height balanced ?

Mirror of Tree

Practo Hiring Experience

Linked List V/S Binary Search Tree

1014 Practice Question of New GRE – Princeton

DFS (Depth First Search)

Max Sum in circularly situated Values

LeetCode: Container With Most Water

LeetCode : Word Search

Difference between a LinkedList and a Binary Search Tree BST

Cisco Hiring Event 21st – 22nd Feb 2015

Generic Object Oriented Stack with Template

CodeChef’ RRCOPY

Password Predictor

SAP Off Campus Hiring_ March 2015 Verbal Skills

Reliance Jio Software Developer Interview Experience

Copyright © 2025 · Genesis Framework · WordPress · Log in