Orange Cutting (Grid Simulation / BFS-Style) — 40 words Given an m×n grid where each cell has an orange with size. Cutting horizontally or vertically splits it into smaller valid pieces. Return the minimum number of cuts to make all pieces ≤ k. Use BFS/DP over states tracking segment sizes.

Priority Queue Scheduling — 40 words You get tasks with arrival time and processing time. Only one task runs at a time; always pick available task with smallest processing time using a min-heap. Return order of execution. Use sorting + priority queue

Orange Cutting (Grid Simulation / BFS-Style) — 40 words Given an m×n grid where each cell has an orange with size. Cutting horizontally or vertically splits it into smaller valid pieces. Return the minimum number of cuts to make all pieces ≤ k. Use BFS/DP over states tracking segment sizes.

Priority Queue Scheduling — 40 words You get tasks with arrival time and processing time. Only one task runs at a time; always pick available task with smallest processing time using a min-heap. Return order of execution. Use sorting + priority queue.