Step through the algorithm visually — use Play or the step buttons (inspired by AlgoMaster / visualgo).
Nutanix interview context: Koko Eating Bananas is a Medium Binary Search problem — Binary search on index or on the answer (binary search on value).
Use the animation above to step through each move before writing code.
Pattern: Binary Search
Read from stdin, write to stdout. Classic interview problem #875.
Koko Eating Bananas — Nutanix interview prep · Binary Search
Classic interview problem #875.
Input (stdin)
Line 1: n piles\nLine 2: pile sizes\nLine 3: hours h
Output (stdout)
Minimum eating speed k
Your program must read from stdin and write the answer to stdout (no extra debug text).
4 3 6 7 11 8
4
| Test | Status | Details |
|---|
Ready — edit the code above and click Run or Submit.
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
class Program
{
static int[] Ria(string line = null)
{
line ??= Console.ReadLine();
if (string.IsNullOrWhiteSpace(line)) return Array.Empty<int>();
return line.Trim().Split(new[] { ' ', ',', '\t' }, StringSplitOptions.RemoveEmptyEntries)
.Select(int.Parse).ToArray();
}
static string[] Rsa()
{
int n = int.Parse(Console.ReadLine());
var arr = new string[n];
for (int i = 0; i < n; i++) arr[i] = Console.ReadLine();
return arr;
}
static void W(params object[] parts) => Console.WriteLine(string.Join(" ", parts));
static void Wb(bool v) => Console.WriteLine(v ? "true" : "false");
static void Wi(int v) => Console.WriteLine(v);
static void Ws(string v) => Console.WriteLine(v);
static void Main()
{
int n = int.Parse(Console.ReadLine());
var piles = Ria();
int h = int.Parse(Console.ReadLine());
bool Can(int speed) {
long hours = 0;
foreach (var p in piles) hours += (p + speed - 1) / speed;
return hours <= h;
}
int lo = 1, hi = piles.Max(), ans = hi;
while (lo <= hi) {
int mid = lo + (hi - lo) / 2;
if (Can(mid)) { ans = mid; hi = mid - 1; } else lo = mid + 1;
}
Wi(ans);
}
}Try solving on your own first, then reveal the official answer.