Interview experience
Dream11 interview experiences covering Online DSA Round(s), Technical Interview, Techno-Managerial / System Design, HR Round. Round-wise notes, common questions, and what candidates report clears each stage.
Dream11 Interview Questions and Answers (2026)
Dream11 is India's largest fantasy sports platform, where millions of users build teams and compete during live cricket and other sports. Founded in 2008, its engineering teams tackle peak concurrency challenges during major tournaments, making it a strong destination for backend and platform roles.
Explore: Interview experience · HR interview questions · Overview · Placement papers · Preparation guide
Overview
Dream11 runs a 4-5 round DSA-and-system-design-heavy loop typical of a high-traffic consumer product company, with extra weight on designing for the massive, predictable traffic spikes that hit right before live matches.
HR interview questions
Dream11 HR interview questions with sample answer frameworks - motivation, relocation, STAR stories, and culture-fit prompts.
Dream11 interview process at a glance
| Round | Duration | What they test |
|---|---|---|
| Online DSA Round(s) | 60-90 min | 2 LeetCode-style DSA problems per round |
| Technical Interview | 45-60 min | DSA (medium-hard), OS/OOPs/DBMS/SQL-NoSQL, projects/internship experience |
| Techno-Managerial / System Design | 45-60 min | Caching, load balancing, CDN, sharding, microservices |
| HR Round | 20-30 min | Fit, career aspirations, offer discussion |
Dream11 online assessment: quick answers
These answers are compiled from public candidate reports and prep guides, not from an official Dream11 notice, and drives differ. Public campus reports for Dream11 are few, so the instruction screen of your own test is the final word.
| Question | Answer |
|---|---|
| How many questions and how long? | Usually 2 DSA problems in about an hour per online round, with one or two such rounds. A November 2024 campus report on AmbitionBox describes 3 coding problems plus about 15 OOP and programming MCQs in one OA; another variant had 2 coding problems plus complexity MCQs. |
| Does it have negative marking? | No public report mentions any. |
| Is there a sectional cutoff? | Not reported. Candidates describe one shortlist across coding and MCQs. |
| How much is the cutoff? | Not published; shortlists are relative to the batch. No CGPA cutoff is published either; check your campus drive notice. |
| Which platform is it on? | A HackerRank-style proctored platform; the 2024 SDE-2 report does not name it. |
| What topics come up? | Minimum Path Sum and First Missing Positive (March 2024 SDE-2 OA); a binary search variant on a map of strings to lists and Remove K Digits (November 2024 SDE-2 online DSA round, 2 problems in 1 hour); four-sum, first and last index in a sorted array, DP, greedy, hashing and sliding window. |
| Do freshers get system design? | Often a light version. Campus loops add a techno-managerial round on caching, load balancing, CDN and sharding, framed around match-time traffic spikes. |
Dream11 interview questions by role
These topics come from GfG’s 2024 Dream11 SDE-2 interview experience, AmbitionBox campus reports and other candidate write-ups. They show the level and style, not a fixed list.
| Role | Reported questions and topics |
|---|---|
| SDE-1 (campus) | Coding OA with MCQs; a technical round on medium-hard DSA plus OS, OOP, DBMS, SQL vs NoSQL and a schema for a leaderboard or wallet; a techno-managerial round on caching, CDN, sharding and the CAP theorem. |
| SDE-2 | OA: Minimum Path Sum and First Missing Positive. Round 2: a past project’s internal architecture, database schema design, CDN vs load balancer, MySQL isolation levels and indexing. Round 3 (on-site, Mumbai): a scalable notification system for Dream11 users using Redis and Spark. A February 2025 SDE-2 backend loop (2 online rounds, then 3 on-site in Mumbai) opened on-site with designing a real-time monitoring tool like CloudWatch or Prometheus with Grafana. |
| SDE-3 / senior | Machine coding with concurrency (read-write locks, race conditions), then a database and resume discussion and an HLD round (LeetCode Discuss and Glassdoor reports). |
| Hiring manager round (SDE-2) | Your hiring philosophy if you were the interviewer, payment system implementations, service monitoring and availability metrics, past project failures and disagreements with managers. |
Asked across every role: why Dream11, a deep dive into one project, and how you would handle the traffic spike just before a live match.
Online DSA round(s)
One or two timed online rounds, roughly an hour each, with 2 DSA problems per round at LeetCode medium-hard difficulty. Campus reports (AmbitionBox Nov 2024) also describe 3 coding problems plus ~15 OOP/programming MCQs in a single OA, or 2 coding + complexity MCQs in a variant - confirm your drive mail. This is the widest filter in the process.
Common questions
- Array/string/graph problems at medium-hard difficulty (DP on arrays/strings, greedy, hashing, sliding window)
- Patterns seen in SDE-2 loops that sometimes appear in harder campus sets: four-sum, first/last index in sorted array, minimum path sum, custom comparators
- Time and space complexity trade-off discussion for your solution
- Edge-case handling under time pressure; finish one full AC before opening the harder problem
Technical interview
Mixes more DSA with core CS fundamentals - OS, OOPs, DBMS, and both SQL and NoSQL database questions - plus a real deep-dive into your projects or internship work, sometimes including schema design for a feature like a leaderboard or wallet.
Common questions
- Medium-to-hard DSA problems (trees, graphs, hashing)
- OOPs fundamentals and OS concepts (scheduling, concurrency)
- SQL vs NoSQL trade-offs; design a schema for a feature like contest leaderboards or wallet transactions
- Deep dive into your resume project or internship work
Techno-managerial / system design round
Built around the concrete scaling problem Dream11 actually has - a huge, predictable spike in traffic right before a live match starts. Expect questions framed around real product surfaces (notifications, leaderboards, wallet) rather than abstract system-design templates. SDE-2 onsite reports (GFG 2024, Medium 2024–2026) add lineup notifications ~30 minutes before match, digital wallet, real-time monitoring (metrics ingestion, time windows), and discussion of Redis internals, MySQL isolation/indexing, CDN vs load balancer, plus messaging trade-offs (Kafka vs RabbitMQ) and latency vs throughput.
Common questions
- Design a system to handle a sudden traffic spike right before a big match starts
- Design lineup notifications or a scalable push/fan-out path for millions of subscribed users
- Caching strategy and CDN usage for a high-read, bursty-traffic product
- Sharding and the CAP theorem in the context of a wallet or leaderboard service
- Microservices architecture trade-offs for a live-sports product
- Design a real-time leaderboard or notification system
- Geospatial or “closest X” service design with indexing follow-ups (some lateral loops)
Round-by-round breakdowns are on the Dream11 interview experience page.
HR round
A closing 20-30 minute round on fit, career aspirations, and offer discussion.
Common questions
- Tell me about yourself?
- Why Dream11?
- How would you design a system to handle a sudden traffic spike right before a big match starts?
- Tell me about a feature you’d build to keep users engaged during a live match.
Sample answer frameworks for each of these are on the Dream11 HR interview questions page.
Dream11 vs Dream Sports: which company is hiring?
Dream Sports is the parent company. Dream11, the fantasy sports app, is its largest brand, and the group also runs other sports products such as FanCode. Job posts and offer letters may name Dream Sports rather than Dream11, and some engineering teams work across brands.
The interview loop described here (coding OA, DSA and CS fundamentals, a system design round on match-day traffic, HR) is the Dream11 engineering loop. Parliament’s Promotion and Regulation of Online Gaming Act, 2025 banned money-based online games, and Dream11 stopped all paid contests on 22 August 2025, moving to a free-to-play social game and pointing to FanCode, DreamSetGo and Dream Game Studios for growth (Storyboard18, 22 August 2025). Check current openings and which product a team works on before you prepare a “Why Dream11?” answer around paid contests or wallets.
Common technical interview questions and answers
Q: How would you design a real-time leaderboard for a contest with millions of users?
Use a Redis sorted set per contest, keyed by contest id with the user id as member and score as the sort key. ZADD updates a score in O(log n), ZREVRANGE fetches the top N in O(log n + N), and ZREVRANK returns a specific user’s rank in O(log n), so both the top-100 view and the my-rank view are cheap. Persist authoritative scores to a durable store asynchronously so Redis can be rebuilt after failure, and shard by contest id since contests are independent. For very large contests, avoid recomputing ranks on every point event by batching score updates on a short interval and serving approximate rank tiers rather than exact rank to users far down the board.
Q: What is the CAP theorem, and what does it mean for a wallet service?
CAP states that a distributed system facing a network partition must choose between consistency and availability - it cannot have both, and partition tolerance is not optional in a real network. A wallet holding real money must choose consistency: it is better to reject a debit during a partition than to let the same balance be spent twice on two sides of the split. So wallets are built on strongly consistent stores with single-master or consensus-backed writes, using transactions and idempotency keys so a retried request cannot double-debit. Read-heavy, non-financial surfaces like contest listings or a leaderboard view can take the opposite trade-off and stay available on eventually consistent replicas.
Q: How would you handle the traffic spike right before a live match starts?
Treat the spike as predictable and pre-provision rather than react. Warm autoscaling groups and caches ahead of the toss window, push static contest and match metadata to a CDN so the origin never sees those reads, and keep hot data such as contest state and team rosters in Redis with cache-aside loading. Put the write path - joining a contest, wallet debit - behind a queue like Kafka so bursts are absorbed and consumed at a sustainable rate instead of overwhelming the database, and make each request idempotent so client retries are safe. Add rate limiting, per-service circuit breakers and graceful degradation, so that if the leaderboard service is struggling, contest joining still works.
Q: What is database sharding, and how would you shard a contest database?
Sharding splits one logical dataset horizontally across many database instances so writes and storage scale beyond a single machine, unlike read replicas which only scale reads. The key decision is the shard key: it must spread load evenly and keep the queries you actually run inside a single shard. For contests, sharding by contest id works well because almost every query - the participant list, the leaderboard, the join operation - is scoped to one contest, and contests are naturally independent. Consistent hashing limits how much data moves when a shard is added, and cross-shard queries such as a user’s contest history need either a secondary index keyed by user id or a separate read model.
Q: When would you choose NoSQL over a relational database?
Choose a relational database when the data is highly structured, relationships matter, and you need multi-row ACID transactions - a wallet ledger is the clearest example, because balance correctness depends on atomic debit and credit. Choose NoSQL when the access pattern is a known key lookup at very high volume, the schema varies, or you need horizontal write scaling and flexible replication more than joins. In practice a fantasy-sports product uses both: PostgreSQL or MySQL for wallets, orders and user accounts, a document or wide-column store for match and player statistics feeds, and Redis for leaderboards and sessions. The answer interviewers want is per-workload reasoning, not a blanket preference.
Q: What is the difference between a load balancer and a CDN?
A load balancer distributes incoming requests across a pool of backend servers in one region, using health checks to route away from failed instances and algorithms such as round robin, least connections or consistent hashing for sticky routing. A CDN is a geographically distributed cache that serves static and cacheable content - images, JavaScript bundles, player photos, cached API responses - from an edge location near the user, so the request never reaches your origin at all. They solve different problems: the CDN cuts latency and origin load for cacheable reads, while the load balancer spreads dynamic requests and provides failover. A high-traffic consumer product uses both, with the CDN sitting in front of the load balancer.
Q: How do you find the k largest elements in a stream of scores?
Maintain a min-heap of size k. Push the first k elements, then for each new score compare it with the heap root: if the new score is larger, pop the root and push the new score, otherwise discard it. The heap always holds the current top k and its root is the kth largest. Each element costs O(log k), so processing n elements is O(n log k) time with only O(k) space - far better than sorting the whole stream at O(n log n), and it works when the stream does not fit in memory. Interviewers often follow up by asking for the top k over a sliding time window, which needs a different structure such as a deque of time-bucketed heaps.
Q: What is the difference between a process and a thread, and how do deadlocks happen?
A process has its own address space, while threads inside a process share heap and globals but keep separate stacks and registers - which makes threads cheap to create and communicate but exposes them to data races. A deadlock occurs when four Coffman conditions hold simultaneously: mutual exclusion, hold-and-wait, no preemption, and circular wait. Breaking any one prevents it; the usual production fix is to impose a global lock ordering so a circular wait cannot form, or to acquire locks with a timeout and back off. In a wallet service this matters concretely: two concurrent transfers between the same pair of accounts will deadlock unless both lock the accounts in a fixed order, such as ascending account id.
Q: What is the difference between latency and throughput?
Latency is how long one request takes end-to-end; throughput is how many requests the system completes per unit time. You can raise throughput by batching or parallelizing while hurting tail latency for individual users, or cut latency with caching and shorter paths while capping aggregate throughput on a single hot shard. Dream11 cares about both during a match spike: contest join must stay low-latency for the user clicking “Join,” while the notification fan-out path must sustain high throughput without stalling the write path.
Q: When would you pick Kafka over RabbitMQ (or the reverse)?
Kafka is a durable, partitioned log built for high-throughput event streams with replay - a good fit for score feeds, contest events, or analytics pipelines where consumers can lag and catch up. RabbitMQ excels at flexible routing, per-message acknowledgements, and classic task queues with lower operational scale than a multi-partition log. For lineup notifications at massive fan-out, teams often use a log or queue for decoupling producers from push workers, with idempotent consumers so retries do not double-notify.
Q: How would you design push notifications before a match starts?
Schedule jobs from match fixtures (~30 minutes before start), enqueue notification tasks per segment (all users vs contest subscribers), use workers to build payloads from cached lineup data, and deliver through push providers with idempotency keys per user-match pair. Pre-warm caches, rate-limit per provider, and degrade to in-app banners if push backlog grows. Elastic scale matters: some contests have thousands of users, others millions - autoscale workers on queue depth, not clock time alone.
Q: How do you maintain the median of a running stream of scores?
Use two heaps: a max-heap for the lower half and a min-heap for the upper half, rebalancing so sizes differ by at most one. The median is the top of the larger heap or the average of both tops when equal size - O(log n) per insert, O(1) median read. This pattern appears in older Dream11 SDE-II screening reports alongside LRU-cache and top-view tree questions; it tests whether you know heap invariants, not only static array medians.
Q: How would you implement an LRU cache?
Combine a hash map from key to list node with a doubly linked list in access order. Get moves the node to the front; put evicts the tail when over capacity. Each operation is O(1) average. Mention thread safety only if asked - a contest metadata cache might use a single-threaded LRU per shard with explicit invalidation on updates.
Frequently asked questions about Dream11 interviews
Does the Dream11 online assessment have negative marking?
No public report mentions negative marking. The Dream11 OA is mainly coding - 2 LeetCode-style problems per round, or on some campus drives 3 coding problems plus about 15 OOP and programming MCQs - and no candidate report describes deductions for wrong MCQ answers.
What questions come in the Dream11 online assessment?
Medium-hard DSA problems. A March 2024 SDE-2 OA had Minimum Path Sum and First Missing Positive (O(n) time, O(1) space); other reports list four-sum, first and last index in a sorted array, DP on arrays and strings, greedy and sliding window.
What is Dream11’s interview process for freshers?
Dream11’s process typically has 4-5 rounds: 1-2 Online DSA Rounds (around an hour each, 2 problems per round), followed by onsite rounds - one or two Technical interviews on DSA and CS fundamentals (OS, OOPs, DBMS, SQL/NoSQL), a Techno-Managerial or System Design round, and a final HR round. The whole loop averages around 12 days end-to-end per candidate reports.
How many rounds does Dream11’s hiring process have?
Most candidates go through 4-5 rounds total: one or two online DSA rounds, a technical interview, a techno-managerial or system-design round, and an HR round. Experienced hires sometimes see an additional dedicated system design round split out separately.
What does the system design round at Dream11 focus on?
It focuses on concepts relevant to a high-traffic consumer product - caching, load balancers, the CAP theorem, sharding, and microservices architecture. Given Dream11’s user base spikes massively during live cricket/sports matches, interviewers are especially interested in how you’d design for sudden, large traffic surges - a recurring theme in candidate reports is designing notification, leaderboard, or wallet systems at scale.
What CS fundamentals come up in Dream11 technical interviews?
Beyond DSA, candidate reports mention OS, OOPs, DBMS, and both SQL and NoSQL database questions, plus database-schema design tied to a real feature (like contest leaderboards or wallet transactions). Interviewers also probe internship/project work and CDN/load-balancer basics.
How should I prepare for Dream11 interviews?
Practice medium-to-hard DSA on LeetCode-style platforms under time pressure, revise system design fundamentals (caching, load balancing, sharding, microservices, CDN), brush up OS/OOPs/DBMS and both SQL and NoSQL basics, be ready to walk through your internship/project work in detail, and think about how a fantasy-sports product would handle real-time scale, like millions of concurrent users joining contests right before a match starts.
What interviewers score
| Stage | Strong signal | Weak signal |
|---|---|---|
| Online DSA | Two medium-hard problems finished with complexity explained out loud | One partial with no edge cases or silent coding |
| Technical | Project schema + SQL/NoSQL trade-offs you can defend | Buzzwords without ownership of any module |
| HLD / techno-managerial | Match-spike design with cache, queue, wallet consistency | Generic “add microservices” with no load numbers |
| HR / HM | Match-day ownership STAR + honest Mumbai/Bengaluru logistics | Scripted “great product” with zero fantasy-sports hook |
Panels care that you reason about predictable traffic cliffs (pre-match joins, lineup notifications, wallets) the same way you reason about DSA. Narrate trade-offs; do not only paste Redis names.
Red flags that kill Dream11 offers
- Designing for “infinite scale” without shard keys, idempotency, or failure modes
- Claiming wallet work you cannot explain (double-debit, isolation, retries)
- Treating HM behavioural prompts as small talk after a strong coding day
- Refusing Mumbai/Bengaluru without stating constraints early
- Zero questions about on-call or match-day support
How to prepare for Dream11 interviews
- Loop map: Online DSA Round(s); Technical Interview; Techno-Managerial / System Design; HR Round. Confirm timings from the drive mail.
- Technical depth: Drill the Q&A section until answers are spoken, not read. Know every resume project cold.
- Experiences: Study round-wise notes on the interview experience page - real prompts beat generic lists.
- HR: Three STAR stories + a specific “Why Dream11?” on the HR page.
A practical Dream11 prep plan
Use this as a default four-week loop before a Dream11 drive. Adjust to your invite timeline.
- Week 1: Timed aptitude + one easy coding problem a day, plus a one-page cs fundamentals sheet. Open the Dream11 previous-year sets on this site and mark which sections ate your time. Write the timing on a sticky note. That number is more useful than a 200-problem LeetCode streak you never timed.
- Week 2: Most Dream11 drives fail people on the first timed paper or OA. Do three timed sits this week. After each one, log every miss in a two-column note: topic and why (slow, wrong formula, bad edge case, panic). The next sit should only add problems from that log.
- Week 3: Technical interviews at Dream11 usually want a clean project story, one or two CS fundamentals, and (if the process has it) a behavioral or values round. Write STAR stories on paper, not in your head. Practise “Why Dream11?” with one concrete product, lab, or business line - not a slogan.
- Week 4: Two full mocks, then only error-log topics - no new patterns. If you still have energy, redo only the questions you failed in week 2.
10-day crash version: Days 1-4 timed DSA, days 5-7 resume projects + CS fundamentals, days 8-9 mock interviews out loud, day 10 HR STAR stories on the HR page.
Compensation notes
Candidate-reported fresher/early-career packages for Dream11 often cite ₹15-30 LPA SDE-1 band. Treat forum numbers as ranges, not guarantees - confirm the written offer letter for your team and location.
Sources
Interview process details and sample questions on this site are editorially organized from public candidate reports and hiring write-ups, with round structure, prep notes, and company-specific framing added by our team. For round-by-round stories, see the Dream11 interview experience page. For OA papers and coding drills, use Dream11 on placementpapers.app. OA quick answers and role-wise questions draw on GfG’s Dream11 SDE-2 interview experience (2024), the campus reports already summarised in the round notes on this page, and LeetCode Discuss SDE-2 reports (November 2024 and February 2025) and Glassdoor reviews seen through search snippets. The paid-contest shutdown is from Storyboard18’s 22 August 2025 report on Dream11’s statement.