- Random music shuffle question. Given a list of songs and a skip order like songs = [A,B,C,D], skipOrder = 2. If a song is played once, it cannot be back in the shuffling list till skipOrder is done. Ex: If A is played first and then A cannot be back in the list until next 2 iterations.
- Given chat logs, find the user who sent the highest number of words.
- A matrix question - Given a matrix that consists of two towns and water heights at the specific index, find the index where you can construct a dam which has highest height and the water can flow through two towns. Ex: [[1,2,3,5], [1,5,0,2],[6,0,2,1],[6,7,3,2]] - lets say indices with 0 values are the two towns. Now, we have to find the index(highest value) where we can construct the dam so that the water flows to both towns and the water can flow to the index index when the water level is low in the next index. (More like the pacific atlantic flow question)
- Give an array [1,2,3]
Easy - double the numbers in the list and add it back to the list and return a permutation of the list. => [1,2,3,2,4,6]
Medium - now given the permutated list, find the original list. [1,2,2,6,4,3] => [1,2,3]
Comments (9)
