Eckovation Interview Questions and Answers

Q1. Share details of your previous job.
Add your answer

Round duration - 90 mins
Round difficulty - Hard

There were questions related to DP and DFS.

 

Q1. 
Trapping Rain Water Problem Statement
You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...read more
Ans. 
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
• Iterate through the array and calculate the maximum height on the left and right of each bar.

• Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.

• Sum up the trapped water at each bar to get the total trapped water for the entire array.
Answered by AI
Add your answer

Round duration - 60 mins
Round difficulty - Medium

At first, I was asked about the different projects that I have done so far. We had a detailed discussion on the same.
He also checked my OOP concepts

Q1. Can you describe the process of designing an LRU Cache from scratch during your System Design Round?
Ans. 
Designing an LRU Cache involves implementing a data structure that stores a fixed number of items and removes the least recently used item when full.
• Start by defining the data structure for the cache, typically using a combination of a hashmap and a doubly linked list.

• Implement methods for getting and setting key-value pairs in the cache.

• When a new item is added to the cache, check if it exceeds the maximum capacity. I...read more
Answered by AI
Add your answer
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...read more
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
Answered by AI
Add your answer
Q3. 
Middle of a Linked List
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...read more
Ans. 
Return the middle element of a singly linked list, or the one farther from the head if there are even elements.
• Traverse the linked list with two pointers, one moving twice as fast as the other

• When the fast pointer reaches the end, the slow pointer will be at the middle

• If there are even elements, return the one that is farther from the head node

• Handle edge cases like linked list of size 1 or empty list
Answered by AI
Add your answer

Round duration - 60 mins
Round difficulty - Medium

It is HR + Technical round
asked about the Behavioural questions and how you justify yourself in an argument .questions related to current technology.
They gave me feedback on how well I had performed so far and gave me suggestions on what more can I do to further improve myself.

Q1. Minimum number of platforms required for train station
Ans. 
Minimum of two platforms are required for a train station.
• At least two platforms are needed for trains to arrive and depart simultaneously.

• Additional platforms may be required depending on the frequency of trains and passenger traffic.

• Platforms should be long enough to accommodate the longest trains that will use the station.
Answered by AI
Add your answer
Q2. Longest Palindromic substring
Ans. 
The problem is to find the longest substring that is a palindrome in a given string.
• A palindrome is a string that reads the same backward as forward.

• We can use dynamic programming to solve this problem.

• We can start by considering each character as the center of a palindrome and expand outwards to find the longest palindrome.

• We can also optimize the solution by using Manacher's algorithm which reduces the time complexit
Answered by AI
Add your answer

Q1. Sort the elements of an unsorted array
Ans. 
Use any sorting algorithm to sort the elements of an unsorted array.
• Choose an appropriate sorting algorithm based on the size of the array and the type of elements.

• Common sorting algorithms include bubble sort, insertion sort, selection sort, merge sort, quick sort, and heap sort.

• Implement the chosen algorithm in the programming language of your choice.

• Test the sorting function with various input arrays to ensure corre
Answered by AI
Add your answer
Q2. Minimum energy required to cross all the hurdles without loosing life. If any point energy becomes 0 game over. Input: [-2,-3,3,1,5]
Ans. 
Find minimum energy required to cross all hurdles without losing life.
• Calculate cumulative sum of energy required to cross each hurdle.

• Find the minimum cumulative sum and add 1 to it.

• If the minimum cumulative sum is negative, return its absolute value + 1.

• This is the minimum energy required to cross all hurdles without losing life.
Answered by AI
Add your answer