Faster and better experience!
i
Shiprocket Private Limited
Filter interviews by
Clear (1)
I applied via Approached by Company and was interviewed in Sep 2024. There was 1 interview round.
var is function scoped, let is block scoped, const is block scoped and cannot be reassigned.
var is function scoped, let is block scoped, const is block scoped and cannot be reassigned
var can be redeclared and updated, let can be updated but not redeclared, const cannot be redeclared or updated
Example: var x = 10; let y = 20; const z = 30;
Closure is a function that captures the variables from its surrounding scope, even after the surrounding function has finished executing.
Closure allows a function to access and manipulate variables from its outer scope.
It maintains a reference to its outer scope, even after the outer function has returned.
Closure is commonly used in event handlers and callbacks.
Rxjs operators are used for handling asynchronous operations in reactive programming.
Map operator: transforms the items emitted by an Observable
Filter operator: emits only those items from an Observable that pass a specified condition
Merge operator: combines multiple Observables into one by merging their emissions
SwitchMap operator: switches to a new Observable each time it is emitted
DebounceTime operator: emits a valu...
Change detection strategy in Angular is a mechanism used to detect changes in the application state and update the view accordingly.
Angular uses Zone.js for change detection by default
Change detection can be triggered manually using ChangeDetectorRef
Optimizing change detection using OnPush strategy
I applied via Referral and was interviewed in Aug 2024. There were 2 interview rounds.
To find the next highest number, sort the numbers in ascending order and find the number immediately greater than the given number.
Sort the numbers in ascending order
Find the number immediately greater than the given number
Return the next highest number
Count the number of islands in a given grid of '1's and '0's.
Iterate through the grid and for each '1' encountered, perform a depth-first search to mark all connected '1's as visited.
Increment the island count for each new island encountered.
Consider edge cases like grid boundaries and handling visited cells.
Shiprocket Private Limited interview questions for designations
Top trending discussions
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 ...
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
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
I applied via Approached by Company and was interviewed before Oct 2023. There were 2 interview rounds.
Dynamic Programming problem involving finding the maximum sum of non-adjacent elements in an array.
Use dynamic programming to keep track of the maximum sum at each index.
At each index, the maximum sum is either the current element plus the sum two indices back, or the sum at the previous index.
Example: For array [2, 4, 6, 2, 5], the maximum sum of non-adjacent elements is 13 (2 + 6 + 5).
Find the longest common prefix among an array of strings.
Iterate through the characters of the first string and compare with other strings
Return the prefix when characters don't match or reach end of any string
Example: Input - ['flower', 'flow', 'flight'], Output - 'fl'
LRU cache is a data structure that stores the most recently used items.
Use a doubly linked list to keep track of the order of items based on their usage.
Use a hashmap to quickly access items in the cache.
When a new item is accessed, move it to the front of the linked list.
If the cache is full, remove the least recently used item from the end of the linked list.
I applied via Recruitment Consultant and was interviewed in Jun 2021. There was 1 interview round.
based on 4 interviews
1 Interview rounds
based on 4 reviews
Rating in categories
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