Tip 1 : Don't lie on Resume
Tip 2 : Study Data Structures & Algorithms well
Tip 3 : Study core subjects well
Tip 1: Keep the resume short
Tip 2: Mention only skills relevant to job
Three coding questions were asked from the topic of DP, Greedy and Bit manipulation



You are allowed to break the items.
If 'N = 4' and 'W = 10'. The weights and values of items are weights = [6, 1, 5, 3] and values = [3, 6, 1, 4].
Then the best way to fill the knapsack is to choose items with weight 6, 1 and 3. The total value of knapsack = 3 + 6 + 4 = 13.00



You are allowed to break the items.
If 'N = 4' and 'W = 10'. The weights and values of items are weights = [6, 1, 5, 3] and values = [3, 6, 1, 4].
Then the best way to fill the knapsack is to choose items with weight 6, 1 and 3. The total value of knapsack = 3 + 6 + 4 = 13.00
The interviewer asked 2 coding questions that were of easy level.



Step 1 : I first applied bubble sort. It was not good enough.
Step 2 : Interviewer asked me to optimise the solution.
Step 3 : I counted all zeros and and stored it in a count variable . In second iteration, shifted all other non zero numbers in and pushed the 0's count no of times at the end of array.



Given array/list can contain duplicate elements.
(arr[i],arr[j]) and (arr[j],arr[i]) are considered same.
Step 1 : I first used nested for loop approach.It was not good enough.
Step 2 : Interviewer asked me to optimise the solution.
Step 3 : Then used the sort method (two pointer) to solve interviewer was happy.
Asked me to Design the database of gmail. Asked me concepts about normalization and told to normalize my tables. After doing so he asked me 5 queries related to topics like inner joins, group by, aggregation, order by, limits . I was able to answer all of them correctly. Asked me in depth about one of my project.


The width of each bar is the same and is equal to 1.
Input: ‘n’ = 6, ‘arr’ = [3, 0, 0, 2, 0, 4].
Output: 10
Explanation: Refer to the image for better comprehension:

You don't need to print anything. It has already been taken care of. Just implement the given function.
Gave a brute force approach and explained the approach correctly. The interviewer didn't asked to optimize the solution he just wanted one approach.




Basic HR Questions
Your strengths and weaknesses
Where do you see yourself in 5 years?

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