Filter interviews by
Good HackerRank Question
The left view of a tree shows the nodes that are visible when looking at the tree from the left side.
Traverse the tree in a level order manner
Keep track of the first node encountered at each level
Add the first node at each level to the result array
Top trending discussions
I applied via Campus Placement and was interviewed in Sep 2023. There were 3 interview rounds.
Technical coding round, DSA questions
I applied via Recruitment Consulltant and was interviewed before May 2023. There was 1 interview round.
Coin Change Problem from DSA
One easy , one medium question Array based
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 24 Dec 2022
I applied via Naukri.com and was interviewed before Dec 2021. There were 4 interview rounds.
Matrix rotation and counting 0 and 1's.
posted on 24 Oct 2024
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.
posted on 14 Apr 2024
posted on 26 Aug 2024
based on 1 interview
Interview experience
Solution Engineer
109
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Solution Engineer
58
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Support Engineer
56
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer II
37
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
36
salaries
| ₹0 L/yr - ₹0 L/yr |
LogiNext Solutions
Shiprocket Private Limited
Shadowfax Technologies
Delhivery