Coding questions
Dream11 Online Assessment
Overview
Here is how public prep guides and student write-ups describe the Dream11 online assessment. This is not an official company brochure.
Public archive is experience-hire heavy - label clearly when citing.
Usual selection rounds
Rounds students usually mention: Coding assessment / HackerRank → DSA / DB+projects → HLD → HM (experienced track)
| Item | From student reports |
|---|---|
| Platform | HackerRank (experienced-track posts) |
| Online test summary | Public detailed write-ups skew to SDE-2: HackerRank coding then deep design. Fresher campus OA, if any, must be confirmed separately. |
| Eligibility notes | Role-specific (many public posts are SDE-2 lateral) |
| Branches (reported) | Software |
Online test sections
| Section | Questions | Time | Notes |
|---|---|---|---|
| Coding assessment | - | - | Experienced-track reports |
Extra notes from sources
- Flag: sources are mostly non-fresher.
Sample practice question styles
These are practice questions for speed - not claimed to be from a real Dream11 live paper.
Coding Q1: Merge overlapping intervals
Problem: Given a list of intervals [start, end], merge all overlapping intervals and return the non-overlapping set that covers the same ranges.
Approach: Sort by start time. Walk once, merging into the last interval in the result when the next start is ≤ current end; otherwise append a new interval.
Complexity: O(n log n) time from the sort
Dream11 tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q2: Top K frequent elements
Problem: Given an integer array and an integer k, return the k most frequent elements. Order among equals can be arbitrary unless the problem says otherwise.
Approach: Count frequencies with a hash map, then use a heap of size k (or bucket sort by frequency) to extract the top k keys.
Complexity: O(n log k) with a heap
Dream11 tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q3: Linked list cycle
Problem: Given the head of a linked list, return true if there is a cycle and false otherwise.
Approach: Floyd’s tortoise and hare: move one pointer one step and another two steps. If they meet, a cycle exists. If the fast pointer hits null, there is no cycle.
Complexity: O(n) time, O(1) space
Dream11 tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q4: Binary tree level order
Problem: Given the root of a binary tree, return the level-order traversal (breadth-first) as a list of levels.
Approach: Use a queue. For each level, drain the current queue size, collect values, and enqueue children for the next level.
Complexity: O(n) time, O(n) space
Dream11 tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Prep tips from those student reports
- If fresher drive: ask recruiter for exact rounds
- If SDE-2: HLD + DSA + DB
Sources
These notes come from public reports and can differ by campus, year, and role. If your college placement email or the official careers/notification PDF says something different, follow that.