Tip 1 : Make you Data Structure and algorithms , Problem solving strong ( use to do some dsa problems on code studio and leetcode daily.
Tip 2 : Practiced Quality questions and mostly asked questions list available on codestudio( used company tags and topic tags) as quality matters more than quantity of questions .
Tip 3 : Give mock interviews, this really helped me as it gives you clearity and builds confidence.
Tip 4 : Read respective company’s interview experiences available on codestudio and other websites before going to actual interview, as this gives you idea about level of interviews and you can prepare beforehand.
Tip 5 : after solving dsa problem .Try to look in discussion section too as you can get more optimised or more efficient approach used by others to solve the problem.
Tip 6 : Prepare important concepts from Operating system,DBMS,System design too as that might also be asked.
Tip 7 : Do atleast 2 quality projects.
Not a Tip But : Lot of quality content available online, whenever felt like stuck with some concepts take help from senior or colleagues ( I use to watch coding ninja shorts by parikh jain whenever felt demotivated or stuck with concepts)
Tip 1 : Have a concise resume , don't fill your resume with unnecessary details like your address, relationship status etc.
Tip 2 : Resume should not be more than 2 pages( try to make it very concise in 1 page)
This round was mainly focused on DSA and Java, spring boot



You don't have to print anything, it has already been taken care of. Just implement the given function.
It is a simple string question, that can be solved by recursive and iterative. The idea is to check whether the current character is equal to the next character. If the current character is equal to the next character, we will ignore it; when it is not equal, we will add it to our final string.It can be also solved with help of Hashset but that will need extra space.



'S' = "{}()".
There is always an opening brace before a closing brace i.e. '{' before '}', '(' before ').
So the 'S' is Balanced.
It is standard stack problem which can be solved using stack. Traverse the Expression string and keep pushing characters for open braces and if the current character is a closing bracket (‘)’ or ‘}’ or ‘]’) then pop from the stack and if the popped character is the matching starting bracket then fine else brackets are not balanced. After complete traversal, if there is some starting bracket left in the stack , then the expression is not balanced.
What is immutability?
Why strings are immutable in Java?
What is Hashing?
How hashMap is implemented internally. what updates came with java 8 in HashMap.?
Difference between spring and spring boot?
Java 8 new features.
OOPs concepts and use in projects.
think out loud. Ask the interviewer if you have any questions about the problem statement given.
It was managerial round
Asked me about my introduction and My background.
Asked me about monster com
Asked me about projects i worked on in my previous organisation and tech stack I used.
We discussed HLD of projects i did.
why spring boot is used , advantages.
Questions on Hibernate and JPA framework.
Discussed about microservices and its advantages.
How would i implement a Cache for application.
Situations when i worked in pressure and how i handled it.
We discussed different projects and opportunities in monster com
Read about the company before going for an interview.
It was standard HR Round
Asked me about my introduction and my experience Why are you leaving current organisation.?
Why should we hire you?
Offers in hand?
Why do you want to join our organisation?
What is your expected CTC?

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