Tip 1 : Focus more on DSA and CP( Try to solve problems daily)
Tip 2 : Focus on CS fundamentals
Tip 3 : Try to make atleast 1 big good project( if possible try to participate in a hackathon or in any open source)
Tip 1 : Prepare resume consisting of only things you actually have done during your college time.
Tip 2 : Only one page is enough and good.
This was an online coding round conducted on the Hackerrank platform and consisted of 4 questions.
1st question : (Easy - medium): Question was based on finding the kth largest element at some stages of iteration(slight variation of kth largest element question but problem was designed in such a way that was not easy to understand) , I solved it fully.
2nd question: (Medium-Hard): This question was based on greedy approach.( just like 4th problem of Div-2 on code chef , I solved 12 out off 13 test cases)
3rd Problem(Hard): It was difficult problem , as It required lot more pre-computation(do not remember the problem but difficulty was hard. I solved it partially.
4th problem(Hard): It was hard problem based on graphs where I had to apply DP to it as well(actual question do not remember).I solved it partially(but more than half).
I never saw it before that BNY Mellon asking such difficult questions in coding round itself. But I got selected for the interview round after a week(so those who solved more than 55% got selected for interviews I guess).
This round mainly focused on data structures and algorithm skills. Their focus was mainly on accuracy and how you write the code.
Based on React Js concepts as it was mentioned in my resume.
If the given linked list is 1 -> 2 -> 3 -> 4 -> 5 -> NULL.
Then rearrange it into 1 -> 5 -> 2 -> 4 -> 3 -> NULL.
This was the round we discussed a lot of things together(both me and interviewer , He had 12+ years of experience from same company).
You can’t sell without buying first.
For the given array [ 2, 100, 150, 120],
The maximum profit can be achieved by buying the stock at minute 0 when its price is Rs. 2 and selling it at minute 2 when its price is Rs. 150.
So, the output will be 148.
Let's say you are buying to shops to buy some fruits with different prices and any time you go to checkout, they tell you what is the price of what you bought.
but variations like you are giving off on the 3 items of same type if a person is getting. and so many other variations too..
I wrote code for all the variations , to cross check He asked me to run it on some test cases I coded successfully. and he got satisfied with those solutions.
Puzzle related to jugs with different capacities and dispersion tank.
we discussed lot of use cases of this puzzle and also I tried to give best answer using the Round robin way. Then he asked me how will you select the time quantum if capacity of each jug is same. I told to take average of them so that response time will be faster and no jug will go to starvation....He got satisfied. and then He discussed about the some concepts of vertical scaling and so on.
Actually He wanted to know whether I am able to code when different situations are put up and how much can I think of solutions to advance problems.
Technical + Managerial Round
Down: (row+1,col)
Right: (row, col+1)
Down right diagonal: (row+1, col+1)
Created a DP 2-D table.
solved for the first row and first column
then from cell with index (1,1) to any (r,c) running a loop and finding that what is smallest distance from top and bottom and keeping that in that table at that index. and so on...
1) Why do you want to join BNY mellon.
2) Show me the what kind of projects did you make( by showing the screen).
3) What all you know about BNY mellon and what It does and awards won by it.
and there were some more Questions from my Resume too.
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?
Very helpful