i
Shiprocket Private Limited
Filter interviews by
Clear (1)
Memory leaks can be detected and prevented by monitoring memory usage, using memory profiling tools, avoiding circular references, and properly managing event listeners.
Monitor memory usage regularly to identify any abnormal increases.
Use memory profiling tools like Chrome DevTools or Valgrind to analyze memory usage.
Avoid creating circular references in your code, as they can prevent objects from being garbage collect...
I was interviewed before May 2023.
Coding test in javascript
Top trending discussions
I applied via Campus Placement and was interviewed in Feb 2024. There were 2 interview rounds.
Question are very tough and faad
Question like trees linked list and graphs
I applied via Approached by Company and was interviewed in Oct 2024. There were 2 interview rounds.
Find the longest sequence of ascending numbers in an array.
Iterate through the array and keep track of the current sequence length
Reset the sequence length when a number is not in ascending order
Return the longest sequence found
Find a pair of numbers in a list that subtract to a target value
Iterate through the list of numbers and store each number in a hashmap along with its index
For each number, check if the difference between the target and the number exists in the hashmap
Return the pair of numbers if found, otherwise return an empty array
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 ...
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 23 Aug 2024
My name is John Smith.
Full name is John Smith
Common name in English-speaking countries
No middle name or initial
In my free time, I enjoy hiking, playing video games, and learning new programming languages.
Hiking in local trails and national parks
Playing video games like Overwatch and Minecraft
Learning new programming languages like Python and JavaScript
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 2 interviews
Interview experience
3-6 Yrs
₹ 14-22 LPA
3-6 Yrs
₹ 4-5.5 LPA
Software Engineer
164
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Specialist
86
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Manager
73
salaries
| ₹0 L/yr - ₹0 L/yr |
Key Account Manager
71
salaries
| ₹0 L/yr - ₹0 L/yr |
Specialist
71
salaries
| ₹0 L/yr - ₹0 L/yr |
Pickrr
Delhivery
Ecom Express
XpressBees