Pika Tech Phone Screen: Text Justification & Subarray Inner Product Sum Problems

Two questions. The first question is a variation of the LeetCode problem, specifically the text justification problem, but with right alignment. The second question is to find the sum of the inner pro

Two questions. The first question is a variation of the LeetCode problem, specifically the text justification problem, but with right alignment. The second question is to find the sum of the inner products of all subarrays within an array. For example, given the array 1 2 3, the subarray would be 1, 2, 3, 1 2, 2 3, 1 2 3. The inner product would be 1, 2, 3, 2, 6, 6, which sums to 20.