CareerCup

What is a columnar database. why we preferred redshift over mysql for data warehouse.

How many ways a 4*n wall be filled with 4*1 sheets so that the wall ends uniformly.

Maintain an employee hierarchy with attributes
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.

Design a state machine – Each state can handle n events and based on the event type next state is determined

Design delivery system from city Hub to the customer – There was focus on how to figure out the location of the customer from address, finding the shortest path etc.,

You 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?

You 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)


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

Code library management system
a) add a book
b) issue a book
c) return a book
d) if a user has kept a book more than 10 days then there should be a fine of Rs. 1 per day post 10 days.

Given daily stock rates of last year give the average stock rate price for a given day range

How would you design Hospital management system ?

There 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
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

Assume 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.

I was asked to design a snake and ladder game. The game can have more obstacles than just snake and ladders.

There 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.

Two 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.

Design a cricket series. Extend it to olympics.

Design and build tic tac toe game. The code should be up and running. It should be scalable to multi-users and nXn grid.

advantages and disadvantages of Circular queue according to its implementation in array and linkedlist ??

Two 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.

Print the bottom view of the binary tree.
Example :


1
/ \
/ \
2 3
/ \ / \
4 5 6 7
/ \ / \
8 9 10 11
/
12

Output should be :
8 12 9 10 5 6 11 7

Solution is different from http://www.geeksforgeeks.org/bottom-view-binary-tree/

Given an array and a target number. you have to print all sequences that generates the target number.
you can use two arithmetic operators '+' and '-' to perform operations among array elements.

Note: you can't modify the array and you have to use all the elments of the array. and the order would be same as given in the array.

Example : 1 9 1 2 , Target Number = 9

1 + 9 +1 -2 =9

output should be "1 + 9 +1 -2 "

You are given a list of word. Find if two words can be joined to-gather to form a palindrome. eg Consider a list {bat, tab, cat} Then bat and tab can be joined to gather to form a palindrome.

Expecting a O(nk) solution where n = number of works and k is length

There can be multiple pairs

Given set of job schedules with start and end time, write a function that returns indexes of overlapping sets.

for ex :-
input -> [1,2][5,6][1,5][7,8][1,6]
return -> [0,1,2,4]

Write a function that accepts root of a binary tree and print zigzag level order traversal, each level print in new line.
For example,
Given tree:
1
2 3
4 5 6 7
8 9
output:
1
2 3
7 6 5 4
8 9

Write a function that accepts root of a binary tree and return true if it is foldable otherwise return false. A binary tree is foldable if left subtree of root is mirror image if right subtree.
For example:
Given tree,
1
2 3
4 5 5 4
6 6
output: true

Write a function that accepts root of a binary tree and return true if it is foldable otherwise return false. A binary tree is foldable if left subtree of root is mirror image if right subtree.
For example:
Given tree,
1
2 3
4 5 5 4
6 6
output: trus

Write a function that accepts root of a binary tree and print zigzag level order traversal, each level print in new line.
For example,
Given tree:
1
2 3
4 5 6 7
8 9
output:
1
2 3
7 6 5 4
8 9

Write a function that accepts two character arrays each represents a floating point number and return their sum in character array.
For example function accepts "23.45" and "2.5" and return their sum "25.95".
Restriction: We cannot use predefined functions / methods or parsing. We have to go with basic operations.

In a Formula-1 challenge, there are n teams numbered 1 to n. Each team has a car and a driver. Car’s specification are as follows:

– Top speed: (150 + 10 * i) km per hour
– Acceleration: (2 * i) meter per second square.
– Handling factor (hf) = 0.8
– Nitro : Increases the speed to double or top speed, whichever is less. Can be used only once.

Here i is the team number.
The cars line up for the race. The start line for (i + 1)th car is 200 * i meters behind the ith car.

All of them start at the same time and try to attain their top speed. A re-assessment of the positions is done every 2 seconds(So even if the car has crossed the finish line in between, you’ll get to know after 2 seconds). During this assessment, each driver checks if there is any car within 10 meters of his car, his speed reduces to: hf * (speed at that moment). Also, if the driver notices that he is the last one on the race, he uses ‘nitro’.

Taking the number of teams and length of track as the input, Calculate the final speeds and the corresponding completion times.

Write code to rotate a square matrix:
Input:
1 2 3
4 5 6
7 8 9

Output:
4 1 2
7 5 3
8 9 6