Flipkart Interview Report
- 1of 1 vote
AnswersGiven a review paragraph and keywords, find minimum length snippet from paragraph which contains all keywords in any order.
- kri1311 May 27, 2015 in India| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 1of 1 vote
AnswersDictionary of words is given
- kri1311 May 27, 2015 in India
i.e. [“cat”, “dog”, “rat”, “catratdog”, “catter”]
Compound word: A word, which can be split into more than 1 valid words
get compound word, with longest string length.| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 0of 0 votes
AnswersThere is a zoo and there are several groups(number of groups:K) of people for tour. Each group is having different size (g1,g2,g3…gK). There is one bus with capacity C. Journey starts from a point and bus will come back to the same point. A group can only be included in the bus if all the members of the groups can be accumulated in bus. After coming back from the tour, each group in the bus will again wait in the queue at the bus-stand. Bus-driver earns a rupee for each person travelled. You have to find the earning of the bus driver after R rounds.
- kri1311 May 27, 2015 in India
For example :
Number of groups G = 4
Group size for each group : 2 4 3 5
Bus capacity : 7
Number of rounds R : 4
queue : (from front side) 2 4 3 5
First round : 2 4 (we can’t take 3rd group as 3 members can’t be accumulated after 2 and 4.)
queue : 3 5 2 4 (1st and 2nd group are enqueued. i.e. 2 and 4)
Second round : 3
queue : 5 2 4 3
Third Round : 5 2
queue : 4 3 5 2
Fourth Round : 4 3
After 4 rounds, total earning is 6+3+7+7 = 23.| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 0of 0 votes
AnswerA 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.
- kri1311 May 27, 2015 in India
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.| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 0of 0 votes
AnswersDesign and code the sudoku solver.
- kri1311 May 27, 2015 in India| Report Duplicate | Flag | PURGE
Flipkart SDE1 - 0of 0 votes
AnswersDesign a Traffic signal . List all entities and classes involved. How will you handle pedestrian crossings etc.
- kri1311 May 27, 2015 in India| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 0of 0 votes
AnswerGiven a network of roads connecting cities and capacity of each road(same for all roads)as well as their cost of repair(unique for each road) we are given number of buses(n) running between pair of cities using shortest path only. (Capacity of road= No of buses allowed on that road).
- kri1311 May 27, 2015 in India
Unsafe roads are road where no of buses on the road > Capacity of the road.
Now given n we have to minimize the overall cost of all unsafe roads.| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 2of 2 votes
AnswersGiven a lane where there are various houses each containing a fixed amount of gold. Now a robber has to rob the houses such that when he robs a house the adjacent one cannot be robbed.Calculate the maximum amount of gold collected by him.
- kri1311 May 27, 2015 in India| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 0of 0 votes
AnswerGiven a pond where all the stones are lined at a distance of one unit (C in each row and there are R such rows), each stone has a special value which denotes the length of the jump the frog can make i.e if frog is on stone (x,y) and value is k then frog can jump to (x+dx,y+dy) where dx+dy=k and frog doesn’t leave the bounds.Find the min number of jumps to reach the stone at (R,C).
- kri1311 May 27, 2015 in India| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 0of 0 votes
AnswersDesign notification system (notify the customer with a message)
- kri1311 May 27, 2015 in India
Client (delivery boy, company updates etc)
Services (Email, SMS, Watsapp)
Scaling up, fault tolerance & failure management
Flexible modifiability of clients & services| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 0of 0 votes
AnswersN people are there.
- kri1311 May 27, 2015 in India
knows(A,B) return true if A knows B, else false.
Celebrity: A is called a celebrity
If A knows none
Everyone knows A
Get celebrity, with less number of knows() method usage.| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 0of 0 votes
AnswersDesign a mobile cab booking application (just screens and functionalities) on board.
- kri1311 May 27, 2015 in India| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 0of 0 votes
Answeresign a contact list for a cell phone which can add & search really quick and is scalable.
- kri1311 May 27, 2015 in India| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm