CareerCup

try running our program on sequence { 1,2,1,2,1,2, 219876534567324567098765423}

How big arrfrew will you allocate ??

Evaluate the postfix expression of the same and look for any continuous ()() . If there is ny pair of ()(), string has redundant braces else not.

Forget K5 or bipartite graphs, what about a single triangle.

Can we color it using two colors only such that no two adjacent nodes are same color ? :) :)

Minimum number of different colors to color a graph is known as Chromatic number problem. Minium is 4 in my opinion.

It is incorrect. Check below two answers.
Check in below set
I - Insert(Push)
D - Delete(Pop)

I5, I7, I9, I1,I3, D3, D1, D9, I2, I10,I9, I1, I11

Yes That is the right way.

Both the solutions above are not perfect. First one is incorrect actually.

I would say the Google's "Query Auto suggestion" feature in Search Query box.
It is implemented as Trie but Trie in themselves are BST.

Other use is "iNodes" in Linux. There are stored using Red Black Tree ( another modified BST)

Let's say it is not 100 , it is 5 .
And my current heap is { 27,13,5,10,8}

and new number that comes is 9. How do you find , eliminate 5 and restructure the heap. ??

Won't it be good to just keep circular list/queue, so that i know the range [ min, max] of my current top 100 elements. if number scanned is out of that range, we ignore and if number is in that range we insert it in it's correct place.

yea, but range might not be known.
I don't think one traversal O(N) to find the range will be a good idea though that can help here.

if we know the value of K, we can make virtual K lists in the existing data set itself. Keep track of begin and end of K lists with 2K indexes in dataset and keep swapping the data until all are sorted.

I believe, Ymin & Ymax is a range given as an input to query.

Threads must be having some attribute(s). For example, resource , availability , ownership etc. Based on them we can have a priority among the threads set.

And based on priority we can put them in a heap. So whenever a request comes, we take the top element from the heap and assign it. And later re-arrange the heap.

Very well comprehended, in my opinion.
I would add, I would also try another website(s) to eliminate (1) & (2). Also launch speedtest in parallel ( for 2)