JobsJob TrackerJob alerts

Dream11 · 17 questions

All 17Coding 10System Design 4Low-Level Design 2Behavioral 1
  • Map and Binary SearchCoding
  • Remove K DigitsCoding
  • Postgres and System DesignLow-Level Design
  • Design Alerting and Monitoring SystemSystem Design
  • Find element appearing more than 25 percent of the timeCoding
  • Reverse a specific section of a linked listCoding
  • Design validation system for team selection screenLow-Level Design
  • Design Lineup Notification SystemSystem Design
  • Minimum Path SumCoding
  • First Missing PositiveCoding
  • Interviewing Criteria and Disagreement HandlingBehavioral
  • Minimum Path Sum and First Missing PositiveCoding
  • DB Schema and Distributed SystemsSystem Design
  • Unique paths and next smaller elementCoding
  • DSA problemsCoding
  • DBMS and DSA mixCoding
  • System design conceptsSystem Design
← Dream11 questions
  1. Interview questions
  2. Dream11
  3. Map and Binary Search
CodingEasyReported in a candidate post, Nov 2024

Map and Binary Search

Filed under Dream11

The question

Given a map where keys are strings and values are lists, implement a solution using binary search to find a specific answer.

No write-up yet. Related questions below have one.

Related Dream11 questions

  • Find element appearing more than 25 percent of the time
  • Reverse a specific section of a linked list
  • First Missing Positive
  • Minimum Path Sum and First Missing Positive
  • Unique paths and next smaller element
Remove K Digits →

Collected from public candidate posts and coding forums. Updated Nov 2026.