i
Eternal
Limited
Work with us
Filter interviews by
Regex for email validation
Start with a string of characters followed by @ symbol
Followed by a string of characters and a period
End with a string of characters with a length of 2-6 characters
Allow for optional subdomains separated by periods
Disallow special characters except for . and _ in username
Find angle between hour and minute hand in a clock given the time.
Calculate the angle made by the hour hand with respect to 12 o'clock position
Calculate the angle made by the minute hand with respect to 12 o'clock position
Find the difference between the two angles and take the absolute value
If the angle is greater than 180 degrees, subtract it from 360 degrees to get the smaller angle
To un-hash a string, use a reverse algorithm to convert the hash back to the original string.
Create a reverse algorithm that takes the hash as input and outputs the original string
Use the same logic as the hash function but in reverse order
If the hash function used a specific algorithm, use the inverse of that algorithm to un-hash the string
Print prime numbers in a given range and optimize the solution.
Use Sieve of Eratosthenes algorithm to generate prime numbers efficiently
Start with a boolean array of size n+1, mark all as true
Loop through the array and mark all multiples of each prime as false
Print all the indexes that are still marked as true
Find the sum of kth to bth largest numbers in a huge array efficiently.
Sort the array in descending order to easily find the kth and bth largest numbers.
Use a priority queue or min heap to efficiently find the kth and bth largest numbers without sorting the entire array.
Once you have the kth and bth largest numbers, iterate through the array and sum the numbers between them.
Two software development questions: bitwise OR of array subsequences and course schedule II.
Question 1 requires finding the bitwise OR of the sum of all subsequences of an array.
Question 2 is a LeetCode question about scheduling courses with prerequisites.
For question 1, we can use dynamic programming to find all subsequences and then calculate the bitwise OR.
For question 2, we can use a topological sort to determ...
You are given a binary tree consisting of 'N' unique nodes and a start node where the burning will commence. The task is to calculate the time in minutes required to completely bu...
Calculate the time in minutes required to completely burn a binary tree starting from a given node.
Perform a depth-first search (DFS) to calculate the time taken to burn the entire tree.
Track the time taken to burn each node based on its distance from the starting node.
Consider the maximum time taken among all nodes as the total time to burn the entire tree.
Find the sum of kth to bth largest numbers in a huge array efficiently.
Sort the array in descending order to easily find the kth and bth largest numbers.
Use a priority queue or min heap to efficiently find the kth and bth largest numbers without sorting the entire array.
Once you have the kth and bth largest numbers, iterate through the array and sum the numbers between them.
I applied via Campus Placement and was interviewed in Oct 2024. There was 1 interview round.
1.5 hours Coding Round conducted on HackerRank.
I applied via Referral and was interviewed in Jul 2024. There were 2 interview rounds.
Genric aptitude questions also computer fundamentals like dbms
DP questions, tree questions r there
I applied via Referral and was interviewed before Nov 2021. There were 3 interview rounds.
Coding test was of 1:30 hour. Topic : Data structure and Algorithms, Platform : intervue.io
Two software development questions: bitwise OR of array subsequences and course schedule II.
Question 1 requires finding the bitwise OR of the sum of all subsequences of an array.
Question 2 is a LeetCode question about scheduling courses with prerequisites.
For question 1, we can use dynamic programming to find all subsequences and then calculate the bitwise OR.
For question 2, we can use a topological sort to determine t...
I appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Medium
Medium level competitive programming question. Interviewer looked for the approach and working code.
You are given a binary tree consisting of 'N' unique nodes and a start node where the burning will commence. The task is to calculate the time in minutes required to completely b...
Calculate the time in minutes required to completely burn a binary tree starting from a given node.
Perform a depth-first search (DFS) to calculate the time taken to burn the entire tree.
Track the time taken to burn each node based on its distance from the starting node.
Consider the maximum time taken among all nodes as the total time to burn the entire tree.
Round duration - 40 minutes
Round difficulty - Medium
Timing : Evening
Interviewer was frank. He checked for indepth knowledge of the subject.
Tip 1 : Leave a subject to prepare, but never leave a topic.
Tip 2 : Must go through previous years questions / interview experiences.
Tip 3 : Atleast 4 projects in CV
Tip 1 : At least 4 projects (working)
Tip 2 : Never put false things on resume.
I applied via Campus Placement
Print prime numbers in a given range and optimize the solution.
Use Sieve of Eratosthenes algorithm to generate prime numbers efficiently
Start with a boolean array of size n+1, mark all as true
Loop through the array and mark all multiples of each prime as false
Print all the indexes that are still marked as true
Find angle between hour and minute hand in a clock given the time.
Calculate the angle made by the hour hand with respect to 12 o'clock position
Calculate the angle made by the minute hand with respect to 12 o'clock position
Find the difference between the two angles and take the absolute value
If the angle is greater than 180 degrees, subtract it from 360 degrees to get the smaller angle
To un-hash a string, use a reverse algorithm to convert the hash back to the original string.
Create a reverse algorithm that takes the hash as input and outputs the original string
Use the same logic as the hash function but in reverse order
If the hash function used a specific algorithm, use the inverse of that algorithm to un-hash the string
What people are saying about Eternal Limited
I appeared for an interview before Dec 2015.
I am excited to join the company because of its reputation for innovation and commitment to employee growth.
I am impressed by the company's track record of developing cutting-edge software solutions.
I appreciate the company's focus on fostering a culture of learning and development.
I am excited about the opportunity to work with a talented team of developers and contribute to the company's success.
I believe that the co...
I appeared for an interview before Jan 2021.
Round duration - 60 minutes
Round difficulty - Easy
Two coding questions were given in the first round to be solved in 60 minutes.
Given an array A
containing 'N' integers and an integer m
, rearrange the elements of the array such that the differences between the array elements and m
are sor...
Rearrange array elements based on their differences from a given integer.
Calculate the differences between each element and the given integer.
Sort the elements based on their differences while maintaining the original order for elements with the same difference.
Implement a function to rearrange the array elements as per the given criteria.
Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...
The task is to find all nodes in a binary tree that are at a distance K from a given node.
Traverse the binary tree to find the given node
From the given node, perform a depth-first search to find all nodes at distance K
Use a list to store the values of the nodes at distance K
Return the list of values in any order
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions based on DSA, DBMS, Computer Networking and project based questions.
Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.
N = 4
1
232
34545
4567654
The pat...
Print a triangle pattern of numbers based on a given number 'N'.
Iterate through each row and print the numbers accordingly
Use spaces to center-align the numbers in each row
Increment the numbers in each row as per the pattern
Web server serves static content over HTTP, while application server runs dynamic content and business logic.
Web server handles HTTP requests and responses, serving static content like HTML, images, and CSS.
Application server executes business logic, runs dynamic content, and interacts with databases.
Web server examples include Apache, Nginx, while application server examples include Tomcat, JBoss.
Web server focuses on...
The internet is a global network of interconnected computers that communicate using standardized protocols.
The internet is made up of a vast number of interconnected networks of computers.
Data is transmitted over the internet using protocols such as TCP/IP.
Websites are hosted on servers connected to the internet, and users access them using web browsers.
Internet Service Providers (ISPs) provide access to the internet f...
SQL query to find the nth highest salary
Use the 'SELECT DISTINCT' statement to get unique salary values
Order the salaries in descending order using 'ORDER BY' clause
Use 'LIMIT' and 'OFFSET' to get the nth highest salary
Round duration - 30 minutes
Round difficulty - Easy
Typical HR round with behavioral problems.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Some of the top questions asked at the Eternal Limited Software Developer interview -
based on 5 interview experiences
Difficulty level
Duration
based on 9 reviews
Rating in categories
Delivery Boy
1k
salaries
| ₹1.7 L/yr - ₹4 L/yr |
Key Account Manager
1k
salaries
| ₹6 L/yr - ₹14 L/yr |
Business Analyst
531
salaries
| ₹6.5 L/yr - ₹18.5 L/yr |
Accounts Manager
328
salaries
| ₹4 L/yr - ₹12.1 L/yr |
Senior Associate
287
salaries
| ₹3 L/yr - ₹11.6 L/yr |
Swiggy
Amazon
Dunzo
Flipkart