i
Dream11
Filter interviews by
Identify data structure based on insertion and deletion order
If insertion and deletion follow LIFO order, it is a stack
If insertion follows FIFO order and deletion follows LIFO order, it is a queue
If insertion and deletion follow priority order, it is a priority queue
Find maximum element in an array in less than O(N)
Use divide and conquer approach
Compare maximum of left and right subarrays
Recursively find maximum element
I applied via Approached by Company and was interviewed in Feb 2022. There were 2 interview rounds.
I applied via Approached by Company and was interviewed before Oct 2022. There were 3 interview rounds.
I applied via Approached by Company and was interviewed before May 2023. There were 2 interview rounds.
30 mins test on leetcode
I applied via Approached by Company and was interviewed before Jul 2021. There were 2 interview rounds.
They given 2 program to to 1-2 hour
posted on 13 Oct 2024
I applied via LinkedIn and was interviewed in Apr 2024. There were 4 interview rounds.
Medium level questions with a senior engineer
Medium level questions
Manager round with technical and culture fit
I applied via Recruitment Consulltant and was interviewed before Nov 2022. There were 4 interview rounds.
A set questions where you would be asked the possible output of codes give as an MCQ
3 coding questions : easy medium and hard
posted on 14 Oct 2015
Find minimum number of weighings required to find the heavier coin out of 100 coins with a balance.
Divide the coins into 3 groups of 33 each and weigh 2 groups against each other.
If one group is heavier, divide it into 3 groups of 11 each and weigh 2 groups against each other.
Repeat the process until the heavier coin is found.
Minimum number of weighings required is 4.
Prims and Kruskal's algorithms are used to find the minimum spanning tree in a graph.
Prims algorithm starts with a single vertex and adds the minimum weight edge to the tree until all vertices are included.
Kruskal's algorithm starts with all vertices as separate trees and merges them by adding the minimum weight edge until all vertices are included.
Both algorithms have a time complexity of O(E log V) where E is the num...
Delete nodes in a linked list which have greater value on right side
Traverse the linked list and compare each node with its right side node
If the current node's value is less than its right side node, delete the current node
Repeat the process until the end of the linked list is reached
Code for reversing a linked list
Create a new empty linked list
Traverse the original linked list and insert each node at the beginning of the new list
Return the new list
Methods are functions that perform a specific task, while constructors are special methods that initialize objects.
Constructors have the same name as the class they belong to.
Constructors are called automatically when an object is created.
Constructors can be overloaded with different parameters.
Methods can be called multiple times with different arguments.
Methods can have a return type, while constructors do not.
based on 1 interview
Interview experience
Software Development Engineer II
46
salaries
| ₹23 L/yr - ₹60 L/yr |
Software Developer
31
salaries
| ₹19 L/yr - ₹49.8 L/yr |
Sde1
29
salaries
| ₹10.8 L/yr - ₹31 L/yr |
Product Manager
24
salaries
| ₹26 L/yr - ₹45 L/yr |
Software Development Engineer
21
salaries
| ₹20 L/yr - ₹54 L/yr |
Uplers
Impact Guru
Tracxn
MagicBricks