Round 1 (Online Coding): The round was conducted on Hackerrank. 600–700 students sat for the exam. This round comprised of a 2-hour long online test and had 4 sections: Section 1: 3 coding questions: You are the owner of a news channel and you have a show which starts at 0 and ends at M. You have N number of advertisements and each ad has an effectiveness value associated with it which is given in an array of size ’n’ in the format [v1, v2, …, vn]. The time when the ads can be shown is given in the format [(x1, y1), (x2, y2), …, (xn, yn)], where ith tuple in the array denotes the timing of the ith ad in the format (startTime, endTime). You have to maximize the sum of the effectiveness values of the ads if the minimum time gap between two advertisements is 4 min. So, if you select to show an ad having timings as (1,5), then you cannot show the next ad before 10. So the next ad (9,14) cannot be possible, but ad (10,14) can be. Constraints: m>=xi,yi>=0 Another DP problem: An array of costs was given. You can either take two jumps forward or one jump backward. If you land on a particular index, you have to add the cost to your total. Find the minimum cost needed to cross the array or reach the end of the array. Advanced coding question: Graph. I don’t exactly remember the question as I didn’t attempt it. Section 2: 10 MCQs based on Dbms, Operating System, OOP’s, Data Structures, Algorithms, and Mathematical problems (Probability and so on). This section had negative marking. Section 3: 2 Subjective questions: Write about your experience working in a team, where you were not the leader. What were your contributions? You have your final end semester examinations from next week, and you also have an interview with your dream company next week. What would you do? I could do the first two DP questions full and got most of the MCQs correct. 32 students were selected for the next round. Round 2: F2F Question: From every node, starting from the root, I can move to the next layer and to the corresponding connected nodes. Find the maximum sum of values that I can obtain from the root to the last layer. Solution: A bottom-up DP approach, starting from the last level, i.e., the leaves. Keep on adding the maximum value that we can take from a particular layer to the upward layer. Formula: particular node(level i)=Max(node1 it is connected to(level i+1), node2 it is connected to(level i+1)) Puzzles: https://www.geeksforgeeks.org/puzzle-25chessboard-and-dominos/ And another mathematical puzzle, which I have forgotten, but it is similar to the puzzles you will find on Geeksforgeeks. Try to solve as many puzzles as you can https://www.geeksforgeeks.org/puzzles/. More or less similarly modified puzzles will be asked. Round 3: F2F Coding questions: 1.Poisonous plants https://www.hackerrank.com/challenges/poisonous-plants/problem 2. Kth Smallest Element in a BST. Solution: https://www.geeksforgeeks.org/kth-smallest-element-in-bst-using-o1-extra-space/