Eat Repeat India Pvt Ltd Head Office SDE-2 Interview Questions and Answers

Round duration - 180 minutes
Round difficulty - Hard

Timing: 8 a.m. to 11a.m.
Environment was optimum.
No significant activity.

Q1. 
Edit Distance Problem Statement
Given two strings S and T with lengths N and M respectively, your task is to find the "Edit Distance" between these strings.
The Edit Distance is defined as the minimum nu...read more
Ans. 
The task is to find the minimum number of operations required to convert one string into another using delete, replace, and insert operations.
• Use dynamic programming to solve the problem efficiently.

• Create a 2D array to store the minimum edit distance for substrings of the two input strings.

• Iterate through the strings and update the array based on the operations needed for each character.

• Return the value in the bottom ...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

Timing: 12:00 p.m. to 12:30 p.m.
The environment was quite good.
No significant activity.
Interviewers were very friendly. They were behaving like friends.

Round duration - 15 minutes
Round difficulty - Easy

Timing: 3:00 p.m. to 3:20 p.m.
Environment was very good.
No significant activity was monitored.
HR was very good and friendly.

Round duration - 30 minutes
Round difficulty - Medium

Q1. 
Remove Consecutive Duplicates Problem Statement
Given a string S, your task is to recursively remove all consecutive duplicate characters from the string.
Input:
String S
Output:
Output string
Constr...read more
Ans. 
Recursively remove consecutive duplicate characters from a string.
• Use recursion to check if the current character is the same as the next character, if so, skip the next character

• Base case: if the string is empty or has only one character, return the string

• Recursive case: if the current character is the same as the next character, call the function recursively with the string excluding the next character
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Q1. 
Reverse String Operations Problem Statement
You are provided with a string S and an array of integers A of size M. Your task is to perform M operations on the string as specified by the indices in array A...read more
Ans. 
Perform a series of reverse string operations on a given string based on specified indices.
• Iterate through the array of indices and reverse the substring of the string based on the given indices.

• Ensure to reverse the substring from the starting index to len(S) - starting index - 1.

• Continue the operations in the sequence specified by the array of indices to get the final string.
Answered by AI
View 1 more answer

Round duration - 50 minutes
Round difficulty - Medium

Round duration - 60 minutes
Round difficulty - Easy

It is online round and it was conducted around 11 AM on campus. Difficulty was medium. 2 coding questions were asked. One question is based on arrays(easy) and the other question is based on usage of oops concepts like Inheritance, polymorphism. Everything went smooth.

Q1. 
Subarray With Given Sum Problem Statement
Given an array ARR of N integers and an integer S, determine if there exists a contiguous subarray within the array with a sum equal to S. If such a subarray exis...read more
Ans. 
Given an array of integers, find a subarray with a given sum S.
• Use a sliding window approach to find the subarray with the given sum.

• Keep track of the current sum and adjust the window based on the sum.

• Return the start and end indices of the subarray if found, otherwise return [-1, -1].
Answered by AI
View 1 more answer

Round duration - 50 minutes
Round difficulty - Medium

Round started with self introduction and discussion of project. Everything went fine.
Note: we didn't have hr round due to time constraint. You can expect hr round.

Q1. 
Find the Duplicate Number Problem Statement
Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there is one number that appears twice. Yo...read more
Ans. 
Find the duplicate number in an array of integers from 0 to (N-2).
• Iterate through the array and keep track of the frequency of each number using a hashmap.

• Return the number with a frequency greater than 1 as the duplicate number.
Answered by AI
View 1 more answer
Q2. Can you explain the concept of normalization and its types?
Ans. 
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.
• Normalization is used to eliminate data redundancy and ensure data integrity in a database.

• There are different normal forms such as 1NF, 2NF, 3NF, BCNF, and 4NF.

• Each normal form has specific rules that must be followed to ensure data is properly organized.

• Normalization helps in reducing data anomalies and incon...read more
Answered by AI
View 1 more answer
Q3. Can you explain the ACID properties in the context of database management systems?
Ans. 
ACID properties are essential characteristics of a transaction in a database management system.
• Atomicity ensures that either all operations in a transaction are completed successfully or none of them are.

• Consistency ensures that the database remains in a valid state before and after the transaction.

• Isolation ensures that the execution of multiple transactions concurrently does not interfere with each other.

• Durability e...read more
Answered by AI
View 1 more answer
Q4. Can you explain the concepts of Object-Oriented Programming (OOP) with real-life examples?
Ans. 
OOP is a programming paradigm based on the concept of objects, which can contain data and code to manipulate that data.
• OOP focuses on creating objects that interact with each other to solve complex problems.

• Encapsulation: Objects can hide their internal state and require interactions through well-defined interfaces. Example: A car object with methods like start(), stop(), accelerate().

• Inheritance: Objects can inherit a...read more
Answered by AI
View 1 more answer

Round duration - 60 Minutes
Round difficulty - Medium

Timing: 10AM-11AM
Interviewer was quite supportive and helpful.
Environment was normal as usual and it was morning time

Round duration - 60 Minutes
Round difficulty - Medium

Timing: 11AM-12PM
The interviewer was SDE2
He was checking the code for edge cases and was hinting if required

Q1. 
Implementing a Priority Queue Using Heap
Ninja has been tasked with implementing a priority queue using a heap data structure. However, he is currently busy preparing for a tournament and has requested yo...read more
Ans. 
Implement a priority queue using a heap data structure with push, pop, getMaxElement, and isEmpty functions.
• Implement a priority queue using a max heap data structure.

• Use the provided class structure and complete the push, pop, getMaxElement, and isEmpty functions.

• For push operation, insert the element into the heap and maintain the heap property.

• For pop operation, remove the largest element from the heap.

• For getMaxEle...read more
Answered by AI
Add your answer
Q2. 
Ninja and the Bulbs Challenge
Ninja owns an electronic shop and possesses 'N' bulbs. To verify the quality of the bulbs, Ninja performs a unique technique. After 'N' rounds of this process, bulbs that rem...read more
Ans. 
Determine the number of good quality bulbs remaining after 'N' rounds of a unique technique.
• Start with all bulbs on in the first round

• Toggle every 'i' bulb in 'i' round

• Count the bulbs that remain on after 'N' rounds
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Timing: 6PM-7PM
The interviewer was not interactive and didn't gave any feedback whatsoever.
It was Hiring Manager Round
Interviewer was Software Development Manager at Amazon

Q1. 
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...read more
Ans. 
Find the maximum sum by traversing through common elements in two sorted arrays.
• 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
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

This round was scheduled in the evening hours and all the participants were required to fill a form which was shared 15 minutes prior to the start of the online coding round. This form was filled out probably for the security reasons and to ensure that no one disinterested participant gives the test.

Q1. 
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...read more
Ans. 
The task is to find the total number of ways to make change for a specified value using given denominations.
• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to store the number of ways to make change for each value using different denominations.

• Iterate through each denomination and update the array based on the number of ways to make change for each value.

• Return the value at the last cell of
Answered by AI
Add your answer
Q2. 
Validate Binary Search Tree (BST)
You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).
BST Definition:
A Binary Search Tr...read more
Ans. 
Validate if a given binary tree is a Binary Search Tree (BST) or not.
• Check if the left subtree of a node contains only nodes with data less than the node's data

• Check if the right subtree of a node contains only nodes with data greater than the node's data

• Recursively check if both left and right subtrees are also binary search trees
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Hard

This round was on call where I was just supposed to answer the tech questions that were asked. It started with a brief interview with one another and then moved to questions on DBMS, operating systems, computer networks and all. Almost 20-25 questions were asked and I probably answered 90% of them correctly.

Q1. 
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

Round duration - 30 minutes
Round difficulty - Hard

There was only one interviewer for this round. He continuously interacted with me and was giving me some good situational problems that were not very easy to answer. Basically those were open-minded questions which can be answered oth ways and that's why I found it quiet hard as per my nature but at the end things went well for me.

Round duration - 60 mins
Round difficulty - Medium

3 Questions were asked : 2- Trees and 1- Stack.
Interviewer was not receptive at all, I think this was a stress interview.

Q1. 
Validate Binary Search Tree Problem Statement
Given a binary tree with 'N' nodes, determine if it is a Binary Search Tree (BST). Return true if the tree is a BST, otherwise return false.
Example:
Input:
...read more
Ans. 
Validate if a given binary tree is a Binary Search Tree (BST) or not.
• Check if the left subtree of a node contains only nodes with values less than the node's value.

• Check if the right subtree of a node contains only nodes with values greater than the node's value.

• Ensure that both the left and right subtrees are also binary search trees.

• Traverse the tree in-order and check if the elements are in sorted order.

• Use a recurs...read more
Answered by AI
Add your answer
Q2. 
Binary Tree Conversion to Greater Tree
Given a binary tree with 'N' nodes, transform it into a Greater Tree. In this transformation, each node's value should be updated to the sum of its original value and...read more
Ans. 
Convert a binary tree into a Greater Tree by updating each node's value to the sum of its original value and the values of all nodes greater than or equal to it.
• Traverse the tree in reverse inorder (right, root, left) to update the nodes' values.

• Keep track of the sum of nodes visited so far to update each node's value.

• Recursively update the node's value by adding the sum of greater nodes to it.
Answered by AI
Add your answer
Q3. 
Check for Valid Parentheses
You are given a string STR containing only the characters "{", "}", "(", ")", "[", and "]". Your task is to determine if the parentheses in the string are balanced.
Input:
Th...read more
Ans. 
Check if the given string containing only parentheses is balanced or not.
• Use a stack to keep track of opening parentheses.

• Iterate through the string and push opening parentheses onto the stack.

• When a closing parenthesis is encountered, pop from the stack and check if it matches the corresponding opening parenthesis.

• If at the end the stack is empty, return 'YES' else return 'NO'.
Answered by AI
Add your answer

Round duration - 60 mins
Round difficulty - Hard

2 Coding Questions were asked, both were of Medium to Hard Difficulty.

Q1. 
Flatten Multi-Level Linked List
You are given a multi-level linked list containing 'N' nodes. Each node has 'next' and 'child' pointers that may or may not point to other nodes. Your task is to flatten th...read more
Ans. 
Flatten a multi-level linked list into a single linked list by rearranging the pointers.
• Traverse the linked list and whenever a node has a child, flatten the child list and append it after the current node.

• Update the 'next' and 'child' pointers accordingly while flattening the list.

• Continue this process until all nodes are rearranged into a single linked list.
Answered by AI
Add your answer
Q2. 
Rain Water Trapping Problem Statement
Given an array/list ARR of size N, representing an elevation map where each element ARR[i] denotes the elevation of the i-th bar. Your task is to calculate and print ...read more
Ans. 
Calculate the total amount of rainwater that can be trapped between given elevations in an elevation map.
• Use two-pointer approach to keep track of left and right boundaries.

• Calculate the trapped water by finding the minimum of left_max and right_max for each bar.

• Subtract the current bar's height from the minimum of left_max and right_max to get the trapped water.

• Keep updating the left_max and right_max as you iterate t
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Timing : It was late night.
How the interviewer was? He was very tired and I had to lead the discussion.
1 System Design Question was asked, had to provide - HLD, LLD, APIs.

Round duration - 60 minutes
Round difficulty - Medium

Timing : Afternoon
How was the environment? Home
Interviewer : Hiring Manager

Q1. Hiring Manager Discussion
Discussed about past Projects, challenges faced, disagreements with manager, why looking for job switch,  leadership principle questions were asked.
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Timing - Afternoon
How was the environment? Home
How the interviewer was? Very Helpful Interviewer
Bar raiser Round - Coding + System Design + Leadership principle

Round duration - 30 minutes
Round difficulty - Medium

It was in the morning about 10:00AM-10:40AM. The platform used for this round was hackerrank. There are 15 MCQ's which cover portions of Aptitude, Data Structures, DBMS, SQL

Q1. 
Minimum Operations Problem Statement
You are given an array 'ARR' of size 'N' consisting of positive integers. Your task is to determine the minimum number of operations required to make all elements in t...read more
Ans. 
Minimum number of operations to make all elements in the array equal by performing addition, subtraction, multiplication, or division.
• Iterate through the array to find the maximum and minimum values.

• Calculate the difference between the maximum and minimum values.

• The minimum number of operations needed is the difference between the maximum and minimum values.
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

It was in the night around 7:00PM-7:20PM. Platform used for this round was skype. Interviewer was very serious while taking my interview.