Problem of the day
Tip 1 : Leave the subject but never leave the topic
Tip 2 : Have good hold on DSA
Tip 3 : Always go through the interview experiences of the company and common interview questions
Tip 1 : Never add false things on your resume
Tip 2 : Add atleast 2 projects
It was an Aptitude + Technical mcq round. It started at morning around 10:00 am and the test duration was of one hour.The questions were of moderate difficulty. Practice the dsa mcq from gfg . Most of them were previous year gate questions which you can find easily on internet.
It was an online coding round consisting of 3 questions conducted on Mettl platform. It started at 10:00 am and the test duration was of 90 mins. The questions were pretty easy of topics like arrays and strings.
The logic is simple.
Step1 : First, you take input from the user asking the value of n.
Step2 : Then you run a loop finding all the prime numbers.
Step3 : Whenever a prime number is found, the count is increased and if the count is equal to the input of user (i.e., if the prime number found is the nth prime number), then print it.
1. We will take each word after a space “ “ in a sentence and pass it to a function.
2.The function transforms the characters of words in lowercase.
3. Now start traversing from the first character of the word and compare word with word[length-1], word with word[length-2] and so on.
4. If any mismatch occurs break loop else return true.
I had done this question before.
Interview was scheduled for 11:00 am and took around 20 mins. It was conducted on MS teams. The interviewer was polite and frank.
After the introduction he asked me some questions related to OOPS such as:
1. What are the principles of OOPS
2. What do you mean by polymorphism?
3. What is function overloading?
4. What are abstract classes and interface.
Then he gave me one coding question to solve. He told me to write the code on notepad and share screen.
question asked: Reverse the stack using recursion.
I was not able to solve this problem hence he gave me another question:
question: Reverse the linkedlist without using any extra space.
I was not able to solve this question
Step1 : I tried to solve this problem by making a new linkedlist.
Step2 : Then I tried using stack.
Step3 : Interview told me to optimize the approach without using any extra space.
Step4 : I could not think of optimized solution