Eternal Limited OA Experience
Summary
I took the Eternal Limited online assessment which included 12 multiple‑choice questions and 2 coding problems covering topics such as DBMS, operating systems, sorting, and greedy algorithms.
Full Experience
I recently appeared for the Eternal Limited Online Assessment. It consisted of 12 MCQs and 2 coding questions.
MCQ Section
The MCQs covered aptitude, programming fundamentals and core computer science subjects.
Topics included:
DBMS and SQL: These formed the majority of the technical MCQs. Operating Systems LRU Page Replacement: Around two questions were based on LRU paging. Aptitude questions Bubble Sort: One question asked for the number of swaps required to sort a given array. Output-based programming questions A few other questions were present, but I do not remember their exact topics.
Overall, the MCQ section was of easy-to-medium difficulty.
Coding Question 1: Rearranging Songs Using Heap/Priority Queue
We were given a 2D array containing information about authors and their songs.
The songs had to be rearranged such that:
No two consecutive songs belonged to the same author. The rearrangement was based on the number of songs belonging to each author.
This problem could be solved using a max heap or priority queue.
The idea was to store each author along with their remaining number of songs in a max heap. After selecting an author, that author could be temporarily kept outside the heap so that the same author was not selected consecutively.
The problem was similar to Reorganize String or Task Scheduler.
Coding Question 2: Maximum Production Within maxPower
We were given n machines. For the i-th machine, its power requirement and the quantity produced by it were provided.
We were also given a value maxPower.
The task was to:
Sort the machines according to their power requirements. Select the machines in increasing order of power. Keep adding their power requirements while the total power did not exceed maxPower. Add the corresponding quantities to calculate the maximum total quantity produced.
This was a basic sorting and greedy problem.
Hope this helps
Interview Questions (2)
Rearrange Songs to Avoid Consecutive Same Author
Given a 2D array where each entry contains an author and one of their songs, rearrange the songs so that no two consecutive songs are from the same author. The rearrangement should prioritize authors with more remaining songs. A max‑heap (priority queue) can be used to always select the author with the highest remaining count, temporarily holding the previously used author out of the heap until the next selection.
Maximize Production Within Power Limit
Given n machines, each with a power requirement and a quantity produced, and a maximum total power limit (maxPower), select a subset of machines to maximize the total quantity produced without exceeding maxPower. The approach is to sort machines by power requirement, then iterate, adding machines while the cumulative power stays within the limit, summing their quantities.