Dream11 Placement Papers 2026 — Complete Preparation Guide

Last Updated: March 2026

---

Company Overview

Dream11 is India's biggest fantasy sports platform with 150+ million users. It's a unicorn startup and one of the most sought-after tech companies for freshers.

Key Facts:

• Founded: 2008
• Employees: 1000+
• India Offices: Mumbai (HQ)
• Valuation: $8+ billion

---

Eligibility Criteria

Criteria	Requirement
Degree	B.Tech/B.E, M.Tech, MCA
Branches	CSE, IT, Math, Stats
Academic Score	70%+ throughout
Backlogs	No active backlogs

---

CTC & Compensation

Role	CTC (Fresher)
Software Development Engineer	15-25 LPA
Data Analyst	12-18 LPA
Product Analyst	14-20 LPA

---

Exam Pattern

Section	Questions	Duration
Aptitude + Puzzles	20	30 min
Coding	3-4	90 min
System Design (LLD)	1	60 min

---

Aptitude Questions

Q1

Find the missing number: 2, 6, 12, 20, 30, ? Answer: 42 (n×(n+1))

Q2

A and B can do work in 12 days, B and C in 15 days, C and A in 20 days. How long will A alone take? Answer: 30 days

Q3

Probability of getting sum 9 with two dice? Answer: 1/9

Q4

Two trains 200m and 300m approach at 60km/hr and 40km/hr. Time to cross? Answer: 18 seconds

Q5

Sum of squares of first 10 natural numbers? Answer: 385

---

Technical Questions

1. Design a leaderboard system
2. How would you handle 1 million concurrent users?
3. Explain CAP theorem
4. Difference between SQL and NoSQL with use cases
5. Rate limiting algorithms

---

Coding Questions (Python)

Q1: Top K Frequent Elements

def top_k_frequent(nums, k):
    from collections import Counter
    return [item for item, _ in Counter(nums).most_common(k)]

Q2: Design Snake and Ladder Game

class SnakeLadder:
    def __init__(self):
        self.snakes = {16: 6, 48: 26, 49: 11}
        self.ladders = {2: 38, 4: 14, 9: 31}
        self.players = {}
    
    def move(self, player, dice):
        pos = self.players.get(player, 0) + dice
        if pos in self.snakes:
            pos = self.snakes[pos]
        elif pos in self.ladders:
            pos = self.ladders[pos]
        self.players[player] = pos
        return pos

Q3: Find Celebrity Problem

def find_celebrity(matrix):
    """Everyone knows celebrity, celebrity knows no one"""
    n = len(matrix)
    candidate = 0
    for i in range(1, n):
        if matrix[candidate][i] == 1:
            candidate = i
    
    for i in range(n):
        if i != candidate and (matrix[candidate][i] == 1 or matrix[i][candidate] == 0):
            return -1
    return candidate

---

Interview Tips

1. Scale Understanding: Show knowledge of high-scale systems
2. Sports Interest: Passion for sports is a plus
3. Competitive Programming: Strong DSA is essential
4. Product Sense: Understand user behavior
5. Gaming Mechanics: Knowledge of fantasy sports helps

---

FAQs

Q1: Is Dream11 hiring freshers? Yes, limited campus hiring Q2: Coding platform? HackerRank, custom platform Q3: Interview rounds? 4-5 rounds including system design

---

All the best for your Dream11 placement!