Tip 1 : Practice DSA
Tip 2 : Practice OOP
Tip 3 : Be honest
Tip 1 : Don't lie anything on your resume
Tip 2 : Keep it crisp and one page max
They called around afternoon to know more about me. It happened over a phone call. Don't lie about anything as they do some screening. Asked reason for change.
Are you ready to relocate?
Why do you want to join us?
What are your strengths?
Tip 1: Tell them honestly whatever is the reason
Tip 2:
Tip 3:
Asked 5 coding questions on DSA. Total marks were 250. Each question has a different weightage. They give you around a week to complete the round.



If the input tree is as depicted in the picture:
The Left View of the tree will be: 2 35 2
I solved it using recursion



1. All the elements are in the range 0 to N - 1.
2. The elements may not be in sorted order.
3. You can return the duplicate elements in any order.
4. If there are no duplicates present then return an empty array.








If the given input string is "Welcome to Coding Ninjas", then you should return "Ninjas Coding to Welcome" as the reversed string has only a single space between two words and there is no leading or trailing space.
Practice Strings.
Asks questions about your experience. Gives introduction to the role and what you'll be doing. Ask any questions about the company, culture or job.
Which tech stack have you worked on ?
Tip 1 : Just answer honestly. It doesn't matter if you have worked on a different tech stack than their job description
Design a parking lot system.
Tip 1 : Write neat code with comments. Also write the readme to explain your code.
Asked technical questions around DBMS and Java.
What are ACID properties.
Tip 1 : Read about DBMS concepts.
What is an Inner Join?
2 coding questions were asked in this round. It was easier than the previous online coding round.



1. We consider the ‘/’ operator as the floor division.
2. Operators ‘*’ and ‘/’ expression has higher precedence over operators‘+’ and ‘-’
3. String expression always starts with ‘(‘ and ends with ‘)’.
4. It is guaranteed that ‘expression’ represents’ a valid expression in Infix notation.
5. It is guaranteed that there will be no case that requires division by 0.
6. No characters other than those mentioned above are present in the string.
7. It is guaranteed that the operands and final result will fit in a 32-bit integer.
Consider string ‘expression’ = ‘((2+3)*(5/2))’.
Then it’s value after evaluation will be ((5)*(2)) = 10.
1. Split the string with regex matching + sign
2. Thus, every element in the resultant String array has either a single number or an expression of products.
3. Now traverse through the array to find indices having products.
4. Split the product expression with regex matching * sign
5. Now multiply every number that was split using * sign in Step 4.
6. Finally, every index has only numbers that need to be added for the final evaluation of an expression.
7. Add integers at all indices in the array received after Step 1.
8. The sum gives the final result of the expression string.



It was a bar raiser round where they ask system design questions mostly around APIs and Databases.
Asked to create APIs and design tables.
They give a problem statement and ask to create different APIs according to the requirements. Also create db tables for the same. The APIs might need to join two tables.
Tip 1 : Read about APIs and Db design.
Round with one of the founders to see for cultural fit. General questions about you, your journey, reason for change, priorities when looking for a job.
What are the top 3 things you look for in a job?
Why do you want change?
Tip 1 : Don't lie and be honest. If you're not right for the company, then the company is also not right for you.
Tip 2 : Ask questions.

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