Round 1: It was a skype round. Coding was done on a share screen. Questions were :
- Write copy ctor and assignment operator of a given class. Can we make them const?, Why is reference used in their dentition and not pointer.
- Observer design pattern. Will there be any delay if there are 100000 observers and if yes what is the best solution.
- Rearrange an array consisting of positive and negative numbers such that all positive numbers are together.
- Convert a non balanced tree into balanced tree.
- SOLID principles.
- Map’s internal implementation
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.