Collecting Disappearing Coins - Amazon Top Interview Questions


Problem Statement :


You are given a two-dimensional list of integers matrix where each matrix[r][c] represents the number of coins in that cell. When you pick up coins on matrix[r][c], all the coins on row r - 1 and r + 1 disappear, as well as the coins at the two cells matrix[r][c + 1] and matrix[r][c - 1]. Return the maximum number of coins that you can collect.

Constraints

n, m ≤ 250 where n and m are the number of rows and columns in matrix

Example 1

Input

matrix = [
    [1, 7, 6, 5],
    [9, 9, 3, 1],
    [4, 8, 1, 2]
]

Output

22

Explanation

We can pick cells with the coins 7, 5, and 8 and 2.


Solution :



title-img 




                        Solution in C++ :

int best(vector<int>& v) {
    // return the maximum sum of elements given that you can't choose adjacent elements
    int n = v.size();
    // dp[i] is the maximum sum you can get considering exactly the first i elements
    vector<int> dp(n + 1);
    for (int i = 0; i < n; i++) {
        // don't choose element i
        dp[i + 1] = max(dp[i + 1], dp[i]);
        // choose element i
        dp[i + 1] = max(dp[i + 1], v[i] + (i == 0 ? 0 : dp[i - 1]));
    }
    return dp[n];
}

int solve(vector<vector<int>>& matrix) {
    vector<int> rows;
    for (auto& row : matrix) {
        rows.push_back(best(row));
    }
    return best(rows);
}
                    


                        Solution in Java :

import java.util.*;

class Solution {
    public int solve(int[][] matrix) {
        if (matrix == null || matrix.length == 0)
            return 0;
        int[] arr = new int[matrix.length];

        for (int i = 0; i < matrix.length; i++) arr[i] = getMaximumNonAdjacentSum(matrix[i]);

        return getMaximumNonAdjacentSum(arr);
    }

    private int getMaximumNonAdjacentSum(int[] arr) {
        if (arr.length == 0)
            return 0;
        if (arr.length == 1)
            return arr[0];
        if (arr.length == 2)
            return Math.max(arr[0], arr[1]);

        int[] dp = new int[arr.length];
        dp[0] = arr[0];
        dp[1] = Math.max(arr[0], arr[1]);

        for (int i = 2; i < arr.length; i++) dp[i] = Math.max(dp[i - 1], arr[i] + dp[i - 2]);
        return dp[arr.length - 1];
    }
}
                    


                        Solution in Python : 
                            
class Solution:
    def best(self, l):
        canadd = 0
        cannotadd = 0
        for elem in l:
            if isinstance(elem, list):
                elem = self.best(elem)
            canadd, cannotadd = cannotadd, max(cannotadd, canadd + elem)
        return cannotadd

    def solve(self, matrix):
        return self.best(matrix)


View More Similar Problems

Tree: Level Order Traversal

Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the function levelOrder and print the values in a single line separated by a space. For example: 1 \ 2 \ 5 / \ 3 6 \ 4 F

View Solution →

Binary Search Tree : Insertion

You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function. Input Format You are given a function, Node * insert (Node * root ,int data) { } Constraints No. of nodes in the tree <

View Solution →

Tree: Huffman Decoding

Huffman coding assigns variable length codewords to fixed length input characters based on their frequencies. More frequent characters are assigned shorter codewords and less frequent characters are assigned longer codewords. All edges along the path to a character contain a code digit. If they are on the left side of the tree, they will be a 0 (zero). If on the right, they'll be a 1 (one). Only t

View Solution →

Binary Search Tree : Lowest Common Ancestor

You are given pointer to the root of the binary search tree and two values v1 and v2. You need to return the lowest common ancestor (LCA) of v1 and v2 in the binary search tree. In the diagram above, the lowest common ancestor of the nodes 4 and 6 is the node 3. Node 3 is the lowest node which has nodes and as descendants. Function Description Complete the function lca in the editor b

View Solution →

Swap Nodes [Algo]

A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from

View Solution →

Kitty's Calculations on a Tree

Kitty has a tree, T , consisting of n nodes where each node is uniquely labeled from 1 to n . Her friend Alex gave her q sets, where each set contains k distinct nodes. Kitty needs to calculate the following expression on each set: where: { u ,v } denotes an unordered pair of nodes belonging to the set. dist(u , v) denotes the number of edges on the unique (shortest) path between nodes a

View Solution →