Tip 1 : Practice a variety of questions based on Data Structures & Algorithms so that you feel confident on the day of interview.
Tip 2 : Update your CV/Resume in accordance to job desciption .
Tip 3 : Make sure you go through your projects that you mentioned on your CV/Resume prior to interview.
Tip 1 : Mention some good development projects that you are confident upon fully and make sure you mention some github link to that project.
Tip 2 : Update your CV as per job description
This round consisted of 90 mcq questions from a variety of topics including aptitude, programming logic, cloud computing, computer networking and the time alloted was 60 minutes. Then we moved to coding part were 2 medium-hard level questions were asked. In order to clear the exam you have to pass all the test cases.



Consider following matrix:

The rectangle (1,1) to (3,3) is the rectangle with the maximum sum, i.e. 29.

The given problem can be solved using recursion by diving the probelm in to various ssub-problems, but their may be cases of solving the same sub problem again. This indicates the problem to be a DP ( Dynamic Programming ) problem using memoization.
Step1: Intialize a dp matrix of size m x n and intialize it to -1 and a count variable to 0.
Step 2: If memo[i][j] != -1, return the result.
Step 3: Since dp[i][j] tells how many paths are there until cordinates i,j that may be one position before our boundary(let say at x-1), the ways of reaching the boundary(say x) is the path from all the four directions i.e. i-1,j i+1,j, i,j-1,i,j+1 and decrement no.of moves.
Step 4: Store the updated result in a temporary lets call it temp and store the result till x position in that.
Step 5: Increment the count variable if no.of moves becomes 0.
Step 6: At Last, return the count of path and store it in memo array.



1. If any two numbers have the same count of set bits, then in the sorted array they will appear in the order in which they appear in the original array. For example, let the array be { 2, 4, 3}, in this case, both 2 and 4 have the same number of set bits so the answer will be {3, 2, 4} and not {3, 4, 2}, because in the original array 2 appears before 4.
2. The array may contain duplicate elements.
The interviewer started with my introduction and asked in which language was i comfortable with. Then he directly jumped to the coding part were he asked me to share my screen and code some coding questions based on DS and Algorithm. The platform had a build in compiler. The interviewer asked me to optimize my code. When he was satisfied, he moved to the projects that i mentioned in my resume and the minor project i did in college. The Interview was around 45mins to 1 hr .



You are given, ‘str’= ‘codingninjas’, when we split this string we get, ‘coding’ and ‘ninjas’ which both contain 2 vowels each. Hence the answer is ‘True’.
1. First I split the array using the split function wherever there was a comma.
2. Converted it into Integer(Type Casting).
3. Made a helper function and build the logic for perfect square.
4. Stored into an array and then returned it.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?