Shiprocket Private Limited Associate Software Engineer Interview Questions and Answers

Apti and coding

Q1. Questions on java a d sql
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

4 Questions which were of Easy, Medium, and Hard level.

Q1. 
Lowest Common Ancestor of a Binary Tree III
The structure of a binary tree has been modified so that each node includes a reference to its parent node.
Problem Statement
You are provided with two nodes,...read more
Ans. 
This question is about finding the lowest common ancestor of two nodes in a binary tree with parent references.
• Traverse from the given nodes to their respective root nodes and store the paths in two separate lists.

• Compare the two lists and find the last common node.

• Return the last common node as the lowest common ancestor.
Answered by AI
Add your answer
Q2. 
Maximum Subarray Problem Statement
Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.
A subarray 'A' is considered greater than a...read more
Ans. 
The problem is to find a subarray with the maximum sum in a given array.
• Iterate through the array and keep track of the maximum sum and the current sum.

• If the current sum becomes negative, reset it to 0.

• Update the maximum sum if the current sum is greater.

• Also keep track of the start and end indices of the subarray with the maximum sum.

• Return the subarray using the start and end indices.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Easy

Q1. 
Next Greater Element Problem Statement
Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...read more
Ans. 
The task is to find the next greater element for each element in an array.
• Iterate through the array from right to left.

• Use a stack to keep track of the elements that have a greater element to their right.

• For each element, pop elements from the stack until a greater element is found or the stack is empty.

• If a greater element is found, it is the next greater element for the current element.

• If the stack becomes empty, the...read more
Answered by AI
Add your answer
Q2. 
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. 
The question asks to find the total amount of rainwater that can be trapped in the given elevation map.
• Iterate through the array and find the maximum height on the left and right side of each bar.

• Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on both sides and subtracting the height of the bar.

• Sum up the amount of water trapped at each bar to get the total amo...read more
Answered by AI
View 5 more answers

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality round, asked basic questions like relocation and joining date etc

In test I had to solve 3 dsa questions in 1 hour

Q1. I have asked 2 DSA questions in my interview
Add your answer

It was a coding round where i need to solve 3 DSA Questions in 1.5 hour

Q1. This is Technical round where i was asked to implement the Two Question of Dsa one is bases on greedy and another is dp , another one is leetcode hard (finding maxaimal area of rectangle in matrix of 1 and...read more
Add your answer
Q2. Greedy Q was direct i don't remember clearly. I was selected for the 2nd round
Add your answer

Q1. It was also a technical round but bases on LLD problem statement. I was given a problem statement to design a society security system and the they need psudo code for complete implementation using correct ...read more
Ans. 
Design a society security system using appropriate design patterns and provide pseudocode for implementation.
• Use the Singleton pattern for a central security manager to ensure only one instance handles security.

• Implement Observer pattern for notifying residents about security alerts.

• Use Factory pattern to create different types of security devices (cameras, alarms).

• Consider using Strategy pattern for different security...read more
Answered by AI
Add your answer

Q1. I was not selected for 4th round but heard that there were Q on cs fundamentals.
Add your answer

Q1. Dsa algorithm questions
Add your answer
Q2. Sql questions queries
Add your answer

Easy level to Medium level

2 Easy questions of DSA

Q1. One DSA question
Add your answer
Q2. Normal discussion about tech stack
Add your answer

Q1. Tell about yourself
Add your answer
Q2. Why do you want to join digit?
Add your answer

Q1. Create a controller , service and repository methods and classes to save userDeatils in table using Spring Data JPA .
Ans. 
Create a controller, service, and repository to save user details using Spring Data JPA.
• Create a UserController class with appropriate mappings for saving user details.

• Create a UserService class with a method to save user details.

• Create a UserRepository interface that extends JpaRepository to handle database operations.

• Implement the saveUserDetails method in the UserService class to call the save method of the UserRepo...read more
Answered by AI
Add your answer

First round was coding test in online mode which was quite easy.

Q1. In the 2nd round they asked the technical questions from SQL , simple coding questions.
Add your answer