Crush Consecutive Numbers - Amazon Top Interview Questions

Problem Statement :

You are given a list of positive integers nums and a positive integer k. Consider an operation where you merge exactly k consecutive numbers, which costs the sum of those numbers.

Given that you can make any number of operations, return the minimum cost necessary to merge all the numbers into one number. If it's not possible, return -1.


n ≤ 40 where n is the length of nums

2 ≤ k ≤ 40

nums[i] ≤ 100

Example 1


nums = [1, 2, 4, 3, 2]

k = 3




First we merge [1, 2, 4] into 7 to get [7, 3, 2] for a cost of 7.

Then we merge [7, 3, 2] to get [12] for a cost of 12.

Solution :


                        Solution in C++ :

int solve(vector<int>& nums, int k) {
    int n = nums.size();
    if ((n - 1) % (k - 1) != 0) return -1;

    vector<int> suff(n + 1);
    for (int i = n - 1; i >= 0; i--) {
        suff[i] = nums[i] + suff[i + 1];

    vector<vector<int>> dp(n, vector<int>(n));
    for (int sz = k; sz <= n; sz++) {
        for (int l = 0, r = sz - 1; r < n; l++, r++) {
            dp[l][r] = INT_MAX;
            // merge [l, i] into one pile, and the rest as much as possible
            for (int i = l; i < r; i += k - 1) {
                dp[l][r] = min(dp[l][r], dp[l][i] + dp[i + 1][r]);

            // after doing the above split, the interval [l, r] will be reduced to a size <= k
            // if it's reduced to k, we reduce it again to 1 by adding the final cost
            if ((r - l) % (k - 1) == 0) {
                dp[l][r] += suff[l] - suff[r + 1];

    return dp[0][n - 1];

                        Solution in Python : 
class Solution:
    def solve(self, nums, k):
        dp = [[None] * len(nums) for _ in range(len(nums))]

        def find(i, j):
            if i == j:
                return 0
            if k != 2 and (j - i + 1) % (k - 1) != 1:
                return math.inf
            if dp[i][j] is None:
                ans = sum(nums[i : j + 1])
                min_cost = math.inf
                for split in combinations(range(i + 1, j + 1), k - 1):
                    split = list(split) + [j + 1]
                    its_cost = find(i, split[0] - 1)
                    for ind in range(len(split) - 1):
                        its_cost += find(split[ind], split[ind + 1] - 1)
                    min_cost = min(min_cost, its_cost)
                dp[i][j] = ans + min_cost
            return dp[i][j]

        return find(0, len(nums) - 1) if find(0, len(nums) - 1) != math.inf else -1

View More Similar Problems

Poisonous Plants

There are a number of plants in a garden. Each of the plants has been treated with some amount of pesticide. After each day, if any plant has more pesticide than the plant on its left, being weaker than the left one, it dies. You are given the initial values of the pesticide in each of the plants. Determine the number of days after which no plant dies, i.e. the time after which there is no plan

View Solution →

AND xor OR

Given an array of distinct elements. Let and be the smallest and the next smallest element in the interval where . . where , are the bitwise operators , and respectively. Your task is to find the maximum possible value of . Input Format First line contains integer N. Second line contains N integers, representing elements of the array A[] . Output Format Print the value

View Solution →


You are a waiter at a party. There is a pile of numbered plates. Create an empty answers array. At each iteration, i, remove each plate from the top of the stack in order. Determine if the number on the plate is evenly divisible ith the prime number. If it is, stack it in pile Bi. Otherwise, stack it in stack Ai. Store the values Bi in from top to bottom in answers. In the next iteration, do the

View Solution →

Queue using Two Stacks

A queue is an abstract data type that maintains the order in which elements were added to it, allowing the oldest elements to be removed from the front and new elements to be added to the rear. This is called a First-In-First-Out (FIFO) data structure because the first element added to the queue (i.e., the one that has been waiting the longest) is always the first one to be removed. A basic que

View Solution →

Castle on the Grid

You are given a square grid with some cells open (.) and some blocked (X). Your playing piece can move along any row or column until it reaches the edge of the grid or a blocked cell. Given a grid, a start and a goal, determine the minmum number of moves to get to the goal. Function Description Complete the minimumMoves function in the editor. minimumMoves has the following parameter(s):

View Solution →

Down to Zero II

You are given Q queries. Each query consists of a single number N. You can perform any of the 2 operations N on in each move: 1: If we take 2 integers a and b where , N = a * b , then we can change N = max( a, b ) 2: Decrease the value of N by 1. Determine the minimum number of moves required to reduce the value of N to 0. Input Format The first line contains the integer Q.

View Solution →