Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
Input: 'arr' = [2, 2, 2, 2, 0, 0, 1, 0]
Output: Final 'arr' = [0, 0, 0, 1, 2, 2, 2, 2]
Explanation: The array is sorted in increasing order.
You have been given an array/list ARR consisting of ‘N’ elements. Each element in the array is either 0, 1 or 2.
Now, your task is to sort this array/list in increasing order. For example, if ARR = [0, 2, 1, 1], then after sorting ARR must look like [0, 1, 1, 2].
You have been given 'N' ropes of different lengths, we need to connect these ropes into one rope. The cost to connect two ropes is equal to sum of their lengths. We need to connect the ropes with minimum cost.
The test-data is such that the result will fit into a 32-bit integer.
Design a logging and analytics system which can support huge amount of load.
Tip 1 : Learn about time-series database
Tip 2 : Learn about message queues and use them in solution
Tip 3 : Explain how would you handle down time
A thief is robbing a store and can carry a maximal weight of W into his knapsack. There are N items and the ith item weighs wi and is of value vi. Considering the constraints of the maximum weight that a knapsack can carry, you have to find and return the maximum value that a thief can generate by stealing items.
Describe your ideal company, location and job.
What are your career options right now?
Explain how you would be an asset to this organization?
What are your outside interests?
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is the index number of the last element of an array with 9 elements?