• 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

Flipkart Set 1 On Campus with Answers

August 5, 2014 by Dhaval Dave

Round 1(Online):
There were 2 questions time limit 90 mins.
1. A person wants to go from origin to a particular location, he can move in only 4 directions(i.e East, West, North, South) but his friend gave him a long route, help a person to find minimum Moves so that he can reach to the destination.
Input – NESNWES
Output – E

You need to print the lexicographically sorted string. Assume the string will have only ‘E’ ‘N’ ‘S’ ‘W’ characters.
E.g – SSSNEEEW
output – EESS

See Code here : http://gohired.in/2014/07/wrong-directions-given-find-minimum.html

2. A sender will send a binary string to a receiver meanwhile he encrypt the digits. You are given a encrypted form of string. Now, the receiver needs to decode the string, and while decoding there were 2 approaches.

First, receiver will start with first character as 0; S[0] = 0, P[1] = S[1] + S[0], P[2] = S[2] + S[1] + S[0] and so on.
Second, Receiver will start with first character as 1; S[0] = 1, P[1] = S[1] + S[0], P[2] = S[2] + S[1] + S[0] and so on.

You need to print both the strings, after evaluation from both first and second technique. If any string will contain other that binary numbers you need to print NONE.

Round 2(Machine Coding Round):
There was only one question, time limit 45mins
Q1. Word Wrap problem with few conditions, even i didnt remember much conditions here are some conditions.
i) there can be maximum of X characters in a single line.
ii) there can be maximum of Y number of spaces in the end of the each single line.
iii) if a string length is big enough, so that it cannot be printed in single line, use ‘-’ in the end of the line and print string further in the different line.
also there should not be ‘–’ consecutively in the end, if the string contains already ‘-’ in the end dont put ‘-’ character.

E.g. flip-kart and if x = 5 so it should be ->
flip-
kart

iv) the string should not start with these characters(‘.’ , ‘,’ ‘ ‘)
v) the cost value should be minimum, there can not be multiple answer for a single string.
Eg. This is a flipkart online programming test.

x = 10 Y = 3
Output
This is a
flipkart
online pr-
ogramming
test.

First Technical Interview (F2F):
They asked me about myself, so i gave my brief intro to them(there were 2 people who were taking the interview)

He saw my resume and asked me that do i know DBMS.
I said i have done a course on it. So he started asking about DBMS. He explained me how the order are made in flipkart (like there are many item from different locations and many order are places
and there are many order item to be placed at different location. There can be offers on items).
After explaining he asked me what tables would you like to used for online shopping like flipkart. He asked the the primary keys for every table and foreign key if there are any.
He then asked me about mapping of these keys and what type of mapping to be used here(one to one, many to many or many to one).

Then he asked me about my Codechef and spoj rating. Then he asked me 3 coding questions:

1 – http://www.codechef.com/JULY14/problems/SGARDEN/
See Code here : http://gohired.in/2014/08/codechef-code-sgarden.html

2 – Simple dp question that a frog can take 1 or 2 step. Number of ways to reach nth position.
3 – Number of palindrome between 2 given numbers.

Technical + HR interview(F2F) –
He discuss everything about my project very deeply.
Then he asked a coding question.
http://www.careercup.com/question?id=13394663

Similar Articles

Filed Under: Flipkart Interview Questions, 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

Given a string, find the first character which is non-repetitive

Find Percentage of Words matching in Two Strings

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

Diagonal Traversal of Binary Tree

Calculate price of parking from parking start end time prices

Get K Max and Delete K Max in stream of incoming integers

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

Daughter’s Age VeryGood Puzzle

Facebook Interview Question : Interleave List

Find Pythagorean Triplets in an array in O(N)

Print vertical sum of all the axis in the given binary tree

SAP Off Campus Hiring_ March 2015 Sample Questions

Maximum sum contiguous subarray of an Array

Print Power Set of a Set

Level order traversal in Spiral form

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

Cisco Hiring Event 21st – 22nd Feb 2015

Amazon Interview On-Campus For Internship – 1

System Design: Designing a LLD for Hotel Booking

Find if two rectangles overlap

Maximum path sum between two leaves

The greedy coins game Dynamic Programming

Knight Tour Problem (Graph – Breadth First Search)

Python Array String

Trapping Rain Water

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

Mirror of Tree

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

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

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

Copyright © 2025 · Genesis Framework · WordPress · Log in