AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
i
Eternal
Limited
Work with us 
Compare
Filter interviews by
Eternal Limited Software Developer Intern Interview Questions and Answers
12 Interview questions
SQL query to find the X percentile of students
Use the NTILE() function to divide students into X groups
Calculate the total number of students and the number of students in each group
Select the students from the group that corresponds to the X percentile
Convert a Binary Tree to a Sum Tree
Given a binary tree of integers, convert the binary tree into a sum tree where each node's value is replaced by the sum of the values of its left and right subtrees in t...
Convert a binary tree into a sum tree where each node's value is replaced by the sum of its left and right subtrees.
Traverse the tree in postorder fashion to calculate the sum of left and right subtrees for each node.
Set leaf nodes to zero.
Update the node values with the sum of left and right subtrees.
Find All Pairs Adding Up to Target
Given an array of integers ARR of length N and an integer Target, your task is to return all pairs of elements such that they add up to the Target.
Input:
The first line c...Given an array of integers and a target, find all pairs of elements that add up to the target.
Iterate through the array and for each element, check if the complement (target - current element) exists in a hash set.
If the complement exists, add the pair to the result. If not, add the current element to the hash set.
Handle cases where the same element is used twice in a pair by keeping track of the frequency of elem...
Polymorphism is the ability of a function or method to behave differently based on the object it is called on.
Polymorphism allows objects of different classes to be treated as objects of a common superclass.
Real-time polymorphism is achieved through method overloading, where multiple methods have the same name but different parameters.
Run-time polymorphism is achieved through method overriding, where a subclass pr...
LFU Cache Design Problem
Design and implement a Least Frequently Used (LFU) Cache with the following functionalities:
1. put(U__ID, value): Insert the value in the cache if the key ('U__ID') is not alread...Design and implement a Least Frequently Used (LFU) Cache with put and get functionalities, handling capacity and frequency of use.
Implement a LFU cache with put and get functions
Handle capacity and frequency of use for eviction
Return the value of key if present, -1 otherwise
Consider multiple elements with least frequency, remove least recently used
Example: Insert, update, and retrieve values based on operations
Snake and Ladder Problem Statement
Given a Snake and Ladder Board with 'N' rows and 'N' columns filled with numbers from 1 to N*N starting from the bottom left of the board, and alternating direction each ...
Find the minimum number of dice throws required to reach the last cell on a Snake and Ladder board.
Use Breadth First Search (BFS) algorithm to find the shortest path on the board.
Create a mapping of each cell to its next possible moves based on dice outcomes.
Consider the snakes and ladders on the board while calculating the next possible moves.
Track the number of dice throws needed to reach each cell and update it...
Deletion In Doubly Linked List
You are given a Doubly Linked List with 'N' positive integers. Your task is to delete a node at a given position 'POS' in this linked list.
Input:
The first line of input s...Implement a function to delete a node at a given position in a Doubly Linked List.
Traverse to the node at the specified position in the Doubly Linked List.
Adjust the pointers of the previous and next nodes to remove the node at the specified position.
Update the pointers accordingly to maintain the integrity of the Doubly Linked List.
Handle edge cases such as deleting the head or tail node.
Ensure to free the memory...
Maximize the Sum Through Two Arrays
You are given two sorted arrays of distinct integers, ARR1 and ARR2. If there is a common element in both arrays, you can switch from one array to the other.
Your task ...
Given two sorted arrays, find the path through common elements for maximum sum.
Start with the array containing the smaller first common element
Switch arrays at common elements to maximize the sum
Continue adding elements until the end of the arrays
Reverse Doubly Linked List in Groups Problem
You are provided with a Doubly Linked List consisting of integers and a positive integer 'K', which represents the size of the group. Your task is to modify the...
Reverse groups of K nodes in a doubly linked list
Iterate through the linked list in groups of size K
Reverse each group of nodes
Handle cases where the number of remaining nodes is less than K
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in th...
Count the number of islands in a 2D matrix of 1s and 0s.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.
Maintain a visited array to keep track of visited cells to avoid redundant traversal.
Increment the island count each time a new island is encountered.
Consider all eight possible directions for connectivity between cells.
Handle edge cases such ...
Eternal Limited Software Developer Intern Interview Experiences
3 interviews found
Anonymous
I appeared for an interview in May 2022.
(2 Questions)
Round duration - 150 minutes
Round difficulty - Medium
The interview was scheduled at 6 pm and the duration of the interview was 1.5 hrs but went for around 2.5 hrs. The interviewer started with a brief intro about me. Asked me some coding questions. After coding questions he started asking questions on dbms like difference between sql and no sql, what is horizontal and vertical scaling and when we use them. Then some questions on computer networks like how web browsers works, different between http and HTTPS, what is TCP. After this he asked about my projects and the technology I worked on during the intern.
- Q1.
Snake and Ladder Problem Statement
Given a Snake and Ladder Board with 'N' rows and 'N' columns filled with numbers from 1 to N*N starting from the bottom left of the board, and alternating direction each...
- Ans.
Find the minimum number of dice throws required to reach the last cell on a Snake and Ladder board.
Use Breadth First Search (BFS) algorithm to find the shortest path on the board.
Create a mapping of each cell to its next possible moves based on dice outcomes.
Consider the snakes and ladders on the board while calculating the next possible moves.
Track the number of dice throws needed to reach each cell and update it as y...
- Q2.
Deletion In Doubly Linked List
You are given a Doubly Linked List with 'N' positive integers. Your task is to delete a node at a given position 'POS' in this linked list.
Input:
The first line of input ... - Ans.
Implement a function to delete a node at a given position in a Doubly Linked List.
Traverse to the node at the specified position in the Doubly Linked List.
Adjust the pointers of the previous and next nodes to remove the node at the specified position.
Update the pointers accordingly to maintain the integrity of the Doubly Linked List.
Handle edge cases such as deleting the head or tail node.
Ensure to free the memory of t...
Round duration - 20 minutes
Round difficulty - Easy
Interview Preparation Tips
Tip 1 : Study all the concepts of dbms and cn deeply
Tip 2 : Zomato focus on development, so you have to do some good projects or should have previous internship experience.
Tip 1 : Have good Projects
Tip 2 : Study all the topics deeply that u mentioned in your resume.
Skills evaluated in this interview
I appeared for an interview in Aug 2021.
(5 Questions)
Round duration - 90 minutes
Round difficulty - Medium
The interview started in the evening on google meet. and extended for 90 minutes. The interviewer was very helpful and he shared a collaborative code editor to discuss several problems.
- Q1.
Find All Pairs Adding Up to Target
Given an array of integers
ARRof lengthNand an integerTarget, your task is to return all pairs of elements such that they add up to theTarget.Input:
The first line ... - Ans.
Given an array of integers and a target, find all pairs of elements that add up to the target.
Iterate through the array and for each element, check if the complement (target - current element) exists in a hash set.
If the complement exists, add the pair to the result. If not, add the current element to the hash set.
Handle cases where the same element is used twice in a pair by keeping track of the frequency of elements.
...
- Q2.
Convert a Binary Tree to a Sum Tree
Given a binary tree of integers, convert the binary tree into a sum tree where each node's value is replaced by the sum of the values of its left and right subtrees in ...
- Ans.
Convert a binary tree into a sum tree where each node's value is replaced by the sum of its left and right subtrees.
Traverse the tree in postorder fashion to calculate the sum of left and right subtrees for each node.
Set leaf nodes to zero.
Update the node values with the sum of left and right subtrees.
- Q3.
LFU Cache Design Problem
Design and implement a Least Frequently Used (LFU) Cache with the following functionalities:
1. put(U__ID, value): Insert the value in the cache if the key ('U__ID') is not alrea... - Ans.
Design and implement a Least Frequently Used (LFU) Cache with put and get functionalities, handling capacity and frequency of use.
Implement a LFU cache with put and get functions
Handle capacity and frequency of use for eviction
Return the value of key if present, -1 otherwise
Consider multiple elements with least frequency, remove least recently used
Example: Insert, update, and retrieve values based on operations
- Q4. Write a SQL query to find the X percentile of students.
- Ans.
SQL query to find the X percentile of students
Use the NTILE() function to divide students into X groups
Calculate the total number of students and the number of students in each group
Select the students from the group that corresponds to the X percentile
- Q5. Can you explain polymorphism and provide examples of real-time and run-time polymorphism?
- Ans.
Polymorphism is the ability of a function or method to behave differently based on the object it is called on.
Polymorphism allows objects of different classes to be treated as objects of a common superclass.
Real-time polymorphism is achieved through method overloading, where multiple methods have the same name but different parameters.
Run-time polymorphism is achieved through method overriding, where a subclass provide...
Interview Preparation Tips
Tip 1 : Practice at-least 300 problems.
Tip 2 : Add at-least 2 projects and prepare them well for the interview.
Tip 3 : Practice mock interviews with your friends to learn how to explain problems.
Tip 1 : Follow some standard resume format and add 2-3 projects with explanations in point, also include technologies used in the project.
Tip 2 : Make sure you add all the technologies you are aware of in your resume and also, add links to competitive profiles (if you have good coding profiles).
Tip 3 : Add your achievements in the resume in points.
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Easy
The overall interview experience was quite smooth and the interviewers were very kind.
I was asked 2 coding questions.
- Q1.
Reverse Doubly Linked List in Groups Problem
You are provided with a Doubly Linked List consisting of integers and a positive integer 'K', which represents the size of the group. Your task is to modify th...
- Ans.
Reverse groups of K nodes in a doubly linked list
Iterate through the linked list in groups of size K
Reverse each group of nodes
Handle cases where the number of remaining nodes is less than K
- Q2.
Largest Rectangle in Histogram Problem Statement
You are given an array/list
...HEIGHTSof lengthN, where each element represents the height of a histogram bar. The width of each bar is considered to be 1. - Ans.
Calculate the area of the largest rectangle that can be formed within the bounds of a given histogram.
Iterate through the histogram bars and maintain a stack to keep track of increasing heights.
Calculate the area of the rectangle formed by each bar as the smallest height in the stack multiplied by the width.
Update the maximum area found so far and return it as the result.
(3 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
3 coding questions were asked and 1 on system design.
- Q1.
Maximize the Sum Through Two Arrays
You are given two sorted arrays of distinct integers,
ARR1andARR2. If there is a common element in both arrays, you can switch from one array to the other.Your task...
- Ans.
Given two sorted arrays, find the path through common elements for maximum sum.
Start with the array containing the smaller first common element
Switch arrays at common elements to maximize the sum
Continue adding elements until the end of the arrays
- Q2.
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having
Nrows andMcolumns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t... - Ans.
Count the number of islands in a 2D matrix of 1s and 0s.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.
Maintain a visited array to keep track of visited cells to avoid redundant traversal.
Increment the island count each time a new island is encountered.
Consider all eight possible directions for connectivity between cells.
Handle edge cases such as bo...
- Q3. How would you design Instagram?
- Ans.
Designing Instagram involves creating a user-friendly platform for sharing photos and videos with social networking features.
Focus on a clean and intuitive user interface for easy navigation
Implement features like photo filters, stories, direct messaging, and explore page
Incorporate algorithms for personalized content recommendations
Ensure robust security measures for user data protection
Integrate advertising options f...
Round duration - 15 Minutes
Round difficulty - Medium
Interview Preparation Tips
Tip 1 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 2 : Revise Computer Science subjects like DBMS, OOPS etc
Tip 3 : Confidence is a key of success
Tip 1 : Mention those things which your confident about
Tip 2 : Add projects and Internships
Skills evaluated in this interview
What people are saying about Eternal Limited
Interview questions from similar companies
I appeared for an interview before Dec 2015.
Interview Questionnaire
2 Questions
- Q1. 1 question from basic data structures and algorithms The question was similar to the one in the given link- -----/
- Q2. Why do you want to join the company?
- Ans.
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...
Interview Preparation Tips
Experience: Resumes were shortlisted with a short aptitude round where we are asked basic questions about databases, basic programming(C and C ++ questions)
Round: Technical Interview
Experience: The questions were asked were simple - related to arrays and data structures. Some questions were asked regarding my resume and projects.
Tips: Be thorough with geeksForGeeks, and your projects.
Round: HR Interview
Experience: I told him how I found the story of the founder of Infoedge very inspiring.
Tips: This round should be more simpler , be prepared with why you want to join the company and general HR questions
Skills: Basic C/C++, Programming Skills In Any Language Like C
College Name: IIIT Allahabad
Interview Preparation Tips
Experience: Ques will be based on arrays( duplicate element, missing element in 1 to n array), link list(reverse, remove loop, middle node etc), Hashing, sql join, normalisation, indexing in sql, singlton pattern and sorting and searching.
Tips: Focus will remain on algorithms. Whatever program they will ask to write, they will also ask to optimize the solution.
Skill Tips: Puzzle on mislabled jar, odd weight ball. As I had exp in Java, so some more que on Java, java script and web technology. All you need in interview is to be confident and show your interest in web domain.
Skills: Java, Data structure, Algorithm
College Name: NA
I appeared for an interview before Jan 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Two coding questions were given in the first round to be solved in 60 minutes.
- Q1.
Rearrange Array Elements Problem Statement
Given an array
Acontaining 'N' integers and an integerm, rearrange the elements of the array such that the differences between the array elements andmare sor... - Ans.
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.
- Q2.
Print Nodes at Distance K from a Given Node
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...
- Ans.
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
(4 Questions)
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions based on DSA, DBMS, Computer Networking and project based questions.
- Q1.
Triangle of Numbers Pattern
Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.
Example:
Input:
N = 4
Output:
1
232
34545
4567654Explanation:
The pat...
- Ans.
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
- Q2. What is the difference between a web server and an application server?
- Ans.
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...
- Q3. How does the internet work?
- Ans.
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...
- Q4. Write a SQL query to find the nth highest salary.
- Ans.
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.
Interview Preparation Tips
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.
Skills evaluated in this interview
I appeared for an interview before Dec 2020.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.
- Q1.
Binary Tree Traversals Problem Statement
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
- Ans.
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.
Use level-order input to construct the Binary Tree.
Traverse the Binary Tree recursively to generate the required traversals.
Ensure proper handling of null nodes represented by -1 in the input.
Return the three traversals as ...
- Q2.
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege... - Ans.
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
(1 Question)
Round duration - 45 Minutes
Round difficulty - Medium
This round basically tested some concepts from Data Structures and File Manipulation .
- Q1.
Intersection of Two Arrays Problem Statement
Given two arrays
AandBwith sizesNandMrespectively, both sorted in non-decreasing order, determine their intersection.The intersection of two arrays in...
- Ans.
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal and update the intersection array.
Return the intersection array as the result.
Interview Preparation Tips
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.
Skills evaluated in this interview
I applied via Referral
Interview Questionnaire
6 Questions
- Q1. Design the most optimal data structures for an LRU cache
- Ans.
Design optimal data structures for LRU cache
Use a doubly linked list to keep track of recently used items
Use a hash table to store key-value pairs for quick access
When an item is accessed, move it to the front of the linked list
When the cache is full, remove the least recently used item from the back of the linked list and hash table
- Q2. Convert a sorted array to balanced binary search tree
- Ans.
Convert a sorted array to balanced binary search tree
Find the middle element of the array and make it the root of the tree
Recursively construct the left subtree using the left half of the array
Recursively construct the right subtree using the right half of the array
Repeat until all elements are added to the tree
- Q3. Reverse a singly linked list in groups of k inplace
- Ans.
Reverse a singly linked list in groups of k inplace
Divide the linked list into groups of k nodes
Reverse each group of k nodes
Connect the reversed groups to form the final linked list
- Q4. Design the most optimal data structure for storing a word and its meaning. Note that a word could have multiple meanings
- Q5. Write a recursive routine to calculate a ^ n
- Ans.
A recursive routine to calculate a ^ n
The base case is when n is 0, in which case the result is 1
For any other value of n, the result is a multiplied by the result of a^(n-1)
The recursive function should call itself with a^(n-1) as the new input
- Q6. Design the most optimal data structure for a never ending stream of numbers. It should be optimized for insertion, deletion, searching, finding kth largest and kth smallest
- Ans.
Design optimal data structure for never-ending stream of numbers for insertion, deletion, searching, kth largest and kth smallest.
Use a balanced binary search tree like AVL or Red-Black tree for efficient insertion, deletion, and searching.
Maintain two heaps, one for kth largest and one for kth smallest.
For finding kth largest, use a min heap of size k and for kth smallest, use a max heap of size k.
Alternatively, use a...
Interview Preparation Tips
College Name: NA
Skills evaluated in this interview
Interview Preparation Tips
College Name: IIT Patna
Interview Preparation Tips
Duration: 2 hours
Total Questions: 22
College Name: Jaypee University Of Information Technology, Solan
Tell us how to improve this page.
Eternal Limited Interviews By Designations
- Eternal Limited Key Account Manager Interview Questions
- Eternal Limited Delivery Boy Interview Questions
- Eternal Limited Customer Service Executive Interview Questions
- Eternal Limited Business Analyst Interview Questions
- Eternal Limited Chat Support Executive Interview Questions
- Eternal Limited Associate Interview Questions
- Eternal Limited Software Developer Interview Questions
- Eternal Limited Customer Support Executive Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Software Engineer Interview Questions
- Java Developer Interview Questions
- Front end Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Salesforce Developer Interview Questions
- Software Development Engineer Interview Questions
- Show more
Software Developer Intern Interview Questions from Similar Companies
Eternal Limited Software Developer Intern Reviews and Ratings
based on 2 reviews
Rating in categories
|
Key Account Manager
1k
salaries
|  ₹4.5 L/yr - ₹16 L/yr |
|
Delivery Boy
910
salaries
| ₹0.4 L/yr - ₹5.4 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
285
salaries
| ₹3 L/yr - ₹11.5 L/yr |
Swiggy
Amazon
Dunzo
Flipkart
- Home >
- Interviews >
- Eternal Limited Interview Questions
