Find minimal rate k and subset sum
Company: Uber
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: Medium
Interview Round: Technical Screen
##### Question
LeetCode 875. Koko Eating Bananas — Given vault sizes [3, 6, 7, 11] and time h = 8 hours, find the minimum integer rate k (vault units per hour) so the robber finishes within h hours.
Given integer set {2, 5, 3, 11} and target 10, decide if any subset sums to the target (subset-sum / N-sum).
https://leetcode.com/problems/koko-eating-bananas/description/
Quick Answer: This question evaluates algorithmic problem-solving skills, specifically search/optimization techniques for finding a minimal feasible rate and combinatorial reasoning for subset-sum problems, drawing on concepts such as binary-search-on-answer and dynamic programming.