Tip 1 : Don't lie on your resume.
Tip 2 : Practice at least 400 different types of coding problems.
Tip 3 : Work on your communication skills.
Tip 1 : Don't put false things on your resume.
Tip 2 : Mention some good projects on your resume.
It was a telephonic round. The interview asked me these questions.
You have two ropes coated in oil to help them burn. Each rope will take exactly 1 hour to burn all the way through. However, the ropes do not burn at constant rates—there are spots where they burn a little faster and spots where they burn a little slower, but it always takes 1 hour to finish the job.
With a lighter to ignite the ropes, how can you measure exactly 45 minutes?
1. Dynamic memory allocation for 2d array
2. How polymorphism works in C++(Vptr and Vtable implementation)
The interviewer started asking me questions. He gave me 2 problems. He was giving hints in case of any issues.
For 'arr' = [ 1, 2, 3, 1, 2]. you need to return 1.
There is an online catalog of songs (Like Saavn or Gaana). How you will show favorite songs every day to users. An efficient algorithm required. (K max solution/ Min heap solution)
This was a technical interview. He gave me these questions one by one.
1. Again, how polymorphism works. Draw vtable and vptr
2. Producer consumer problem with synchronization
3. Difference between mutex, semaphore, and condition_variable.
4. Design parking lot system
5. Zigzag traversal of binary tree
Design parking lot system
Input: Consider the following Binary Tree:
Output:
Following is the level-order traversal of the given Binary Tree: [1, 2, 3, 5, 6, 4]
1. He asked about the producer-consumer problem but I told him that the same question is asked in the previous round.
Then interviewer went asking lots of questions related to producer and consumer. Lots of discussions like what is a writer is not there and the only reader is there and you need to find out how many readers are currently reading from the buffer.
2. Discussions about C++11 features. How thread and async is different
3. Design your own shared_ptr(How you will handle ownership)
4. Check If the binary tree is symmetrical.
5. Find elements in a rotated sorted array and then optimize it.
1. If ‘k’ is not present in 'arr', then print -1.
2. There are no duplicate elements present in 'arr'.
3. 'arr' can be rotated only in the right direction.
Input: 'arr' = [12, 15, 18, 2, 4] , 'k' = 2
Output: 3
Explanation:
If 'arr' = [12, 15, 18, 2, 4] and 'k' = 2, then the position at which 'k' is present in the array is 3 (0-indexed).
The interviewer gave his introduction then he asked me to introduce myself. Then he asked about my hobbies and my strengths. Then he gave me these questions.
1. You are given a rotate function which basically will take any object like (2d image, 3d image, audio, video) and will rotate it by 180 degrees. You need to design the functionally. You only know what type of object is there. (Factory design pattern).
2. Expression evaluation (The only constraint was that each operand will have different units). For ex-40 inches + 2*2cm +11/2mm + 12*2/6cm. You will have a final unit which you need to convert.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What does HTML stand for?
Yes