Tip 1: Do revise the OOPs concepts of your primary language (mine is C++).
Tip 2: Revise all the DSA concepts to brush up on your problem-solving skills and review the system design concepts.
Tip 3: Practice some puzzles and quantitative problems, as they can help during interview rounds.
Tip 1: Highlight only the tech stacks you are proficient in on your resume.
Tip 2: Mention projects you are confident in explaining, and specify the technologies you used to solve them.
At 6 PM, I was at the institute with all the selected CSE students, ready to appear for the OA round.

Given a password in a string, we have to determine whether the string satisfies all the conditions below: -
1 - Must contain a capital letter.
2 - Must contain a number.
3 - Must contain a special character.
4 - Must not contain the word “password” in any form.
5 - Length should be of more than 7 characters and less than 31 characters.
I traversed the string up to the point where all the above 4 conditions were met and for the 5th condition, I only compared the length to the given range.



An equation is given in the form of a digit represented by x, need to find the value of x from the equation.
Example: 75 / x5 = 3, output will be 2 here.
First I designed a helper method to decide which mathematical operation needs to be performed based on the given equation.
Secondly, I keep traversing a loop from x=0 till I get the value of LHS equals RHS.



Merge Sort Algorithm -
Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.

The above illustrates shows how merge sort works.
It is compulsory to use the ‘Merge Sort’ algorithm.
I applied the best-case complexity approach of merge sort to solve this problem.
In the afternoon, I was at my institute to appear for the interview along with four others after the OA round.
~ Asked me about the OOPs concept in C++, static and non-static methods.
~ Asked about how I had approached the online assessment round problems.
~ Asked about different sorting algorithms and merge sort specifically.
Tip 1: Revise the DSA and OOPs concept for such questions.
Tip 2: Keep in mind your steps while solving the OA round problems.
Tip 3: Revise the different sorting algorithms and ways to reach optimized solutions in solving them.
~ Asked me to explain about low-level design approach.
~ The interviewer asked me about the system design steps of my projects in my resume.
~ The interviewer gave me a problem statement and asked me to build the system design of the problem.
Tip 1: Revise the system design concept of any mock problem statement and know the basics of it.
Tip 2: Memorize the steps of designing solutions to the projects mentioned in your resume.
Tip 3: Don't hesitate to ask for help and discuss the approach to the problem statement.
It was in the afternoon at the institute. Unfortunately, I wasn't able to clear the first technical round, so I didn't appear in the final technical round. Only one student was selected for that round.

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