Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Shiprocket Private Limited Team. If you also belong to the team, you can get access from here

Shiprocket Private Limited Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Shiprocket Private Limited Softwaretest Engineer Interview Questions and Answers

Updated 28 Jan 2025

Shiprocket Private Limited Softwaretest Engineer Interview Experiences

2 interviews found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Dijkstra's algorithm based question
  • Q2. Linked List and Tree based question
Interview experience
1
Bad
Difficulty level
Moderate
Process Duration
6-8 weeks
Result
Selected Selected

I was interviewed before Jan 2024.

Round 1 - HR 

(2 Questions)

  • Q1. Are you flexible in working
  • Ans. 

    Yes, I am flexible in working and can adapt to changing requirements and schedules.

    • I am willing to work extra hours if needed to meet project deadlines

    • I can adjust my work hours to accommodate team meetings or client calls in different time zones

    • I am open to learning new technologies or tools to improve my testing skills

  • Answered by AI
  • Q2. Career goals

Interview Preparation Tips

Interview preparation tips for other job seekers - Stay away from this firm. It might destroy your career.

Softwaretest Engineer Interview Questions Asked at Other Companies

asked in Playablo
Q1. What is boundary value analysis? How do u perform boundary value ... read more
asked in Playablo
Q2. If u get a blocker defect just the previous day of ur release dat ... read more
Q3. 1. What is STLC, SDLC 2. What is the bug Life cycle. 3. Differenc ... read more
Q4. - Print the frequency of each alphabet for the given string. - Sw ... read more
asked in Playablo
Q5. Write Sql query for displaying total number of students from chil ... read more

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Nov 2023. There were 2 interview rounds.

Round 1 - Aptitude Test 

The basic questions asked in an interview .

Round 2 - Coding Test 

DP, graph, and array questions asked in 2nd round also asked my company project

Interview Preparation Tips

Interview preparation tips for other job seekers - please prepare for the DSA and system design round and basic computer concept

I was interviewed before May 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

1 easy and 2 medium-hard DSA problems to solve

  • Q1. 

    Hurdle Game Problem Statement

    Kevin is playing a hurdle game where he must jump over hurdles to clear levels. Each level ‘i’ consists of ‘i’ hurdles (e.g., Level 6 has 6 hurdles).

    Given the total number ...

  • Ans. 

    Given the total number of hurdles Kevin has jumped, determine how many levels he has cleared.

    • Iterate through levels while subtracting hurdles from total jumped until remaining hurdles are less than current level

    • Return the current level as the number of levels cleared

  • Answered by AI
  • Q2. 

    N Queens Problem

    Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.

    Explanation:

    A queen can attack another queen if they ar...

  • Ans. 

    The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.

    • Use backtracking algorithm to explore all possible configurations.

    • Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.

    • Generate valid configurations recursively and backtrack when a solution is not possible.

  • Answered by AI
  • Q3. 

    Count Ways To Travel Triangular Pyramid

    Bob is given a triangular pyramid with vertices 'O', 'X', 'Y', and 'Z'. He is also provided with an integer 'N'. Bob can move to any adjacent vertex in a single ste...

  • Ans. 

    Calculate the number of ways Bob can complete a journey in a triangular pyramid after N steps.

    • Bob can move to any adjacent vertex in a single step

    • Bob must return to vertex 'O' after exactly 'N' steps

    • Calculate the number of different ways Bob can complete the journey

    • Return the result modulo 1000000007

    • Consider the constraints provided

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

2 DSA problems and computer subject questions

  • Q1. 

    Generate Binary Strings with No Consecutive 1s

    Given an integer K, your task is to produce all binary strings of length 'K' that do not contain consecutive '1's.

    Input:

    The input begins with an integer ...
  • Ans. 

    Generate all binary strings of length 'K' with no consecutive '1's in lexicographically increasing order.

    • Use backtracking to generate all possible binary strings of length 'K' with no consecutive '1's.

    • Start with an empty string and recursively add '0' or '1' based on the condition of no consecutive '1's.

    • Sort the generated strings in lexicographically increasing order before outputting them.

  • Answered by AI
  • Q2. 

    Shuffle Two Strings Problem Statement

    You are provided with three strings A, B, and C. The task is to determine if C is formed by interleaving A and B. C is considered an interleaving of A and B if:

    • T...
  • Ans. 

    Check if a string is formed by interleaving two other strings.

    • Iterate through characters of A, B, and C simultaneously to check if C is formed by interleaving A and B.

    • Use dynamic programming to efficiently solve the problem.

    • Handle edge cases like empty strings or unequal lengths of A, B, and C.

    • Example: A = 'aab', B = 'abc', C = 'aaabbc' should return True.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

DSA round

  • Q1. 

    Ninja and Intersection of Lines

    You are given coordinates for two lines on a 2D plane: Line 'AB' is defined by points 'A' and 'B', and Line 'PQ' is defined by points 'P' and 'Q'. Your task is to find the ...

  • Ans. 

    Find the intersection point of two lines on a 2D plane given their coordinates.

    • Calculate the slopes of both lines using the given coordinates.

    • Use the slope-intercept form of a line to find the equations of the two lines.

    • Solve the equations simultaneously to find the intersection point.

    • Return the coordinates of the intersection point with precision up to 6 decimal places.

  • Answered by AI
  • Q2. 

    Cycle Detection in Directed Graph

    Determine if a given directed graph contains a cycle. If the graph has at least one cycle, return true. Otherwise, return false.

    Input:

    The first line of input contains...
  • Ans. 

    Detect cycles in a directed graph and return true if a cycle exists, false otherwise.

    • Use Depth First Search (DFS) to detect cycles in the directed graph.

    • Maintain a visited array to keep track of visited vertices and a recursion stack to detect back edges.

    • If a vertex is visited and is present in the recursion stack, then a cycle exists.

    • Example: For the input 4 4, the graph has a cycle 0 -> 1 -> 2 -> 3 -> 1.

  • Answered by AI
Round 4 - Face to Face 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Easy

It is a managerial round

  • Q1. How does a URL work and what is a load balancer?
  • Ans. 

    A URL is a web address that specifies the location of a resource on the internet. A load balancer distributes incoming network traffic across multiple servers to ensure optimal resource utilization and prevent overload.

    • A URL (Uniform Resource Locator) is a reference to a web resource that specifies its location on a computer network and the mechanism for retrieving it.

    • URLs typically consist of a protocol (such as HTTP ...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Jalpaiguri Government Engineering College. Eligibility criteriaNASwiggy interview preparation:Topics to prepare for the interview - DSA, Networking, Operating Systems, DBMS, Spring JavaTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Practice Trees, Graphs, DP
Tip 2 : Be sure about your projects

Application resume tips for other job seekers

Tip 1 : Be genuine about your resume
Tip 2 : Have at least two projects on resume

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Recruitment Consultant and was interviewed in May 2020. There were 3 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. What is diameter of Binary Tree? Write full working code.
  • Ans. 

    Diameter of a binary tree is the longest path between any two leaf nodes.

    • Calculate the height of left and right subtrees recursively.

    • Calculate the diameter recursively using the formula max(left_height + right_height + 1, max(left_diameter, right_diameter)).

    • Return the maximum diameter.

  • Answered by AI
  • Q2. Find interchanged terms from an AP, where terms are arranged in series
  • Ans. 

    To find interchanged terms from an AP series

    • Identify the common difference between terms

    • Swap the positions of adjacent terms

    • Check if the new series is also an AP

    • Repeat until no more interchanged terms can be found

  • Answered by AI
  • Q3. Explain database indexing
  • Ans. 

    Database indexing is a technique to improve the performance of database queries.

    • Indexing creates a data structure that allows for faster retrieval of data.

    • Indexes are created on one or more columns of a table.

    • Queries that use indexed columns can be executed faster.

    • Indexes can be clustered or non-clustered.

    • Clustered indexes determine the physical order of data in a table.

    • Non-clustered indexes create a separate structure...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well on basic data structures, operating systems and database.

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. Two problems[Ds and algo] +Cv Project Explanation 1 hour interview[Single round only]
  • Q2. Anyone who does LeetCode medium level problems can solve them easily always do follow up of the problems cause that is the only thing they desire from your solution
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(2 Questions)

  • Q1. What is oops concepts
  • Ans. 

    OOPs concepts are the fundamental principles of object-oriented programming.

    • Encapsulation - binding data and functions together in a single unit

    • Inheritance - creating new classes from existing ones

    • Polymorphism - ability of objects to take on many forms

    • Abstraction - hiding implementation details from the user

    • Examples: class, object, inheritance, encapsulation, polymorphism, abstraction

  • Answered by AI
  • Q2. What is spring boot
  • Ans. 

    Spring Boot is a framework for building standalone, production-grade Spring-based applications.

    • Spring Boot simplifies the process of creating and deploying Spring-based applications.

    • It provides a set of pre-configured dependencies and an embedded web server.

    • It also offers features like auto-configuration, which reduces the need for manual configuration.

    • Spring Boot is widely used for building microservices and RESTful A...

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
4-6 weeks
Result
-

I applied via Company Website and was interviewed in Jun 2024. There was 1 interview round.

Round 1 - Coding Test 

Implement your own state management in React and integrate it into a React application.

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

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

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

  • 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
Round 2 - Video Call 

(2 Questions)

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

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

  • Answered by AI
  • 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...

  • 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

  • Answered by AI
Round 3 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

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

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BengaluruEligibility criteriawith resumeSwiggy interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Puzzles, Project, Mock Interviews, etcTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Be good with all data structures and algorithms
Tip 2 : Able to explain your projects well 
Tip 3 : focus on basics

Application resume tips for other job seekers

Tip 1 : Try to make a single-page resume. 
Tip 2 : Don't write unnecessary details like hobbies, family, etc.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    0/1 Knapsack Problem Statement

    A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...

  • Ans. 

    Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).

    • Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.

    • Iterate through each item and update the array based on whether including the item would increase the total value.

    • The final value in the array at index W will be the maximum value that can be stolen.

  • Answered by AI
  • Q2. 

    Find the Second Largest Element

    Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.

    If a second largest element does not exist, return -1.

    Example:

    Input:
    ARR = [2,...
  • Ans. 

    Find the second largest element in an array of integers.

    • Iterate through the array to find the largest and second largest elements.

    • Handle cases where all elements are identical.

    • Return -1 if a second largest element does not exist.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

System Design Round

  • Q1. Design a system for Twitter, discussing its architecture, key components, and scalability considerations.
  • Ans. 

    Design a scalable system for Twitter with key components and architecture.

    • Use microservices architecture for scalability and fault isolation.

    • Key components include user service, tweet service, timeline service, and notification service.

    • Use a distributed database like Cassandra for storing tweets and user data.

    • Implement a message queue like Kafka for handling real-time updates and notifications.

    • Use a caching layer like ...

  • Answered by AI
Round 3 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaResume shortlistingSwiggy interview preparation:Topics to prepare for the interview - OOPS, Data Structures, Core Java, Algorithms, DBMS, SQL,Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.

Application resume tips for other job seekers

Tip 1 : Mention what you know 
Tip 2 : Good previous work to showcase

Final outcome of the interviewSelected

Skills evaluated in this interview

Shiprocket Private Limited Interview FAQs

How many rounds are there in Shiprocket Private Limited Softwaretest Engineer interview?
Shiprocket Private Limited interview process usually has 1 rounds. The most common rounds in the Shiprocket Private Limited interview process are Technical and HR.
What are the top questions asked in Shiprocket Private Limited Softwaretest Engineer interview?

Some of the top questions asked at the Shiprocket Private Limited Softwaretest Engineer interview -

  1. Linked List and Tree based quest...read more
  2. Dijkstra's algorithm based quest...read more

Tell us how to improve this page.

Shiprocket Private Limited Softwaretest Engineer Interview Process

based on 2 interviews

Interview experience

2.5
  
Poor
View more

Interview Questions from Similar Companies

Delhivery Interview Questions
3.9
 • 458 Interviews
Swiggy Interview Questions
3.8
 • 428 Interviews
Udaan Interview Questions
4.0
 • 334 Interviews
CARS24 Interview Questions
3.5
 • 330 Interviews
Meesho Interview Questions
3.7
 • 328 Interviews
Ecom Express Interview Questions
3.8
 • 198 Interviews
BlackBuck Interview Questions
3.8
 • 176 Interviews
XpressBees Interview Questions
3.6
 • 159 Interviews
DTDC Express Interview Questions
3.7
 • 151 Interviews
Tata 1mg Interview Questions
3.6
 • 146 Interviews
View all
Shiprocket Private Limited Softwaretest Engineer Salary
based on 6 salaries
₹7.5 L/yr - ₹11.7 L/yr
48% more than the average Softwaretest Engineer Salary in India
View more details

Shiprocket Private Limited Softwaretest Engineer Reviews and Ratings

based on 2 reviews

3.0/5

Rating in categories

2.4

Skill development

2.4

Work-life balance

3.0

Salary

2.4

Job security

2.4

Company culture

2.4

Promotions

1.7

Work satisfaction

Explore 2 Reviews and Ratings
Software Engineer
164 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Specialist
86 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Specialist
70 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Key Account Manager
69 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
67 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Shiprocket Private Limited with

Pickrr

3.9
Compare

Delhivery

3.9
Compare

Ecom Express

3.8
Compare

XpressBees

3.6
Compare
Did you find this page helpful?
Yes No
write
Share an Interview