i
Droom
Filter interviews by
I applied via LinkedIn and was interviewed before Sep 2022. There were 2 interview rounds.
I applied via Recruitment Consultant and was interviewed in Aug 2019. There were 5 interview rounds.
I appeared for an interview before May 2023.
Atomic transactions ensure that all operations in a transaction are completed successfully or none at all in a distributed system.
Atomic transactions guarantee that all operations within a transaction are either all successful or all rolled back.
In distributed systems, atomic transactions are crucial for maintaining data consistency across multiple nodes.
ACID properties (Atomicity, Consistency, Isolation, Durability) a...
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
Computer Fundamentals
Flatten a binary tree by converting it into a linked list in-place.
Use a recursive approach to flatten the binary tree.
Traverse the tree in a pre-order manner and keep track of the previous node.
Set the left child of each node to null and the right child to the next node in the linked list.
Example: Input: 1 -> 2 -> 5 -> 3 -> 4 -> null, Output: 1 -> null -> 2 -> null -> 3 -> null -> 4 -> null -> 5 -> null
I applied via Internshala and was interviewed in Dec 2023. There were 2 interview rounds.
Easy to medium, can solve with leetcode medium
Count the number of islands in a 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 found
Ensure to handle boundary cases and check for visited nodes
Find the first and last index of a specific element in an array of strings.
Iterate through the array and keep track of the index of the first and last occurrence of the element.
Return the first and last index once the iteration is complete.
Example: Array ['apple', 'banana', 'apple', 'orange'], element 'apple' - First index: 0, Last index: 2.
I appeared for an interview in Dec 2024.
To delete the nth node from the end in a linked list, we can use a two-pointer approach.
Use two pointers, one to traverse the list and another to keep track of the nth node from the end.
Move the second pointer n steps ahead of the first pointer.
When the second pointer reaches the end of the list, the first pointer will be at the nth node from the end.
Adjust the pointers to delete the nth node.
I applied via Recruitment Consulltant and was interviewed before Jan 2023. There were 2 interview rounds.
Program to check if a number is a palindrome.
Convert the number to a string to easily check for palindrome
Reverse the string and compare it with the original string
If they are the same, the number is a palindrome
Hooks are a feature in React that allow you to use state and other React features in functional components.
Hooks were introduced in React 16.8.
They allow you to use state and other React features without writing a class.
Commonly used hooks include useState, useEffect, useContext, and useReducer.
Hooks must be used at the top level of your functional component.
Example: const [count, setCount] = useState(0);
Design a high-level architecture for a software system
Identify the main components of the system
Define the interactions between the components
Consider scalability, security, and performance
Choose appropriate technologies and frameworks
Create a diagram to visualize the architecture
based on 1 interview
Interview experience
based on 6 reviews
Rating in categories
Product Manager
33
salaries
| ₹9 L/yr - ₹22 L/yr |
Software Engineer
31
salaries
| ₹3.9 L/yr - ₹12 L/yr |
Senior Software Engineer
27
salaries
| ₹8 L/yr - ₹22.1 L/yr |
Assistant Manager
25
salaries
| ₹5 L/yr - ₹7.6 L/yr |
Senior Analyst
25
salaries
| ₹3.1 L/yr - ₹4.5 L/yr |
MagicPin
Awign Enterprises
Nestaway
Ketto