Hard data structure and algorithm practice puzzle.
Given an array and k, split it into k chunks in a row so the biggest chunk sum is as small as possible, and return that sum. Binary search the answer, between the biggest number and the total. For each guess, fill chunks from left to right and start a new one when the next number would go over. If that takes k chunks or fewer, try smaller.
Solve it three ways: snap the jigsaw pieces together, fill in the blanks, or type it from scratch against the tests. This one is free.
Every line of the solution comes with a note explaining why it is there, and a step by step replay shows the code running. At level 3, where you type it yourself, you can ask for an AI mock interview on this problem that ends with a hiring manager's scorecard.
Then grow it into a real project with the Software Engineer button: this puzzle becomes the Frame Bisector, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles