Tip 1 : Practice coding question daily(GFG, Leet Code)
Tip 2 : Be good with basics for both DS as well as language which you choose.
Tip 1 : Keep your resume short and concise
Tip 2 : Have through knowledge of all this which you mention in resume
The test was held on Hackerearth. There were 4 coding question, of which 3 question where of medium difficulty and 4th question was very hard to solve



1. Each coin has a value associated with it.
2. It’s a two-player game played against an opponent with alternating turns.
3. At each turn, the player picks either the first or the last coin from the line and permanently removes it.
4. The value associated with the coin picked by the player adds up to the total amount the player wins.
'N' is always even number.
Ninjax is as smart as you, so he will play so as to maximize the amount he wins.
Let the values associated with four coins be: [9, 5, 21, 7]
Let’s say that initially, you pick 9 and Ninjax picks 7.
Then, you pick 21 and Ninjax picks 5.
So, you win a total amount of (9+21), i.e. 30.
In case you would have picked up 7 initially and Ninjax would have picked 21 (as he plays optimally).
Then, you would pick 9 and Ninjax would choose 5. So, you win a total amount of (7+9), i.e. 16, which is not the maximum you can obtain.
Thus, the maximum amount you can win is 30.
Let the values associated with four coins be: [20, 50, 5, 10]
Let’s say that initially, you pick 10 and Ninjax picks 20.
Then, you pick 50 and Ninjax picks 5.
So, you win a total amount of (10+50), i.e. 60.
In case you would have picked up 20 initially and Ninjax would have picked 50 (as he plays optimally).
Then, you would pick 10 and Ninjax would choose 5. So, you win a total amount of (20+10), i.e. 30, which is not the maximum you can obtain.
Thus, the maximum amount you can win is 60.
.

0 0
0 0
2 1
In the above grid, if Bob is present at (0,1), he can't move to (0,0) because the cell at (0,0) is seen by the guard present at (2,0).
0 0
1 0
2 1
In the above grid, Bob can move from (0,1) to (0,0) since this cell is not seen by the guard at (2,0) due to the block present at (1,0).
If all the corner cells are invalid, then return false.
.



.


"1st Quadrant": if +x,+y
"2nd Quadrant": if -x,+y
"3rd Quadrant": if -x,-y
"4th Quadrant": if +x,-y
"x axis": if x,0
"y axis": if 0,y
"Origin": if 0,0
.
The interviewer asked me to walk through resume. Then the interviewer asked me some questions on cloud and OOPS. After testing my knowledge about the basic concepts , the interviewer then gave me one problem statement and asked me to code the same



.
Question to test my team building ,leadership quality where asked. They asked some related to BNY Mellon's history and its development
Why do you want to work for our company?
Can you tell me about a time when you demonstrated leadership skills?
Do you prefer to work as part of a team or independently?
What is BNY? What do you mean by Custodian bank?
Can you tell me something about BNY and Mellon brothers merger

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?