dream11 logo
Dream11· Lead Engineer

Dream11 | Lead Engineer | Mumbai

Location
Mumbai
Posted
4 Feb 2026
286 reads

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.

How it went

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.

Questions asked (3)

  1. 01

    Least Difference in Occurrence of Two Numbers

    Data Structures & Algorithms

    Find the least difference in occurrence of two numbers, x and y, in an array. Assume that these would occur at least once.

  2. 02

    Subset Sum with Target K

    Data Structures & Algorithms

    Given an array, find if there is a subset that sums up to k.

  3. 03

    Array Partition with Adjacent Difference 1 and Size K

    Data Structures & Algorithms

    Can an array be divided into partitions such that each partition has a sequence having adjacent difference as 1 and size = k?

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Dream11 recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!