Maharaja Surajmal Institute of Technology, Delhi Placement Interview Questions

Round duration - 60 minutes
Round difficulty - Easy

In the first inerview round, I was asked two problems, that were based on Data Structures. 

I realized a key point in this round : that sometimes, the interviewer is wrong, and you are right. Still, you should not argue with the interviewer, rather, just accept, and move on. 

This happened in the first coding problem itself, when, I actually used a "map" in c++. The interviewer asked me, to use an "unordered map" Instead of map, saying, that using an unordered map would make the insertion cost O(1) instead of O(log(n)). I refused to this by saying, that using unordered map is risky, as in case of a lot of collisions, it could go O(n). 

Still, the interviewer said, that I were wrong, and said that he had done some competitive programming himself, and he never faced a TLE verdict because of using unordered map. 

And I knew very well, that an Anti-Hash-Test could be created, to enforce a TLE verdict. The interviewer went on to saying that "every competitive programmer in the world would never use a map, rather, always use unordered map".

I slightly smiled to this, but agreed, and later cleared that interview, because of the smooth second problem.

• Q1. Anagram Pairs Verification Problem Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can re...read more
  View Answers (1)
• Q2. Distribute N Candies Among K People Explanation: Sanyam wishes to distribute 'N' candies among 'K' friends. The friends are arranged based on Sanyam's order of...read more
  View Answers (1)

Round duration - 60 minutes
Round difficulty - Medium

I were asked several questions involving DBMS. I was given data of patients of entire country, and was asked to make a dataBase for the same.

• Q1. How would you create a database to store the data of all the patients in a country?
  Add Answer