Dream11 | Lead Engineer | Mumbai
Summary
I interviewed last summer for a Lead Engineer backend position at Dream11 in Mumbai. I successfully solved all three Data Structures and Algorithms questions. However, the interview process was indefinitely stalled due to new government policies related to gaming.
Full Experience
I interviewed last summer for a lead engineer backend position.
Round 1: DSA round.
Q1: Find least difference in occurrence of two nos. x and y in an array. Assume that these would occur at least once.
Q2: Subset sum in an array with sum k
Q3: Can an array be divided into partitions such that each partition has a sequence having adjacent difference as 1 and size = k. It's there on the leetcode
Solved all of them.
Then BJP government came up with the curbing policies on gaming saying sab chupchap kam dhandha karo ab bhot bna li Dream11 pe team. With that, the interview process was stalled indefinitely.
Interview Questions (3)
Least Difference in Occurrence of Two Numbers
Find the least difference in occurrence of two numbers, x and y, in an array. Assume that these would occur at least once.
Subset Sum with Target K
Given an array, find if there is a subset that sums up to k.
Array Partition with Adjacent Difference 1 and Size K
Can an array be divided into partitions such that each partition has a sequence having adjacent difference as 1 and size = k?