CareerCup

Implement an algorithm that takes in a string containing a parenthesized expression and prints it out with all sibling expressions at the same indent level, each on its own line.

Definitions:
A parenthesized expression consist of an opening parenthesis, one or more expressions separated by one or more spaces, and a closing parenthesis.
An expression is either a word or a parenthesized expression.

Design a data structure to support following operation:
Insert, delete, search and min difference
Time complexity of finding min Difference should be less than O(log n).

Design backend system for bookMyShow.com like system which supports below use cases:

1) When user selects cities, list of cities is displayed.
2) When user selects city, movie list is displayed.
3) When user selects movie, list of theatre is displayed.
4) When user selects theatre, show timing is displayed.
5) When show timing is selected, user is asked for no of seats that he wants to book
6) When user selects no of seats, seats are displayed to choose from.
7) When user selects seats, then total price is displayed.
8) When total price is selected, then user is directed to payment gateway and payment is done and on payment success, ticket is mailed to him.

More questions on how can we scale the system, and handle concurrent users request for same seat etc.

A file is given which consists of 3 columns : date, city and temperature. For ex:
Date City Temperature
09-11-2015 Delhi 45
09-11-2015 Bangalore 24
09-11-2015 Ranchi 28

and it should support following type of queries:
1) What is the temperature of Bangalore on 9th November?
2) Give 5 hottest/coldest cities name on 9th November

You can preprocess the data and keep it in way that above query can be done in minimal time.
Which data structure will you use and how will you store the data?

This is an online written test.
Please solve it.

You have a sequence of d[0] , d[1], d[2] , d[3] ,..,d[n]. In each move you are allowed to increase any d[i] by 1 or 2 or 5 i:0 to n .What is the minimum number of moves required to transform the sequence to permutation of [1,2,3,..,n] if it's possible else return -1.
Constraint: 1<=n<=1000

nput:
First Line will have no of elemnts
Second Line on. elements will be present
Ex: 5
1
1
3
2
1

Output:
As no of elements are 5, all permutation can be {1, 2, 3, 4, 5} .
To convert input to get all possible permutation i.e {1, 2, 5, 4, 3},
no of moves will be 4.

Hence output would be 4.