Related Coding / DSA
Minimum Worst-Case Drops with Two Bulbs
Given two identical bulbs and a building with F floors, return the minimum number of drops needed in the worst case to guarantee identifying the critical threshold floor.
1. Problem Statement
You are given a list of room booking intervals, each as [start, end]. Merge all overlapping or touching intervals and return the minimal consolidated list, sorted by start time.
2. Live Coding Format
Work in the provided coding workspace while explaining your decisions to the live interviewer. Validation may use inline tests, examples, comments, or a verbal walkthrough.
3. Key Focus Areas
- 1Problem clarification and contract
- 2Approach exploration and optimality
- 3Think-aloud communication and pacing
- 4Implementation correctness
- 5Code quality and language fluency
- 6Tests and dry run
- 7Debugging and self-correction
- 8Complexity analysis
- 9Follow-up performance
4. What Strong Candidates Should Demonstrate
- Clarify whether touching endpoints count as overlapping and whether input is pre-sorted.
- Explain a pairwise baseline and improve it to an O(n log n) solution.
- Think aloud while implementing readable, correct merge logic.
- Validate with explicit expected outputs and a top-to-bottom dry run.
- Analyze time and space complexity and handle a bounded follow-up modification.
Want interactive feedback?
Practice this problem in the live coding workspace while the interviewer probes your clarification, implementation, trade-offs, and validation.
Continue to DashboardCore Concepts
Hidden because they name the technique, which a real interviewer would not tell you.
Show core concepts
IntervalsSortingGreedyComplexity Analysis
Continue preparing
Build a complete software engineer mock interview plan
Prepare by company
Related Coding / DSA
Track Connectivity Across a Growing Network
Given a number of servers and a sequence of direct connection events between pairs of servers, answer whether two given servers are connected after each event, handling many connections and queries efficiently.
Related Coding / DSA
Reverse a Segment of a Linked List
Given the head of a singly linked list and two positions m and n, reverse the nodes from position m to position n in place and return the new head.
Related Coding / DSA
Search in a Rotated Sorted Array
Given an array of distinct integers that was originally sorted ascending and then rotated at an unknown pivot, determine the index of a target value or report that it is absent.