Intuit Interview Report
- 1of 1 vote
AnswersHow will you store a million phone numbers in a space efficient way?
- Shock March 13, 2013 in India| Report Duplicate | Flag | PURGE
Intuit Software Engineer / Developer Data Structures - 0of 0 votes
AnswersWrite implementation of PIVOT keyword found in SQL server.
- Shock March 13, 2013 in India| Report Duplicate | Flag | PURGE
Intuit Software Engineer / Developer SQL - 0of 0 votes
AnswersGiven daily stock rates of last year give the average stock rate price for a given day range
- kri1311 May 26, 2015 in India| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 0of 0 votes
AnswersDesign a state machine – Each state can handle n events and based on the event type next state is determined
- kri1311 May 26, 2015 in India| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 0of 0 votes
AnswersYou are given with PxQ matrix and a point inside the matrix (x,y) where you standing. If you step outside the matrix you’ll die. You are allowed to move in all four direction. Movement will be totally random. For Given N steps, what is the probability that you’ll alive?
- kri1311 May 26, 2015 in India| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 0of 0 votes
AnswersYou are given some equations which may contain > or = on different-different operand. For example there are valid input and invalid (a=5, b<a=50)
- kri1311 May 26, 2015 in India
String e1 = "a>b=1";
String e2 = "a>b=2";
String e3 = "a>c>e=3";
String e4 = "a>c>f=4";
String e5 = "b>a=5";
String e6 = "a>b>c=5";
String e7 = "b=7";
String e8 = "a>b>c>d=99";
String e9 = "a>b=99";
You need to create JSON string from it.
{
‘a’: {
‘b’: [1,2,99],
‘c’: {
‘e’:3,
‘f’:4
}
},
‘b’: {
‘a’ : 5
}
}
Highlighted one are invalid bec as they come they ask for overwrite the data (a>b>c = 5; C has e and f so we can overwrite.
Input: You are given those string in string array
Output:
Construct JSON
Print it
If you print in same as above (nice manner) +point| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 0of 0 votes
AnswersTwo players, two field; and have multiple ships located in their fields. They are guessing each others ship position and hitting. Tell who wins first. Design maintainable code which can incorporate future change.
- kri1311 May 26, 2015 in India| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 0of 0 votes
AnswerWhat is a columnar database. why we preferred redshift over mysql for data warehouse.
- kri1311 May 26, 2015 in India| Report Duplicate | Flag | PURGE
Flipkart SDE1 Database - 0of 0 votes
AnswersThere is a n player game of cards. The deck of card is not fair, i.e. any card can be there any number of times. A card has a number and a color. Each player gets k card each (n and k can be harcoded in the solution). The computer starts the game by throwing a card from the deck of cards. Assume the card is 4 of Green. Then the other player has to throw either a 4 of any color or Green of any number. If the player does not have any such card, then it can say pass. The player who finishes all his card wins. The logic of selecting the card by the user can be hardcoded (Eg, If you use a list data structure for storing the cards for a player, then you can say that the player always throws the first card from the list). The logic was required only to start and conclude the game.
- kri1311 May 26, 2015 in India| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 0of 0 votes
AnswersHow many ways a 4*n wall be filled with 4*1 sheets so that the wall ends uniformly.
- kri1311 May 26, 2015 in India| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 0of 0 votes
AnswersHow would you design Hospital management system ?
- kri1311 May 26, 2015 in India| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 0of 0 votes
AnswersDesign and build tic tac toe game. The code should be up and running. It should be scalable to multi-users and nXn grid.
- kri1311 May 26, 2015 in India| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 0of 0 votes
AnswersMaintain an employee hierarchy with attributes
- kri1311 May 26, 2015 in India
Print complete hierarchy of given employee.
find top 10 employees on the basis of salary ,at any instant of time .
Perform CRUD opérations on the hierarchy.| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 0of 0 votes
AnswersDesign a cricket series. Extend it to olympics.
- kri1311 May 26, 2015 in India| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 0of 0 votes
AnswersI was asked to design a snake and ladder game. The game can have more obstacles than just snake and ladders.
- kri1311 May 26, 2015 in India| Report Duplicate | Flag | PURGE
Flipkart SDE1 - 0of 0 votes
AnswerThere are M chocolate packets each packet can have variable number of chocolates in each packet. There are N students (N < M). Distribute chocolate packets to student such that
- kri1311 May 26, 2015 in India
a) each student gets 1 packet
b) suppose m1,m2,…mn are the packets which are chosen to be distributed in sorted order of number of chocolates in them (nm-n1 must be minimum)
M = 1, 3, 4, 6 (4 packets with specified number of chocolates in them)
N = 2
Ans = 3,4| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm - 0of 0 votes
AnswersAssume you have a starting 4 digit number, say 1234 and and ending 4 digit number 4567. For changing a bit of a number from 1 to 3 (for example), it will take 2 steps (from 1->2 and from 2->3). So to convert 1234 to 4567, you’ll have to change each and every bit individually in some number of steps. (Change 1->4 in 3 steps, 2->5 in 3 steps and so on). Now there is a list of blacklisted numbers. So while transforming start to end, if you reach a blacklisted number, then you cannot change that particular bit, you’ll have to move to another bit. E.g. Assume 1434 is a blacklisted number, and while transforming you reach it, then you have to change either 1, or 3 or the last 4. So you have to find the least number of steps in which start number can be transformed to end number.
- kri1311 May 26, 2015 in India| Report Duplicate | Flag | PURGE
Flipkart SDE1 Algorithm