Job Designation: Software Engineer\nCTC: 19 LPA\n I\'m a final year undergraduate at a Tier 2 engineering college\n\n**Round 1 - 120 mins**\nCoding Round was conducted on Hackerrank platform. There were 4 questions, one based on heap, one math, one tree(a variation of max sum path), and one SQL query.\nSolved 2 fully, and 2 partially.\n37 were selected for the next round\n\n**Round 2 (Technical Interview) - 45 mins**\n\nIt started with an introduction. He asked me to solve 3 coding questions on Codebunk platform.\n\n- The first was to find a cycle in a linked list. - https://leetcode.com/problems/linked-list-cycle/\n- Second Implement a stack in C++\n- Third to merge 2 sorted arrays \n\nHe asked me a few questions regarding my project in web development and asked how I would integrate Ads into my website. I mentioned Google AdSense, he asked how google AdSense works, and how cookies work.\n\n**Round 3 (Technical Interview 2) - 45 mins**\n\nIt started with an introduction again. The interviewer was interested in one of my flutter projects and asked me a few questions based on that Project. Then he asked me to explain all the process scheduling algorithms and the pros and cons of each of the algorithms, and asked me which is the most optimal algorithm. And then gave a problem on Round Robin Algorithm.\nIn CN, he asked me about HTTP vs HTTPS, the OSI model, different protocols, why HTTP is in the Application layer, Switches, Routers, and How a packet is transmitted.\nIn DBMS, he asked about Indexing and how I can optimize a database. I mentioned sharding and normalization. He wasn\'t satisfied with my answer. Then I said if the ids are sorted, I can do a binary search. Then he moved on to searching and sorting algorithms.\nHe asked me about the different sorting algorithms and asked me to explain Bubble sort and Merge Sort, and their time complexities. Then asked me how binary search works, and the 2 ways to calculate mid.\n\nThen he asked me about few questions on OOPs with real-life examples, and about operator overloading.\n\nOne coding question on balancing paranthesis on codebunk platform. \nhttps://leetcode.com/problems/valid-parentheses/\n\n**Round 4 (HM Round): 30 mins**\n\nStarted with each other\'s introduction, and a casual talk. He asked me a few questions from my resume regarding my projects, hackathons, CTFs, Coding Contests, and The technical club that I\'m a part of. Then he asked me about B+ trees (couldn\'t answer). Then he asked me the various factors I should consider before releasing one of my apps as a product. He asked some more HR questions and asked if I have any questions for him.\n\n3 of them were selected, I was one among them.\n\n**Verdict: Selected**

Job Designation: Software Engineer\nCTC: 19 LPA\n I\'m a final year undergraduate at a Tier 2 engineering college\n\nRound 1 - 120 mins\nCoding Round was conduc