Problem of the day
Tip 1 : Do competitive programming in 1st and 2nd year.
Tip 2 : Study every data structure and algorithm in dfs manner. Once done then practice.
Tip 3 : Don't ignore theoretical subjects.
Tip 1 : Do at least 2 projects.
Tip 2 : Mention your programming accounts.
There were 4 questions. All questions were of medium-hard level. Try to maximize your score.
The round lasted for about 45 min. I was asked a lot of OOPs questions. There was a detailed discussion on one of my project along with current problems in my project. How can I make it more secured and increase scalability.
I just had to write the push and pop functions. After discussing my approach and its complexities, I was allowed to code.
There were two interviewers. After introduction, and small discussion on my project. They asked my favourite subject, I answered OOP- was asked to differentiate between OOP language and Procedure Oriented Languages. Then definition of OOP and real life examples of overloading and overriding.
I was asked to code a data structure where I can obtain, add, remove one occurrence and all occurrence in O(1). I tried using maps, he was not very satisfied.
How I test my solution in Cp and in projects.
I was asked to write a cpp code to illustrate Deadlock.