EarlySalary Services Software Developer Intern Interview Questions and Answers for Freshers

Round duration - 45 minutes
Round difficulty - Medium

Two DSA questions were asked in this round in 45 min.

Q1. 
Maximum Subarray Sum Problem Statement
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Out...read more
Ans. 
Find the maximum sum of any contiguous subarray within an array of integers.
• Iterate through the array and keep track of the maximum sum of subarrays encountered so far.

• Use Kadane's algorithm to efficiently find the maximum subarray sum.

• Handle cases where all elements are negative by returning the maximum element in the array.

• Example: For array [34, -50, 42, 14, -5, 86], the maximum subarray sum is 137.
Answered by AI
Add your answer
Q2. 
Odd Occurrence Element Problem Statement
Given an array of integers where each element appears an even number of times except for one element which appears an odd number of times, find the element that ap...read more
Ans. 
Find the element that appears an odd number of times in an array of integers.
• Iterate through the array and use XOR operation to find the element that appears odd number of times.

• Keep a count of occurrences of each element using a hashmap.

• Return the element that has an odd count of occurrences.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Timing was 9 PM. Platform was not good. Platform was very lagging so overall it was bad experience.

Q1. 
Find the Third Greatest Element
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
Input:
The first line contains a single integer 'T' representing the numb...read more
Ans. 
Find the third largest element in an array of distinct integers.
• Sort the array in descending order and return the element at index 2.

• Handle cases where the array has less than 3 elements separately.

• Use a set to store distinct elements for efficient processing.
Answered by AI
Add your answer
Q2. 
Longest Palindromic Substring Problem Statement
You are provided with a string STR of length N. The task is to find the longest palindromic substring within STR. If there are several palindromic substring...read more
Ans. 
Find the longest palindromic substring in a given string.
• Iterate through the string and expand around each character to find palindromes

• Keep track of the longest palindrome found so far

• Return the longest palindromic substring
Answered by AI
Add your answer
Q3. 
Ninja and Geometry Problem Statement
In this problem, Ninja is provided with two lines on a 2D plane. The first line 'AB' is determined by two points A and B. The second line 'PQ' is determined by two poi...read more
Ans. 
Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.
• Implement a function to calculate the intersection point of two lines on a 2D plane

• Handle precision up to six decimal places in the output

• Return -1.000000 -1.000000 if the lines do not intersect

• Ensure the lines 'AB' and 'PQ' are distinct
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Timing was 9 PM. Platform was not good. Platform was very lagging so overall it was bad experience.

Q1. 
Find the Third Greatest Element
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
Input:
The first line contains a single integer 'T' representing the numb...read more
Ans. 
Find the third largest element in an array of distinct integers.
• Sort the array in descending order and return the element at index 2.

• Handle cases where there are less than 3 elements in the array.

• Consider edge cases like negative integers and duplicates.
Answered by AI
Add your answer
Q2. 
Longest Palindromic Substring Problem Statement
You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...read more
Ans. 
Identify the longest palindromic substring in a given string.
• Iterate through each character in the string and expand around it to find palindromes

• Keep track of the longest palindrome found so far

• Return the longest palindromic substring with the smallest start index
Answered by AI
Add your answer
Q3. 
Ninja and Geometry Problem Statement
In this problem, Ninja is provided with two lines on a 2D plane. The first line 'AB' is determined by two points A and B. The second line 'PQ' is determined by two poi...read more
Ans. 
Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.
• Implement a function to calculate the intersection point of two lines on a 2D plane

• Handle precision up to six decimal places in the output

• Return -1.000000 -1.000000 if the lines do not intersect

• Ensure the lines 'AB' and 'PQ' are distinct
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Timing was 9 PM. Platform was not good. Platform was very lagging so overall it was bad experience.

Q1. 
Find the Third Greatest Element
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
Input:
The first line contains a single integer 'T' representing the numb...read more
Ans. 
Find the third largest element in an array of distinct integers.
• Sort the array in descending order and return the element at index 2.

• Handle cases where the array has less than 3 elements separately.

• Consider using a set to ensure distinct elements in the array.
Answered by AI
View 1 more answer
Q2. 
Longest Palindromic Substring Problem Statement
You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...read more
Ans. 
Identify the longest palindromic substring in a given string.
• Iterate through the string and expand around each character to find palindromes

• Keep track of the longest palindrome found

• Return the longest palindromic substring with the smallest start index
Answered by AI
Add your answer
Q3. 
Ninja and Geometry Problem Statement
In this problem, Ninja is provided with two lines on a 2D plane. The first line 'AB' is determined by two points A and B. The second line 'PQ' is determined by two poi...read more
Ans. 
Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.
• Use the formula for finding the intersection point of two lines in 2D space.

• Handle precision issues that may arise due to floating-point arithmetic.

• Return -1.000000 -1.000000 if the lines do not intersect.

• Ensure the lines 'AB' and 'PQ' are distinct.
Answered by AI
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

The online test was for 2 hrs in which 5 coding questions were asked. 3 questions were pretty easy and 2 were of medium difficulty level. I was able to solve all 5 questions.

Q1. 
Shortest Path in an Unweighted Graph
The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road...read more
Ans. 
Implement a function to find the shortest path in an unweighted graph from a given start house to a destination house.
• Use Breadth First Search (BFS) algorithm to find the shortest path in an unweighted graph.

• Maintain a queue to explore neighboring houses and keep track of visited houses to avoid revisiting them.

• Return the path once the destination house is reached.

• Example: For input N=8, M=9, S=1, T=8 and roads (1, 2),...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It started with the introduction and then we had a discussion on the projects I had made. He asked for several Backend and Database concepts like locking in DB, sessions, etc as I had mentioned backend internship in my resume. It took around half an hour.

Then he gave me a coding question based on the graph

Q1. 
Capture Region Problem Statement
You are given a matrix having N rows and M columns. Each cell of the matrix contains either 'X' or 'O'. Your task is to flip all the regions of 'O' that are completely sur...read more
Ans. 
Given a matrix with 'X' and 'O', flip all 'O' regions completely surrounded by 'X' to 'X'.
• Iterate through the matrix and identify 'O' regions completely surrounded by 'X'.

• Use DFS/BFS to mark all 'O's in the surrounded region.

• Update the matrix by flipping all marked 'O's to 'X'.
Answered by AI
Add your answer

Q1. Find Target Element in a rotating sorted Array.
Ans. 
Search for target element in a rotated sorted array.
• Use binary search to find the pivot point where rotation happens.

• Divide the array into two subarrays and perform binary search on the appropriate subarray.

• Handle cases where the target element is on the left or right side of the pivot.
Answered by AI
Add your answer

The aptitude test was medium level.

Q1. Array - Pair Sum - Return pair of the sum from arrays
Ans. 
Find pairs in array that sum up to a given target value.
• Iterate through the array and store each element in a hash set.

• For each element, check if the target value minus the current element exists in the hash set.

• Return the pair of elements that sum up to the target value.
Answered by AI
Add your answer
Q2. Check if two strings are anagram of each other
Ans. 
Check if two strings are anagram of each other
• Create character count arrays for both strings

• Compare the character count arrays to check if they are equal

• Example: 'listen' and 'silent' are anagrams
Answered by AI
Add your answer

Q1. Sort array of cards in color red , blue,green
Ans. 
Sort array of cards in red, blue, green colors.
• Use a custom sorting function to sort the array based on color order.

• Assign a numerical value to each color (e.g. red: 0, blue: 1, green: 2) and sort based on these values.

• Implement a sorting algorithm like bubble sort or quicksort to rearrange the array based on color order.
Answered by AI
Add your answer