AI InterviewSearch…Search problems, topics, or pages…Ctrl KGet started

Company

Dream11 coding interview questions

14 problems · 1 easy · 13 medium · judged by hidden tests in 13 languages

14problems

1 easy

13 medium

0 hard

Sign in to tick off what you solve.

Study plan: 14 problems · about 7 h 55 min

Start the study plan

Next up: Destroy Sequential Targets

Study plan

Dream11 study plan by topic

All 14 problems tagged Dream11 over 2 weeks, about 7 h 55 min of solving, grouped by technique in the order they build on each other — Counting, Two Pointers, Sliding Window and Prefix Sum and 7 more.

  1. Week 2: Breadth-First Search, Dynamic Programming

    about 1 h 10 min

    2 problems on Breadth-First Search and Dynamic Programming, easiest first within each topic.

Dream11 Coding Interview Questions: 14 Tagged Problems

14 coding problems tagged Dream11 — 1 easy · 13 medium — with solutions in 13 languages. Plus a 2-week study plan by topic.

  • Problems: 14
  • By difficulty: 1 easy · 13 medium
  • Languages: JavaScript, TypeScript, Python, Java, C++, C, C#, Go, Kotlin, Swift, Rust, PHP and Ruby
  • Cost: Free on every plan; sign in to run and submit

14 problems the CodeKairo catalogue tags as commonly asked in Dream11's coding rounds — 1 easy and 13 medium, no hard ones — each judged by hidden tests in 13 languages. The most common topics among them are Arrays (12), Greedy (4) and Dynamic Programming (4). Tagged for Dream11 and no other company: 3Sum Closest, Furthest Building You Can Reach and Partition Equal Subset Sum. The tag is the catalogue's own annotation of where a problem tends to come up — not a list published by Dream11, which CodeKairo is not affiliated with.

Dream11 study plan by topic

All 14 problems tagged Dream11 over 2 weeks, about 7 h 55 min of solving, grouped by technique in the order they build on each other — Counting, Two Pointers, Sliding Window and Prefix Sum and 7 more.

Week 1: Counting, Two Pointers, Sliding Window +6

12 problems on Counting, Two Pointers, Sliding Window, Prefix Sum, Stack, Monotonic Stack, Matrix, Greedy and Heap, easiest first within each topic.

Week 2: Breadth-First Search, Dynamic Programming

2 problems on Breadth-First Search and Dynamic Programming, easiest first within each topic.

All problems tagged Dream11

Easy (1)

Medium (13)

Topics Dream11 asks most