Process: Online Assessment 1st Technical Round 2nd Technical Round Fitment Round Online Assessment: It comprised three questions two of which were easy to medium and the third was hard. The topics were greedy algorithms, scheduling problems in queues, and string compression. We were given 90 minutes. Solving 1-2 questions could potentially advance you to the next round. The results were declared after 4-5 days. 1st Interview: The interviewer began by asking me to introduce myself, then moved on to technical questions. The first two questions were about arrays and strings. I proposed a brute force approach, which the interviewer then asked me to optimize. We progressed to a sub-problem of the same question. After this, questions on sorting techniques and their applications were discussed. I was then asked to implement a binary tree. These questions ranged from easy to medium. We then moved on to CS fundamentals, starting with DBMS—specifically transitivity and database normalization, including different normal forms. The OS questions were easy, covering topics like types of OS, the difference between multiprocessing and multitasking, and processes vs threads. CN included questions about packets and security. Toward the end, the interviewer asked about the tech stacks and projects listed on my resume. One project involved ESP 32, prompting a question about whether it is a microprocessor or a microcontroller. This interview lasted 50-60 minutes, and the results were declared an hour later. I was selected and I skipped lunch to revise my CS fundamentals on InterviewBit. After a 3.5-hour wait, around 6:30 PM, it was finally my turn for the second round. 2nd Interview: It began with an introduction, followed by discussions on the databases I have worked with, and the differences between SQL and NoSQL databases. Then, the interviewer described the workflow of a user-doctor appointment app and asked me to create an ER diagram. I outlined the schema for all entities and established their relationships. When discussing the user-to-doctor relationship, the question arose whether it was one-to-many or many-to-many. Subsequent queries were based on the tables, such as fetching all users who had appointments with a specific doctor. Discussions on hashing in DBMS and types of encryption followed. I was also asked to implement a binary search tree and perform a sort operation within it. Though I explained my approach, I was stuck at one point. Then I was asked, the question about the minimum number of platforms required for a railway station was addressed using a greedy (efficient) approach, but I struggled when asked to solve it without sorting.