Engati Software Developer Intern Interview Questions, Process, and Tips

Round duration - 120 minutes
Round difficulty - Hard

Q1. 
Round Robin Scheduling Problem Statement
You are provided with 'N' processes, each having a process ID ranging from 1 to 'N'. Each process has an arrival time and a burst time. Additionally, you're given ...read more
Ans. 
Implement a round-robin scheduling algorithm to determine completion time for each process.
• Implement a round-robin scheduling algorithm with the given time quantum.

• Execute processes based on arrival time and process ID if arrival times are the same.

• Calculate completion time for each process based on burst time and time quantum.
Answered by AI
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

The round was scheduled at 10 AM on 2nd August, 2019, But it started a little late due to some issues in Lab devices. The test started in a full screen mode and no one was allowed to exit full screen mode.

Q1. 
Remainder When Divided By 11 Problem Statement
Determine the remainder when a given number, 'N' in the form of a string, is divided by 11.
Input:
The first line contains an integer 'T' denoting the numb...read more
Ans. 
Find the remainder when a given number is divided by 11.
• Convert the string number to an integer for easier calculation.

• Use the property that the remainder when a number is divided by 11 is the same as the remainder when the alternating sum of its digits is divided by 11.

• Repeat the process until you get a single digit number as the result.
Answered by AI
Add your answer
Q2. 
Missing Number Problem Statement
You are provided with an array named BINARYNUMS consisting of N unique strings. Each string represents an integer in binary, covering every integer from 0 to N except for ...read more
Ans. 
Given an array of unique binary strings representing integers from 0 to N, find and return the missing integer's binary representation.
• Iterate through the binary strings and convert them to integers.

• Calculate the sum of integers from 0 to N using the formula (N * (N + 1)) / 2.

• Subtract the sum of the integers in the array from the total sum to find the missing integer.

• Convert the missing integer to binary and return it
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

It was a F2F interview. The interviewer was very friendly and was working as an SDE II in Consumers team. He started with quick intro of himself and then asked mine. Then jumped into coding question. He was monitoring my every single activity throughout the interview and told me ignore whenever I type something on my laptop.

Q1. 
Fish Eater Problem Statement
In a river where water flows from left to right, there is a sequence of 'N' fishes each having different sizes and speeds. The sizes of these fishes are provided in an array c...read more
Ans. 
Given a river with fishes of different sizes and speeds, determine how many fishes survive after encounters.
• Iterate through the array of fishes and simulate encounters between fishes to determine survivors

• Use a stack to keep track of surviving fishes

• Compare sizes of fishes to determine which fish eats the other
Answered by AI
View 1 more answer
Q2. 
Fishmonger Toll Optimization Problem
A fishmonger needs to transport goods from a port to a market, crossing multiple states each requiring a toll. The goal is to minimize the toll costs while ensuring th...read more
Ans. 
The Fishmonger Toll Optimization Problem involves minimizing toll costs while ensuring timely delivery of goods from a port to a market.
• Given 'N' states and a time limit 'M', find the smallest toll amount to reach the market from the port within the given time.

• Use dynamic programming to solve the problem efficiently.

• Consider both time and toll matrices to calculate the minimum toll cost.

• Return -1 if it is not possible
Answered by AI
Add your answer

Round duration - 75 Minutes
Round difficulty - Medium

It was a F2F interview. The interviewer was very friendly and was working as an SDE III in Payments team. He started with quick intro of himself and then asked mine. He asked me about the project I mentioned in my resume and some questions regarding the project. Then jumped into coding question. He was monitoring my every single activity throughout the interview.

Q1. 
Battalions and Tanks Problem Statement
Given 'N' battalions and 'M' tanks, along with an array representing the number of soldiers in each battalion, you need to allocate the tanks such that the maximum r...read more
Ans. 
Allocate tanks to battalions to minimize maximum ratio of soldiers per tank.
• Calculate the ratio of soldiers to tanks for each battalion.

• Sort the ratios in ascending order.

• Return the maximum ratio from the sorted list.
Answered by AI
Add your answer
Q2. 
Diagonal Traversal of a Binary Tree
Given a binary tree of integers, find its diagonal traversal. Refer to the example for clarification on diagonal traversal.
Example:
Explanation:
Consider lines at a...read more
Ans. 
Diagonal traversal of a binary tree involves printing nodes at the same diagonal in a specific order.
• Traverse the tree in a diagonal manner, starting from the root node and moving towards the right child and then the left child.

• Use a queue to keep track of nodes at each level of the tree.

• Print the nodes in the order they are encountered while traversing the tree diagonally.
Answered by AI
Add your answer

Round duration - 90 Miinutes
Round difficulty - Medium

The round has 2 sections each.

1) First Section consisted of 2 coding questions.
2) Second Section consisted of 28 multiple choice questions(MCQs)

Q1. 
Equation Solver Problem Statement
You are provided with an equation involving the addition of two numbers, where one of the numbers is missing and is represented as 'x'. Your task is to determine the valu...read more
Ans. 
Solve for the missing number 'x' in an equation involving addition of two numbers.
• Identify the summands and the result in the equation.

• Subtract the known summand from the result to find the missing number 'x'.

• Return the value of 'x' as the output.
Answered by AI
Add your answer
Q2. 
Anagram Pairs Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...read more
Ans. 
Determine if two strings are anagrams of each other by checking if they can be rearranged to form the other string.
• Create a frequency map of characters for both strings and compare them to check if they are equal.

• Sort both strings and compare them to see if they are equal.

• Use a set to store characters of one string and remove characters from the set while iterating through the other string.

• If the set is empty at the en
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

This was my first technical round and the interviewer mainly tested my problem solving skills.

Q1. 
Minimum Steps for a Knight to Reach Target
Given a square chessboard of size 'N x N', determine the minimum number of moves a Knight requires to reach a specified target position from its initial position...read more
Ans. 
Calculate minimum steps for a Knight to reach target position on a chessboard.
• Use BFS algorithm to find shortest path from Knight's starting position to target position.

• Consider all possible moves of the Knight on the chessboard.

• Track visited positions to avoid revisiting them during traversal.
Answered by AI
Add your answer

Round duration - 90 minutes.
Round difficulty - Hard

Q1. 
Longest Increasing Subsequence Problem Statement
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...read more
Ans. 
The task is to find the length of the longest increasing subsequence in a given array.
• Iterate through the array and keep track of the length of the longest increasing subsequence seen so far.

• Use dynamic programming to solve the problem efficiently.

• The time complexity of the solution should be O(N^2) or better.

• Consider edge cases such as an empty array or an array with only one element.
Answered by AI
View 2 more answers
Q2. 
Count Inversions Problem Statement
Given an integer array ARR of size N, your task is to find the total number of inversions that exist in the array.
An inversion is defined for a pair of integers in the...read more
Ans. 
The task is to count the number of inversions in an array.
• Iterate through the array and for each element, compare it with all the elements that come after it.

• If the current element is greater than any of the elements that come after it, increment the inversion count.

• Return the inversion count as the result.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This was held on Amazon Chime and the interview lasted for 1 hour. Firstly the interviewer asked to introduce about myself, later asked regarding the projects I have mentioned in my resume. Then started displaying the coding question. The first question is related to Strings. Given a string, find any of its permutation or anagram is a palindrome or not. The second question is Given an array of integers, find the length of the longest increasing subsequence. After solving both the questions in the optimized approach, the interviewer asked me for the 3rd question because we were still having time. The third question is Given a string with no separator, find the missing number in the string.The interviewer was very friendly.

Q1. 
Anagram Pairs Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...read more
Ans. 
The task is to determine whether two given strings form an anagram pair or not.
• Anagrams are words or names that can be formed by rearranging the letters of another word

• Check if the two strings have the same characters with the same frequency

• Convert the strings to character arrays and sort them

• Compare the sorted arrays to check if they are equal
Answered by AI
Add your answer
Q2. 
Longest Increasing Subsequence Problem Statement
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...read more
Ans. 
The task is to find the length of the longest increasing subsequence in a given array.
• Iterate through the array and keep track of the longest increasing subsequence length at each index.

• Use dynamic programming to store the lengths of increasing subsequences ending at each index.

• Return the maximum length from the dynamic programming array.
Answered by AI
Add your answer
Q3. 
Missing Number in Concatenated Sequence
You were given a sequence of consecutive nonnegative integers but missed one while appending them to create a string S. Your task is to identify the missing integer...read more
Ans. 
The task is to find the missing number in a string of consecutive nonnegative integers.
• Iterate through the string and check if each substring can form a valid number

• If a substring forms a valid number, check if it is consecutive with the previous number

• If a substring does not form a valid number or is not consecutive, it is the missing number

• Handle edge cases such as multiple missing numbers or all numbers already pres
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

This was held on Amazon Chime and the interview lasted for 1 hour. Firstly the interviewer asked to introduce about myself, later asked regarding the projects I have mentioned in my resume. Then started displaying the coding question. The first question is number of islands in a matrix.

Q1. 
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 t...read more
Ans. 
The task is to find the number of islands present in a 2-dimensional array filled with ones and zeroes.
• Iterate through each cell in the array

• If the cell is land (1) and not visited, perform a depth-first search to find all connected land cells

• Increment the count of islands for each connected component found
Answered by AI
Add your answer

Round duration - 180 Minutes
Round difficulty - Medium

Round 1 was a coding test which consisted of 4 sections.
1st section.
There were 7 debugging questions which was to be solved in 20 minutes.
A code was given which we have to debug and it should pass all the test cases. If you have a basic understanding of loops and concepts then this section is easy.

2nd section.
There were 2 coding questions which were to be done in 70 minutes.

3rd section
This section was more about behaviour and nature.

4th section 
There were 35 reasoning based questions, which was to be done in 24 minutes.

Q1. 
Merge Two Sorted Linked Lists Problem Statement
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...read more
Ans. 
Merge two sorted linked lists into a single sorted linked list without using additional space.
• Create a dummy node to start the merged list

• Compare the nodes of both lists and link them accordingly

• Move the pointer to the next node in the merged list

• Handle cases where one list is empty or both lists are empty

• Time complexity: O(n), Space complexity: O(1)
Answered by AI
Add your answer
Q2. 
Word Break Problem Statement
You are given a list of N strings called A. Your task is to determine whether you can form a given target string by combining one or more strings from A.
The strings from A c...read more
Ans. 
Given a list of strings, determine if a target string can be formed by combining one or more strings from the list.
• Iterate through all possible combinations of strings from the list to form the target string.

• Use recursion to try different combinations of strings.

• Check if the current combination forms the target string.

• Return true if a valid combination is found, otherwise return false.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Round 2 was 1-hour long technical interview. It was on 20th June 2020, from 10 AM to 11 AM. The round started with the introductions and then the discussion on projects.

Q1. 
Add Two Numbers as Linked Lists
You are given two singly linked lists, where each list represents a positive number without any leading zeros.
Your task is to add these two numbers and return the sum as ...read more
Ans. 
Add two numbers represented as linked lists and return the sum as a linked list.
• Traverse both linked lists simultaneously while adding corresponding nodes and carry over the sum if needed

• Handle cases where one linked list is longer than the other by adding remaining nodes with carry

• Create a new linked list to store the sum and return its head node
Answered by AI
Add your answer
Q2. 
Course Schedule Problem Statement
You are enrolled as a student and must complete N courses, numbered from 1 to N, to earn your degree.
Some courses have prerequisites, which means that to take course i,...read more
Ans. 
Determine if it is feasible to complete all courses with given prerequisites.
• Create a graph representation of the courses and prerequisites.

• Check for cycles in the graph using topological sorting.

• If there are no cycles, all courses can be completed.

• Example: For N=2 and prerequisites=[[1, 2]], output is 'Yes'.
Answered by AI
Add your answer
Q3. What are the ACID properties in a database management system?
Ans. 
ACID properties are a set of properties that guarantee the reliability of transactions in a database management system.
• Atomicity: Ensures that either all operations in a transaction are completed successfully or none at all.

• Consistency: Ensures that the database remains in a consistent state before and after the transaction.

• Isolation: Ensures that the execution of multiple transactions concurrently does not interfere w...read more
Answered by AI
Add your answer