i
Dream11
Filter interviews by
I applied via Naukri.com and was interviewed in Aug 2024. There was 1 interview round.
Find the Nth greatest element in an array without sorting
Use a priority queue to keep track of the N greatest elements
Iterate through the array and add elements to the priority queue
Return the top element from the priority queue as the Nth greatest element
Heater Problem - Find minimum radius to cover all houses with heaters
Sort the houses and heaters arrays
For each house, find the closest heater using binary search
Calculate the minimum radius needed to cover all houses
DSA, problem solving
System design interview and prior experience in projects
Experienced Senior Software Engineer with a passion for problem-solving and creating innovative solutions.
Over 8 years of experience in software development
Proficient in multiple programming languages such as Java, Python, and C++
Strong background in designing and implementing scalable systems
Led successful projects such as developing a real-time data analytics platform for a Fortune 500 company
What people are saying about Dream11
I applied via Approached by Company and was interviewed in Feb 2022. There were 2 interview rounds.
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 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 Oct 2022. There were 3 interview rounds.
I applied via Approached by Company and was interviewed before May 2023. There were 2 interview rounds.
I applied via Naukri.com and was interviewed in Sep 2023. There was 1 interview round.
I was interviewed before Feb 2021.
Round duration - 60 minutes
Round difficulty - Easy
It comprised of general aptitude questions and two coding questions. It was an offline test.
Given an integer N
, find all possible placements of N
queens on an N x N
chessboard such that no two queens threaten each other.
A queen can attack another queen if they ar...
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard where no two queens threaten each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not attack each other.
Generate and print valid configurations where queens are placed safely.
Consider constraints and time limit for efficient solution.
Exam...
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.
Iterate through the array and swap elements based on the values encountered.
Achieve sorting in a single scan over the array without using any extra space.
Round duration - 60 minutes
Round difficulty - Easy
After having a technical discussion about my CV. He gave me two questions to code.
Ninja has to determine all the distinct substrings of size two that can be formed from a given string 'STR' comprising only lowercase alphabetic characters. These su...
Find all unique contiguous substrings of size two from a given string.
Iterate through the string and extract substrings of size two
Use a set to store unique substrings
Return the set as an array of strings
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.
If the two pointers meet at any point, there is a cycle in the linked list.
If one of the pointers reaches the end of the list (null), there is no cycle.
Round duration - 30 minutes
Round difficulty - Easy
This was supposed to be the HR round but out of surprise the interviewer started by giving me a question to code.
After I approached this question with the right solution he just asked about my family. After that he said to wait. After half an hour the results were announced. A total of three students were hired and I was amongst one of them.
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Return the valid combinations as an array of strings.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 3 interviews
Interview experience
based on 1 review
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