i
Dream11
Filter interviews by
Search for a target value in a 2D matrix efficiently.
Use binary search on rows to find the potential row where the target value may exist.
Then use binary search on that row to find the target value.
Find quadraplets in an array that sum up to a target value.
Use a nested loop to iterate through all possible combinations of quadraplets.
Keep track of the sum of each quadraplet and compare it to the target value.
Return the quadraplets that match the target sum.
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 Jul 2021. There were 2 interview rounds.
They given 2 program to to 1-2 hour
I applied via Approached by Company and was interviewed before May 2023. There were 2 interview rounds.
I applied via Approached by Company and was interviewed before Oct 2022. There were 3 interview rounds.
I was interviewed before May 2022.
Basic on PHP and Javascript should be clear
Laravel framework based questions
Algo, basic Javascript
I applied via Campus Placement and was interviewed in Aug 2022. There were 3 interview rounds.
Questions from trees and linkedin
Reverse a linked list using multiple approaches.
Iterative approach: Use three pointers to reverse the links between nodes.
Recursive approach: Recursively reverse the rest of the list and adjust the links.
Stack approach: Push all the nodes onto a stack and then pop them to create the reversed list.
LRU Cache is a data structure that stores the most recently used items and discards the least recently used items.
Use a hash table to store key-value pairs
Use a doubly linked list to keep track of the order of items
When an item is accessed, move it to the front of the list
When the cache is full, remove the least recently used item from the back of the list
Lookup and insertion should be O(1) time complexity
Implement 2 stacks in an array
Divide the array into two halves
Use top1 and top2 to keep track of top elements of stacks
Push and pop elements from respective halves
Check for overflow and underflow conditions
25 basic aptitude asked from train,time and work
2 coding questions which was basic and medium questions
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Software Development Engineer II
46
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
30
salaries
| ₹0 L/yr - ₹0 L/yr |
Sde1
29
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
26
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
21
salaries
| ₹0 L/yr - ₹0 L/yr |
My11Circle
Fantasy Akhada
MyTeam11
BalleBaazi