Tip 1 : Having proper knowledge over Data Structures and Algorithms is crucial. Have your concepts cleared and then select one coding platform( for example, leetcode, CodeZen, GeeksForGeeks) and try to practice at least 5 questions everyday topic-wise. I completed around 300+ questions on leetcode, 100+ questions on geeks for geeks and around 30-40 problems on InterviewBit.
Tip 2 : Focus on time and space complexity. Students usually ignore this fact. However, you should think about how you can optimize your code further. Hence, instead of trying to solve more problems, try to analyze it.
Tip 3 : It sometimes gets easy to demotivate but you need to keep practicing daily. Don't cut down your sleep and diet. Healthy lifestyle and personality development also plays a crucial part.
Tip 1 : Do not mention those skills, projects or achievements which you haven't achieved. The interviewer is intelligent enough to verify them.
Tip 2 : Do not keep your resume too long, and do not mention irrelevant details. One page resume for an intern is enough.
Tip 3 : Have projects related to the field which you are applying for, this shows you are already experienced in the field.
The test was conducted at 11 am in Hackerearth and was of 90 minutes. The time was enough to solve both the questions as well as the MCQ's. It consisted of 2 coding questions and 10 MCQs. The level of questions was medium and the mcqs ranged from easy to difficult.



Cost of entries where j < i will be represented as INT_MAX VALUE which is 10000 in the price matrix.
If ‘N’ = 3
'PRICE[3][3]' = {{0, 15, 80,},
{INF, 0, 40},
{INF, INF, 0}};
First, go from 1st station to 2nd at 15 costs, then go from 2nd to 3rd at 40. 15 + 40 = 55 is the total cost.It is cheaper than going directly from station 1 to station 3 as it would have cost 80.
The output will be 55.
The solution is to use DP and create a 2D table and fill the table using above given recursive formula.
minCost(0, N-1) = MIN { cost[0][n-1], cost[0][1] + minCost(1, N-1), ........, minCost(0, N-2) + cost[N-2][n-1] }
The extra space required in this solution would be O(N2) and time complexity would be O(N3).
This solution was accepted however, solution using recursion wasn't because time limit exceeded.



1. A palindrome is a word, number, phrase, or another sequence of characters that reads the same backward as forward, such as madam, racecar, 1234321, etc.
2. The numerical value of the given string S will be greater than 0.
3. A single-digit number is also considered a palindrome.
4. The answer number should not contain any leading zeros, except for the case when the answer is 0.
5. Note that the length of the string is nothing but the number of digits in N.
There can be three different types of inputs that need to be handled separately.
The input number is palindrome and has all 9s. For example “9 9 9”. Output should be “1 0 0 1”
The input number is not palindrome. For example “1 2 3 4”. Output should be “1 3 3 1”
The input number is palindrome and doesn’t have all 9s. For example “1 2 2 1”. Output should be “1 3 3 1”.
So now you just need to think how can we iterate from middle of a number by taking two pointers i and j and can generate the next larger palindrome.
After clearing the coding round, Video call Interview was conducted at 12 pm. The interviewer was cooperative and gave hints whenever I stuck upon any question.



If there are any duplicates in the given array we will count only one of them in the consecutive sequence.
For the given 'ARR' [9,5,4,9,10,10,6].
Output = 3
The longest consecutive sequence is [4,5,6].
Can you solve this in O(N) time and O(N) space complexity?
Initially I gave the naive solution i.e, the brute force.
My second solution was to sort the array and then get the longest sequence.
I finally came to a better solution which was by using hashmaps
1. What is Deadlock? How this condition occurs and how to resolve it?
2. What is difference between threads and process?
Tip 1 : Always give a structured answer. For example, first tell the definition and then quotes a few examples in support of it.
Tip 2 : Do refer to GeekForGeeks articles for OS. Try to read as many articles as you can.
1. How do you tackle the situation when there is a conflict between you and one of your team members?
Tip 1 :You should always show a positive nature. Be confident while answering the questions.
Tip 2 : You should be able to communicate clearly and be able to express your thoughts.
I already gave the technical round so I wasn't that nervous. Also the interviewer was patiently listening the answers. It seemed like a normal conversation.
1. What all projects I have done? Explain any one project in detail.
2. Why I want to join Deutsche Bank?
3. How do I see myself 5 years down the lane?
Tip 1 : You should be aware about the company. Spend around 1 hour before the day of the interview and do a proper research about the company and its principles.
Tip 2 : You should be clear about all the projects, the technologies used in it, why you used them specifically, the purpose of the project, etc.
Tip 3 : Don't try to fake any achievements. The interviewer can ask tricky questions and it can become difficult to handle if you haven't achieved it.
It was the last round. 15 students were selected for this round. I was tired since I already gave 2 interviews.
1. Any situation where you showed problem-solving along with team skills?
2. What role do you want in our company?
3. Asked about one achievement mentioned in my resume.
Tip 1 : When talking about your skills, You can quote any example taken while making one of your college projects.
Tip 2 : For second question, What role do you want in DB?, I answered that I need a role where I can share my solutions with the team, help the company to grow and build a product which is useful.
Tip 3 : Do mention your coding achievements, it shows that you are interested in their work.

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