Leetcode 2463. Minimum Total Distance Traveled

Assign each robot to a factory on the number line (each factory has a repair capacity) so every robot moves left or right to a factory and the total sum of absolute travel distances is minimized. Because crossings don't matter and positions are unique, the core challenge is optimally matching sorted robots to capacitated factories — typically solved with prefix-based dynamic programming.