Tip 1 : Practice standard questions of data structures and algorithms
Tip 2 : Have good knowledge of DBMS
Tip 3 : PracticeSQL Queries
Tip 1 : Have some team projects
Tip 2 : Have a project on DBMS
Tip 3 : Don't put false things on resume, they ask each and everything.
Time restrictions were really hard.
You can not re-attempt any question.
You can't even re-visit any question.
They literally asked everything.
If the given matrix is:
[ [1, 2, 5],
[3, 4, 9],
[6, 7, 10]]
We have to find the position of 4. We will return {1,1} since A[1][1] = 4.
'S' = "{}()".
There is always an opening brace before a closing brace i.e. '{' before '}', '(' before ').
So the 'S' is Balanced.
If the given array is: [0, 0, 1, 0, 1] The largest subarray would be: [0, 1, 0, 1] (last 4 elements) having length 4.
For given 2D array :
[ [ 1, 2, 3 ],
[ 4, 5, 6 ],
[ 7, 8, 9 ] ]
After 90 degree rotation in anti clockwise direction, it will become:
[ [ 3, 6, 9 ],
[ 2, 5, 8 ],
[ 1, 4, 7 ] ]
SQL query - Top 2 users in a table - do it using subquery, views, and joins.
SQL query - Nested query using joins.
The interviewer was very serious and was testing patience during the entire duration. He asked all W's for everything written in my resume and the round's difficulty was medium.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which is a DDL command in SQL?