1.) LRU Cache - using generics in Java
2.) 1D candy crush.
3.) Pattern Printing [ the row contains only those many stars as the row number][the stars get depleted]
4.) Many elements: find the K most frequently occurring elements.

Question

1.) LRU Cache -> using  generics in Java
2.) 1D candy crush.
3.) Pattern Printing [ the row contains only those many stars  as the row number][the stars get depleted]
4.) Many elements: find the K most frequently occurring elements.

Anonymous · Accepted Answer

I solved all the question including the edge cases.

Started from the brute force approach : to the most optimal approach.
i needed some help for understanding one edge case but solved all the other edge cases by myself.

Bloomberg

Bloomberg Interview Question

Interview Answer

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches