Tip 1: Data Structure should be clear till hashmaps, graphs & DP are not asked frequently
Tip 2: Angular, .Net Core SQL Server should be most important in this interview.
Tip 3: it is a tough Aptitude question be prepared for that from RS Aggarwal and questions are tricky.
Tip 1 : Have good work experience in.net and angular.
Tip 2 : they generally need full-stack engineers so be prepared with all questions.
Normal MCQs based on .Net Core and 2 Basic Coding Questions.

1
123
12345
1234567
123456789
12345678912
1234567891234
123456789123456
1234567891234
12345678912
123456789
1234567
12345
123
1



Do not allocate extra space for another array. You need to do this by modifying the given input array in place with O(1) extra memory.
'n' = 5, 'arr' = [1 2 2 2 3].
The new array will be [1 2 3].
So our answer is 3.
Step 1: Input the size of an array from the user and store in the size variable.
Step 2: Use for loop to read the elements of an array and store them in arr[i] variable.
Step 3: To get the duplicate elements from an array we need to use two for loops. Where the first loop starts from 0 to size. And the structure of the loop is: for (i = 0; i < size; i++).
Step 4: then it asked some casual question and the interview is over
Firstly They told me to introduce myself and then asked some Angular questions and follows by .Net Core questions, & SQL Server, OOPs, and 1 basic data structure question.



Two strings are said to be a permutation of each other when either of the string's characters can be rearranged so that it becomes identical to the other one.
Example:
str1= "sinrtg"
str2 = "string"
The character of the first string(str1) can be rearranged to form str2 and hence we can say that the given strings are a permutation of each other.
Step 1: Create count arrays of size 256 for both strings. Initialize all values in count arrays as 0.
Step 2: Iterate through every character of both strings and increment the count of characters in the corresponding count arrays.
Step 3: Compare count arrays. If both count arrays are the same, then return true else return false.
What is RDBMS?
Why do I need an index in a database?
What is a full join in SQL?
What is the right join in SQL Server?
What is a trigger in SQL Server?
Tip 1: Prepare SQL server from Youtube and Javapoint.
Tip 2: Good notes available online can look into it.
What is the difference between SQL and PL/SQL?
What is a left join in SQL Server?
Why and when to use triggers?
All Aptitude of MBA level
The most difficult round of my experience and hardest aptitude given till now passing is 50 %.
FYI: Never prepared for MBA those who have prepared for MBA then it is simple. Puzzles are long and lengthy need to rush through all the questions.
Also negative marking is there.
A,B, C ,D, E, F, and G are seven persons who travel to office everyday in a particular metro train which stops at five stations – Kashmere Gate, Rajiv chowk, INA, AIIMS and Qutab Minar respectively – after it leaves the base station.
I. Three among them get in the metro at the base station.
II. D gets down at the station next to the station at which F gets down.
III. B does not get down either with A or E.
IV. G alone gets in at INA and gets down with C after having passed one station.
V. A travels between only two consecutive stations and gets down at Qutab Minar.
VI. None of them gets in at Rajiv chowk.
VII. C gets in with F but does not get in with either B or D.
VIII. E gets in with two others and gets down alone after D.
IX. B and D work in the same office and they get down together at INA.
X. None of them gets down at Kashmere Gate.
All questions are of similar level and above.
General Discussion and Knowledge are asked as some basic questions about my life.
Asked about previous company experience.
What is your goal after joining Saxo Bank?
What is your learning path after 2 years of experience?
What is your hobby?
what are your future goals ?
What is your expected CTC?

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