Tip 1 : Solve atleast 300 coding questions.
Tip 2 : Have some good projects on resume.
Tip 3 : Be truthful.
Tip 1 : Have 2 or 3 good projects.
Tip 2 : Don't lie on your resume.
This first round was the Online test which was 1 Hour 95 Minutes Long. It was Divided
as Follows.
1. Aptitude Section (Arithmetic + Analytical) 14 Questions – 26 Minutes
2. Technical MCQs( Computer Science) 14 Questions – 19 Minutes
3. Coding Question – 20 Minutes
4. Coding Question – 30 Minutes
5. Coding Questions :
Given ‘N’ = 4 and ‘ARR’ = [1, 1, 2, 2].
The answer will be 2, i.e., if we chose that all buckets should have 1 unit of water, we will have to throw 1 unit of water from buckets 3 and 4. Hence 2.
A : [1, 3]
B : [4, 2]
K: 2
The possible sum combinations can be 5(3 + 2), 7(3 + 4), 3(1 + 2), 5(1 + 4).
The 2 maximum sum combinations are 7 and 5.
This was an Online F2F Technical Round conducted on CodePair : Hackerrank. So, Basically You have to Run and Submit ( Pass All Test cases) in the Interview Round also (Like normal Coding Test) in Codepair: Hackerrank & along with that You should have to explain your Code and Approach to the Interviewers.
1. 0-based indexing is used in the array.
2. We only care about the garden from 0 to 'N' only. So if i - 'ARR'['i'] < 0 or i + 'ARR'['i'] > 'N', you may ignore the exceeding area.
3. If some fountain covers the garden from position 'A' to position 'B', it means that the water from this fountain will spread to the whole line segment with endpoints 'A' and 'B'.
This was also an Online F2F Technical Round conducted on Codepair : Hackerrank.
Dynamic Programming Based Not So Easy Level:
Best Time to Buy and Sell Stock
Best Time to Buy and Sell Stock II
Dynamic Programming Based Not So Medium Level
Best Time to Buy and Sell Stock with Cooldown
Best Time to Buy and Sell Stock with Transaction Fee
Dynamic Programming Based Hard Level
Best Time to Buy and Sell Stock III
Best Time to Buy and Sell Stock IV
They asked me a Lot of Questions like:
How did you arrive at this Solution ?
Why is this Approach Right ?
Can You do this in Better time & space complexities ? (Although I have done in Best time Complexity but they asked this to check my confidence level on my codes).
A lot of Variants based on Constraints.
You can’t engage in multiple transactions simultaneously, i.e. you must sell the stock before rebuying it.
Input: N = 6 , PRICES = [3, 2, 6, 5, 0, 3] and K = 2.
Output: 7
Explanation : The optimal way to get maximum profit is to buy the stock on day 2(price = 2) and sell it on day 3(price = 6) and rebuy it on day 5(price = 0) and sell it on day 6(price = 3). The maximum profit will be (6 - 2) + (3 - 0) = 7.
1. Buying a stock and then selling it is called one transaction.
2. You are not allowed to do multiple transactions at the same time. This means you have to sell the stock before buying it again.
Input: ‘n’ = 7, ‘prices’ = [3, 3, 5, 0, 3, 1, 4].
Output: 6
Explanation:
The maximum profit can be earned by:
Transaction 1: Buying the stock on day 4 (price 0) and then selling it on day 5 (price 3).
Transaction 2: Buying the stock on day 6 (price 1) and then selling it on day 6 (price 4).
Total profit earned will be (3 - 0) + ( 4 - 1) = 6.
This was an HR round. He asked me lot of questions:
I. How was your Interview Experience ?
II. What difficulty did you face this time in the Virtual Recruitment Process ?
III. If the Questions were relevant those were asked in the Interviews ?
IV. Have you worked in a Team Before ?
V. If you will have a contradiction with your colleague then how will you sort this ?
VI. What major Projects did you have made ?
VII. If not D.E Shaw then What ?
VIII. Next Five Year Goals ?
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL keyword removes duplicate records from a result set?