CareerCup

Design and implement a interest matching algo, to match people according to their interests in a particular area.
Suggest a score based on their interests. And rank matchings accordingly.

Multi -level cache system design with different storage in each level.
Read Operation : – Minimum time to read a particular key from cache system. This should be followed by writing the key in all levels above it. Eg. if “key” is found at level ‘i’, add this key to cache present at 1 to i-1 level.

b. Write Operation: – Any write Operation should write in cache of all levels.

You can choose any algorithm for cache management like LRU, MRU.

Design a system like HackerRank/Codechef.

Design a concurrent hashmap.

Please point me to the link if this has been discussed before.
They wanted design with code snippet of the classes.

Given lat long of cabs in a city(lat long keeps changing)
Implement a function getNearby(lat1,long1) which returns all cabs in a circle of radius R from lat1,long1.
Which datastructure will u use?
FollowUp qs: Hows it implemented using a database like MySQl or Postgres.

Design a system like github.

Given N dices.Each dice has A faces.That means each dice has numbers from 1 to A.Given Sum S,Find the number of ways to make the sum S if dices are rolled together.

Given a sequence of numbers (or array).Find the maximum distance between all the same numbers.Like you have 1,2,3,4,1,1,7,4 so max(1)=5,max(2)=0 max(4)=4. etc.

Given an array of integers, find all sub-arrays whose elements sum zero.
1.-1,4,-4 has 3 such arrays 1 to -1, 1 to -4 and 4 to -4

Implementation of Advanced set which have the functionality as "Set" in c++ along with extra functionality-Random number generator.Returns the random number from the set.

Given a directed acyclic graph.How to represent it in the relational database for efficient retrieval of all the children nodes and all the parents of any node.(ex a->b here b is child of a and a is parent of b)

Given a string.Find the longest substring in it such that the substring contains only 2 unique characters.Ex- aabbcbbbadef Ans-bbcbbb

In a party there are n different-flavored cakes of volume V1, V2, V3 ... Vn each. Need to divide them into K people present in the party such that
- Each member of party gets equal volume of cake (say V, which is the solution we are looking for)
- A given member should get a cake of single flavour only i.e. You cannot distribute parts of different flavored cakes to same member.
- Minimum volume of cake gets wasted after distribution so that means a maximum distribution policy

int board[8][8] each value in the matrix represents a character. 1-9 number represents all whites and 11-19 represents all blacks.
Given a pawn at (x,y) print all possible moves. Assume whites are index 0 and blacks are at index 7.

The cost of a stock on each day is given in an array, find the max profit that you can make by buying and selling in those days

A = {5, 3, 8, 9, 16}
After one iteration A = {3-5,8-3,9-8,16-9}={-2,5,1,7}
After second iteration A = {5-(-2),1-5,7-1} sum =7+(-4)+6=9
Given an array, return sum after n iterations

Write a program to count the number of uni-value sub-trees in a given tree. Explain reasoning, and implementation decisions.

Design a system similar to how tinyurl.com website works. Scalability, reliability etc. parameters should be stressed upon.

Suppose you are passing a string to a Formatter function. Get the formatted news feed output string such that* There should be one sentence per line.* There shouldn't be any spaces i.e. the line shouldn't be blank.

Given a string S of words and no of character per line m ,with m being greater than the longest word in S,print S in a set of lines so that each line contains no more than m characters and no word split between 2 lines.

Write a program which gives a numerator and a denominator, prints the fractional value in a special format. eg. Numerator: 1, Denominator: 3. So Num/Denom = 0.3333333333, but output should be .(3) similarly 0.123123 as .(123) also 0.34232323 as 0.34(23)

find out
missing no. from a stack if two given stacks have same numbers

2)next question is given an
array of integers...like 10 12 16 17 24 27 8 6 5 4 2....first from 10 to 27 it is in increasing order... .and then decreasing order
starts....so he asked me to find the position from where decreasing starts....it should be done in O(logn).

a linked list contains
2 19 _ _ 3 47 _ _ _ 2 20 _ _ ..............and so on
I have to fill those empty nodes with numbers whose sum is equal to the numbers
occurring just before the gaps and the number of gaps is determined by the node
which is at 2 distance before the gaps with the limitation that there would be no
repetition in list only the nodes designating the number of gaps can be repeated
for example 2 20 should be broken in two parts like 19 1
3 47 should be broken in three parts like 42 2 3
and not in 44 1 2 because 1 already occurred in the list due previous partition