Inmobi

DSA Question Given an array of size N, where arr[i] represents the value associated with node i, an undirected edge exists between nodes i and j if the LCM of arr[i] and arr[j] is less than or equal to 1e6. The task was to find the total number of connected components in the resulting graph. Initially, I came up with an N square solution by checking every pair of nodes. The interviewer then asked me to optimize the approach to N logN. After a few hints from the interviewer, I was able to figure out the optimized approach and explain it. CV and Project Discussion After the DSA question, with around 20 minutes remaining, the interviewer shifted the discussion towards my resume and projects. Round2: CS Fundamentals The interviewer started with some fundamental questions related to: Operating Systems (OS) Object-Oriented Programming (OOPs) I was asked to implement a custom Min Heap from scratch. I implemented it using the standard array-based approach. The interviewer then gave me an LLD problem that required applying OOP concepts using classes and objects. The problem was based on designing a song management system with several requirements, including: Adding and removing songs. Finding the most frequently played song efficiently. Maintaining and updating the play counts of songs. Supporting multiple operations while ensuring optimal time complexity.