Snowflake Software Engineer OA 2025 | Data Pipeline Chunking & Cloud VPC Network

Problem 1 - Data Pipeline Chunking Problem Statement You are given an integer array rows where rows[i] represents the number of rows stored in the i-th data block. You must divide the sequence into exactly K contiguous chunks. The cost of a partitioning is defined as the maximum chunk sum among all chunks. Return the minimum possible cost. Constraints Constraint 1 ≤ rows.length ≤ 105 1 ≤ rows[i] ≤ 109 1 ≤ K ≤ rows.length Test Case Input Output rows ...