CareerCup

Group orders by items present in the orders.

Class Order{
String orderId;
List<String> items;
}

Given Order id and items:

O1: [A, B]
O2: [B, C]
O3: [D, E]

Output: [[O1, O2], [O3]]

Note: There can be more that 2 items in an order.

List<List<String>> implementhis(List<Order> orders){
}

Design an email client where you can only send emails to people who are present in your contact list. Build for only the following functionaliy
1) Send/Receive Emails
2) Add/Remove Contacts
3) See Inbox
4) See Sent Mail

Design a distributed LRU Cache.

Given a binary tree, find the closest LEAF node to the target.

What would be the sample class design of notification system?

What would be the sample class design of tic tac toe game?

What would be the sample class design of Outlook like meeting scheduler?

Given two arrays. One is for tasks (Processes) and each element depicts the amount of cores required to run the task. 2nd array is an array of CPU where each element depicts the no of cores in it.We have to tell how many maximum number of tasks can be allocated. Example: Task: [3, 5, 7], Cores: [1, 3, 5] . Here only task 0 and 1 can be allocated to CPU 1 and 2 . So, answer=2.

What is the best way to generate first N primes? (not primes up to N but first N primes)

How do find out the top trendings products on a last hour/day/monthly basis?

Given that we have access to a real-time stream of sold product ids.

Design Amazon prime video

How would you design a system where you have 1000 records in database and on UI you are showing them, a user can select single or bulk record which can be in any order and drag drop to reorder the sequence of the record. Example :
I have below records
1
2
3
4
5
a user selects 1 and dragdrops it on 5th position, so the new order becomes 2,3,4,5,1. This has to be done at the database layer and in efficient way. How to maintain continuous reordering sequence of records?

Give m balls and n bins. Find out how many ways to assign balls to bins. Notice the buckets has no order. Like (1,2,3) and (3,2,1) are considered the same.
eg, m = 3, n = 2, return 2. (1, 2) and (3, 0)

Two Sum. Then follow up three sum

How is design review done?

Given a BST of memory sizes. Find best fit for a memory block of size M.

Given an infinitely large array and every element has tags associated with them, and there are about 10,000 tags (say) then sort the given array to get all tag-0’s first, tag-1’s next and so on in O(n).

For Amazon SDE-1 On Campus Interview, what are the topics I should study in Database Management ?
Just don't name the topics. Please elaborate too.

For Amazon SDE-1 On Campus Interview, what are the topics I should study in Computer Networking ?
Just don't name the topics. Please elaborate too.

Given a random MxN matrix and a positive integer, recursively Your program should then find a continuous path thought the matrix starting at position 0,0 that will sum to n. Your program shouldomly move left (col -1), right(col +1), up (row -1) and down (row+1)and can only use a position once in the sum. if there is a such path in the matrix, create the path in a separate matrix with the same size, and replacing the indices used with 1 and the rest 0.

Design a music streaming service like Pandora.

How you will design and make a website like Hackerrank? How you will measure and limit the running time and memory usage of the program.

Design a class for converting integer to Roman numerals.

Given k, and a binary string, determine if this contains all permutations of length k.
For example, 11001 contains all possible binary sequences with k=2 (00,01,10,11)

Design the Goodreads recommendation model.

Goodreads is a "social networking book" website that allows individuals to freely search its database of books.

- Any given user has a List of friends.
- User can add books to his/her shelve
- When a user logs in, we need to show the top 10 books owned by his friends

Example:
User1 has u2, u3, u4, u5 as friends

u2 owns b1, b2, …b10
u3 own b1, b2, b11…b20
u4 owns b1, b2, b11…b20
u5 owns b1, b33, b35, etc

topmost book is b1, second topmost book is b2 and so on.

If you maintain a cache of top 10 books in the user object for each of the users. How often will you update the cache ?

You have been given a generator string ab from which any number of strings can be generated recursively by inserting ‘ab’ at any location. You have been given an input string to check if that given string is valid or not.(i.e. generated by given with given string.)

eg.
Input: aabbab
Output: valid
Input: abbaab
Output: Invalid

I could not come up with a algorithm less than O(N*N)

Given a multiple tree, and multiple nodes that need to be deleted,
It is required to return a list of nodes so that the children of these nodes can be found after the nodes have been deleted.

Gives you an int m, and a set of char (0,1,2,3,4,5,6,7,8,9)
Lets you implement a function that generates a id based on the characters in the set. Each time you return a string, it must be unique. satisfying the same character can not appear consecutively more than m times, such as m = 3, "1000" is valid,
"0000" is not valid.
The smaller the string, the better.

Let’s say you have two input arrays with sorted elements. Find the union.

a[] = {2, 10, 14, 19, 51, 71}
b[] = {2, 9, 19, 40, 51}

Union = {2, 9, 10, 14, 19, 40, 51}

A group of friends are tracking the miles per gallon for each of their cars. Each time one of them fills up their gas tank, they record the following in a file: His or her name The type of car they drove How many miles driven since they last filled up How many gallons purchased at this fill up Date of the fill Their data is formatted as a comma separate value (csv) file with the following format for each row:(#person,carName,milesDriven,gallonsFilled,fillupDate) Miles are recorded as floating-point numbers and gallons as integers. Please create a program that allows members of this group to determine the miles per gallon (MPG) of each of their cars during a specific time range. Note: person may have more than one so a time range query might need to output data for one or more cars. A skeleton class will be provided; your job will be to complete the program. The principal function for querying MPG is of the form (the exact name, data types, etc., can be learned by inspecting the "solution" class in the skeleton code): GetRangeMPG(PersonName, StartDate, EndDate) Returns list of objects containing (CarName, MPG) MPG is calculated as (total miles traveled during time period)/ (total gallons filled during time period. The dates you receive in the query should be treated inclusively.