CareerCup

Print numbers that matches with the index in given non-duplicate unordered array.

Write a program to encode a string from --> ABABXBYZXXX --> X4B3A2Y1Z1 (what should be the storage requirements for optimal conversion of 10TB file)

Suppose there is a function given to you that:

def get_friends( person_id ) { /*  returns friends of person */ }

How you are now going to recommend friends to a person based on number of mutual friends? So, come up with the function:

def friend_reco( person_id, max_no_of_friends ){ }

Given billions of Identity cards of the form :

card : {
   my_id : "my id",
   "moms_id" : "mom id",
   "dad_id" : "dads id"  
}

If one gives you two Person's id, how can you tell if these 2 persons are blood related.
So, write a function that is:

def is_blood_related( person_id_1, person_id_2 ) // go on..

How to do deal with cheap flight Norwegian Air and get any information through their customer service toll-free number?

Given an array of integers find the maximum value of a[i] - a[j] + a[k]
with constraints i < j < k and a[i] < a[j] < a[k]

Implement a comparator class that is capable of sorting by multiple key/order pairs, each pair being a tiebreaker for the previous.

You're running a pool of servers where the servers are
numbered sequentially starting from 1. Over time, any
given server might explode, in which case its server
number is made available for reuse. When a new
server is launched, it should be given the lowest available number.

Write a function which, given the list of currently
allocated server numbers, returns the number of the next server to allocate.

For example, your function should behave something like the following:

>> next_server_number([5, 3, 1])
2
>> next_server_number([5, 4, 1, 2])
3
>> next_server_number([3, 2, 1])
4
>> next_server_number([2, 3])
1
>> next_server_number([])
1

Server names consist of an alphabetic host type (e.g. "apibox") concatenated with the server number,
with server numbers allocated as before (so "apibox1",
"apibox2", etc. are valid hostnames).

Write a name tracking class with two operations,
allocate(host_type) and deallocate(hostname).
The former should reserve and return the next
available hostname, while the latter should release
that hostname back into the pool.

# For example:
#
# >> tracker = Tracker.new()
# >> tracker.allocate("apibox")
# "apibox1"
# >> tracker.allocate("apibox")
# "apibox2"
# >> tracker.deallocate("apibox1")
# nil
# >> tracker.allocate("apibox")
# "apibox1"
# >> tracker.allocate("sitebox")
# "sitebox1"

Write a map implementation with a get function that lets you retrieve the value of a key at a particular time.
t:0 A =1
t:2 A = 2
get(A, t:1) -> 1
get(A, t:3) -> 2

Use synchronized, wait() and notify() to write a program such that below mentioned conditions are fulfilled while reading and writing data to a shared resource.

When a write is happening, no read or other write should be allowed(read and write threads should wait)

When a read is happening, no write should be allowed (write threads should wait) but. other read threads should be able to read.

Donot use any API classes e.g. ReadWriteLock, AtomicInteger etc..

Design election voting system. Election would be country wide. System should be scalable, available and consistent.

Given three integers x,y and z you need to find the sum of all the numbers formed by 
having 4 atmost x times , having 5 atmost y times and having 6 atmost z times as a digit.

input 
x=1,y=1,z=1
output
4+5+6+45+54+56+65+46+64+456+465+546+564+645+654=3675

Given three integers x,y and z you need to find the all the possible combination of numbers having 4 at most x times, having 5 at most y times and having 6 at most z times as a digit.

input x=1,y=1,z=1
output

4
5
6
45
54
56
65
46
64
456
465
546
564
645
654

A Doctor travels from a division to other division where divisions are connected like a graph(directed graph) and the edge weights are the probabilities of the doctor going from that division to other connected division but the doctor stays 10mins at each division now there will be given time and had to find the division in which he will be staying by that time and is determined by finding division which has high probability. Input is number of test cases followed by the number of nodes, edges, time after which we need to find the division in which he will be there, the edges starting point, end point, probability. Note: If he reaches a point where there are no further nodes then he leaves the lab after 10 mins and the traveling time is not considered and during that 10min at 10th min he will be in next division, so be careful

find the division with highest probability that doctor is in it after 10 min is div 3 and probability is 0.7.

After 9 minutes dr has yet to move to another division he is in div 1 and probability is 1.0. Forty minutes later the division with highest probabilty is 6 and probabilty is 0.77400

input 1 6 10 40 1 2 0.3 1 3 0.7 3 3 0.2 3 4 0.8 2 4 1 4 5 0.9 4 4 0.1 5 6 1.0 6 3 0.5 6 6 0.5

output 1 6 0.774000

input 2 6 10 10 1 2 0.3 1 3 0.7 3 3 0.2 3 4 0.8 2 4 1 4 5 0.9 4 4 0.1 5 6 1.0 6 3 0.5 6 6 0.5

output 2 3 0.700000

Implement following method of ScheduledExecutorService interface in Java

schedule(Runnable command, long delay, TimeUnit unit)
Creates and executes a one-shot action that becomes enabled after the given delay.

scheduleAtFixedRate(Runnable command, long initialDelay, long period, TimeUnit unit)
Creates and executes a periodic action that becomes enabled first after the given initial delay, and subsequently with the given period; that is executions will commence after initialDelay then initialDelay+period, then initialDelay + 2 * period, and so on.

scheduleWithFixedDelay(Runnable command, long initialDelay, long delay, TimeUnit unit)
Creates and executes a periodic action that becomes enabled first after the given initial delay, and subsequently with the given delay between the termination of one execution and the commencement of the next.

Implement BST Iterator and use them in 2 sum and 3 sums problem on a BST

Implement a rate limiter that multiple threads can use, while the global rate is limited to a value

Implement a thread-safe data structure which can keep track of number of incoming
requests grouped by IP Address over a time window. Add support for grouping by other
attributes such as BrowserAgent.

Given an array sort even element 
and odd number and such 
that even element at even index and
 odd at odd and you have 
to return minimum no of swap 
and it has should be sorted 
input 2134
output 1

Given a string select two non-overlapping strings that are same and remove them. Perform this operation recursively till there are no desired strings.
Print the number of possible substring after completing above operation.
Ex - abcc
Duplicate non-overlapping substring - abc
After removing abc from we are left with 1 substring abc.

In a 2-D matrix of m*n select m-1 elements from each row such that that the resulting sum is minimum and each column is selected atleast once.

Ex -
2 3 5
3 2 5
4 4 7
Selecting (2,3) from 1st row, (2,5) from 2nd row and (4,4) from 3rd row would result in minimum sum of 20

Question: Can you break the given string into words, provided by a given hashmap of frequency of word as <word: n>

Example:
HashMap -> {"abc":3, "ab":2, "abca":1}
String: abcabcabcabca
output: Yes; [ abc, abc, abc , abca ]

Example:
HashMap -> {"abc":3, "ab":2}
String: abcabab
output: No

Example:
HashMap -> {"abc":3, "ab":2, "abca":1}
String: abcx
output: No

Find LCA for list of nodes of a tree

Function defined as below -
TreeNode findLCA(TreeNode root, List<TreeNode> nodes)

Given a number n, make a set of m integers such that the integers lie between [1, n] 
and the sum of  two integers should produce an integer which is in the set.

Eg. **Input**
n=20, m=5
**Output**
[3, 6, 11, 14, 17]

Which test types we can use for drinks vending machine testing? Especially for check dimension, length, appearance of machine and cups?

A set of points in the 2D plane. Find the first k number of points with the shortest distance to the point (0, 0), where k is a positive integer.

e.g.
Input
{[-16, 5], [-1, 2], [4, 3], [10, -2], [0, 3], [-5, -9]}
k = 3

Output:
{[-1, 2], [0, 3], [4, 3]}
.

A matrix represents a sequence of travel points. One only can travel either left/right or up/down. Some of those points are dead points which one can't travel any further. There is a destination point in the matrix. Find the shortest path from the top left point (1, 1) to the destination.

e.g.
Input
[
[‘O’, ‘O’, ‘O’, ‘O’],
[‘D’, ‘O’, ‘D’, ‘O’],
[‘O’, ‘O’, ‘O’, ‘O’],
[‘X’, ‘D’, ‘D’, ‘O’],
]

Output
Route is (0, 0), (0, 1), (1, 1), (2, 1), (2, 0), (3, 0) The minimum route takes 5 steps.

I was asked to integrate linkedIn and dropbox. So linkedIn is not into file storage system, hence they want to use the services of dropbox. The goal is to create, update, delete the documents of a profile in linkedIn. But these documents will not be stored in linkedIn. They will be stored in dropbox.
Moreover, to get this integration, linkedIn does not want to scale up they system. This means, if they have 400 servers, they do not want to add any more servers to achieve the integration.
How can I design this?

Given a positive integer array and a positive integer. Find a pair of integers in the array so that the sum of the pair is the largest one among all pairs not larger than the given integer.

e.g.
Input
{90, 85, 75, 60, 120, 150, 125}
d: 250

Output:
{90, 125}

Design DB schema for maintaining e-commerce various category ,sub category ,sub-sub category and so on.