Binary Search Interview Questions

I got this question in Amazon OA: [https://leetcode.com/problems/minimum-time-to-complete-all-deliveries/description/](https://leetcode.com/problems/minimum-time-to-complete-all-deliveries/description

Problem Statement We need to manage a robotic warehouse where N storage racks hold various packages. Each rack has a specific capacity (given in an array), which represents the number of...

The interviewer was Chinese. We started by discussing the information on my resume and asking some basic technical questions. Then came a data structure design question, similar to one from LeetCode's

Time Series class Write a time series class that stores and accesses double values based on time_t. The class should be capable of storing up to the most recent 5000 seconds of data. You should provid

**Round 1 Interview Structure** * **Resume Discussion:** 15 minutes. * **Data Structures and Algorithms:** 45 minutes. **Problem Statements** 1. **Split Array Largest Sum:** Given an array of integers

Assume, there is a Data store which stores documents, where each document has a field, documentDate, of string type in the format YYYYMMDDhhmmss. Assume there is an Api, GetDocumentsCount(string datePrefix), which...

LeetCode #2817: Minimum Absolute Difference Between Elements With Constraint. Difficulty: Medium. Topics: Array, Binary Search, Ordered Set. Asked at Capital One in the last 6 months.

LeetCode #2141: Maximum Running Time of N Computers. Difficulty: Hard. Topics: Array, Binary Search, Greedy, Sorting. Asked at Capital One in the last 6 months.

LeetCode #410: Split Array Largest Sum. Difficulty: Hard. Topics: Array, Binary Search, Dynamic Programming, Greedy, Prefix Sum. Asked at Infosys in the last 6 months.

LeetCode #33: Search in Rotated Sorted Array. Difficulty: Medium. Topics: Array, Binary Search. Asked at Infosys in the last 6 months.

LeetCode #658: Find K Closest Elements. Difficulty: Medium. Topics: Array, Two Pointers, Binary Search, Sliding Window, Sorting, Heap (Priority Queue). Asked at Yandex in the last 6 months.

LeetCode #33: Search in Rotated Sorted Array. Difficulty: Medium. Topics: Array, Binary Search. Asked at Yandex in the last 6 months.

LeetCode #528: Random Pick with Weight. Difficulty: Medium. Topics: Array, Math, Binary Search, Prefix Sum, Randomized. Asked at Two Sigma in the last 6 months.

LeetCode #1011: Capacity To Ship Packages Within D Days. Difficulty: Medium. Topics: Array, Binary Search. Asked at Agoda in the last 6 months.

LeetCode #981: Time Based Key-Value Store. Difficulty: Medium. Topics: Hash Table, String, Binary Search, Design. Asked at Axon in the last 6 months.

LeetCode #875: Koko Eating Bananas. Difficulty: Medium. Topics: Array, Binary Search. Asked at Swiggy in the last 6 months.

LeetCode #4: Median of Two Sorted Arrays. Difficulty: Hard. Topics: Array, Binary Search, Divide and Conquer. Asked at Capgemini in the last 6 months.

LeetCode #1648: Sell Diminishing-Valued Colored Balls. Difficulty: Medium. Topics: Array, Math, Binary Search, Greedy, Sorting, Heap (Priority Queue). Asked at MathWorks in the last 6 months.

LeetCode #1889: Minimum Space Wasted From Packaging. Difficulty: Hard. Topics: Array, Binary Search, Sorting, Prefix Sum. Asked at IMC in the last 6 months.

LeetCode #981: Time Based Key-Value Store. Difficulty: Medium. Topics: Hash Table, String, Binary Search, Design. Asked at Gusto in the last 6 months.

LeetCode #2563: Count the Number of Fair Pairs. Difficulty: Medium. Topics: Array, Two Pointers, Binary Search, Sorting. Asked at McDonalds in the last 6 months.

LeetCode #981: Time Based Key-Value Store. Difficulty: Medium. Topics: Hash Table, String, Binary Search, Design. Asked at Compass in the last 6 months.

LeetCode #1283: Find the Smallest Divisor Given a Threshold. Difficulty: Medium. Topics: Array, Binary Search. Asked at CleverTap in the last 6 months.

LeetCode #3477: Fruits Into Baskets II. Difficulty: Easy. Topics: Array, Binary Search, Segment Tree, Simulation, Ordered Set. Asked at Udemy in the last 6 months.

LeetCode #4: Median of Two Sorted Arrays. Difficulty: Hard. Topics: Array, Binary Search, Divide and Conquer. Asked at Udemy in the last 6 months.