Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
Given a point on the perimeter of the circle and an interior point. Find the probability that the rectangle formed with diagonal as the line segment joining these points lies inside the circle.
At first, I could not get any approach and then I asked for a hint and then I solved this question by dividing the circle into two semicircles and considering the cases for point and finding probability in each case, and integrating them.
My wife and I recently attended a party at which there were four other married couples. Various handshakes took place. No one shook hands with oneself, nor with one's spouse, and no one shook hands with the same person more than once. After all the handshakes were over, I asked each person, including my wife, how many hands he (or she) had shaken. To my surprise, each gave a different answer. How many hands did my wife shake?
This was a very high-level puzzle and I almost took 10 minutes to think this at the time of the interview. The answer was 1 which I found out considering the pairs and making cases. After this, I found out that the married couples shook hands in pairs 8th person shook hand with 0, 7th with 1, 6th with 2, 5th with 3. The only person left who shook hands with 4 is the wife and hence answer was one.
Design a job scheduler. Tasks will be given as inputs with an extra parameter ‘delay’.That meaning the task has to run after this ‘delay’ time.
I gave him a solution using multithreading with proper explanation. My communication with the interviewer was very good so he got my solution very easily.



update(l, r, val) : Add (val + i) to arr[l + i] where, 0 <= i <= r - l.
rangeSum(l, r): return the sum of all elements in the array from index l to r, i.e., the sum of array arr[l...r].
Type 1: for update(l, r, val) operation.
Type 2: for rangeSum(l, r) operation.
Note: (1 based indexing) for the queries.
Given an integer array(ARR) of size N, the following operations need to be performed:
update(l, r, val) : Add (val + i) to arr[l + i] where, 0 <= i <= r - l.
rangeSum(l, r): return the sum of all elements in the array from index l to r, i.e., the sum of array arr[l...r].
Tell me about yourself.
Why should I hire you?
What are your goals?
What motivates you to do good job?

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