Split Array with Minimum Largest Sum

You are given an array of integers $nums$ of size $N$ and an integer $K$. Your task is to split the array into **exactly K non-empty contiguous subarrays** such that the **largest sum** among these subarrays is minimized. Return the minimized largest sum. ## Function Declaration ### Function Name $splitArray$ – This function splits an array into $K$ contiguous subarrays and minimizes the maxim