i
Shiprocket Private Limited
Filter interviews by
Clear (1)
I applied via Naukri.com and was interviewed in Jan 2024. There was 1 interview round.
Yes, I thrive under pressure and have successfully managed high-stress situations in the past.
I have experience handling tight deadlines and demanding projects
I remain calm and focused under pressure, finding solutions efficiently
I prioritize tasks effectively to manage workload during stressful times
Top trending discussions
I applied via Naukri.com and was interviewed before Nov 2022. There were 2 interview rounds.
I applied via Recruitment Consultant and was interviewed in May 2020. There were 3 interview rounds.
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.
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
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...
I applied via Campus Placement and was interviewed before Dec 2020. There were 4 interview rounds.
Design a stack that supports getmin in O(1) time and O(1) space complexities.
Use two stacks, one for storing the actual values and the other for storing the minimum values.
When pushing a new value, check if it is smaller than the current minimum value and push it to the minimum stack if it is.
When popping a value, check if it is the current minimum value and pop it from the minimum stack if it is.
To get the minimum val...
Binary tree traversal is the process of visiting each node in a binary tree exactly once in a specific order.
There are three main types of binary tree traversal: inorder, preorder, and postorder.
Inorder traversal visits the left subtree, then the root, then the right subtree.
Preorder traversal visits the root, then the left subtree, then the right subtree.
Postorder traversal visits the left subtree, then the right subt...
LRU cache is a data structure that stores the most recently used items and discards the least recently used items.
LRU stands for Least Recently Used
It has a fixed size and when the cache is full, the least recently used item is removed to make space for a new item
It uses a combination of a doubly linked list and a hash map to achieve O(1) time complexity for both insertion and deletion
Example: A web browser cache that ...
Promise in Node.js is an object representing the eventual completion or failure of an asynchronous operation.
Used to handle asynchronous operations in a more readable and manageable way
Can be in one of three states: pending, fulfilled, or rejected
Can be chained together to handle multiple asynchronous operations sequentially
Example: fetching data from a database using a promise-based API
I applied via Company Website and was interviewed in Apr 2024. There was 1 interview round.
I am a software developer with 5 years of experience in Java and Python.
Experienced in Java and Python programming languages
Worked on various projects involving web development and data analysis
Familiar with Agile methodologies and version control systems like Git
posted on 13 Mar 2024
I was interviewed before Mar 2023.
Use a greedy algorithm to send the office bus to all locations in the city efficiently.
Start from the office location and pick the nearest location to visit next.
Continue picking the nearest unvisited location until all locations are covered.
Repeat the process until all locations are visited.
Consider using Dijkstra's algorithm or a similar approach for finding the nearest location.
Optimize the route by considering traf
posted on 19 Nov 2024
I applied via Referral and was interviewed before Nov 2023. There were 2 interview rounds.
The basic questions asked in an interview .
DP, graph, and array questions asked in 2nd round also asked my company project
based on 1 interview
Interview experience
Software Engineer
164
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Specialist
86
salaries
| ₹0 L/yr - ₹0 L/yr |
Specialist
70
salaries
| ₹0 L/yr - ₹0 L/yr |
Key Account Manager
69
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
67
salaries
| ₹0 L/yr - ₹0 L/yr |
Pickrr
Delhivery
Ecom Express
XpressBees