Skip to content
  • Courses
  • Resources
  • Blog
  • About
Menu
  • Courses
  • Resources
  • Blog
  • About
STUDENT LOGIN
  • Courses
  • Resources
  • Blog
  • About
  • Student Login
Menu
  • Courses
  • Resources
  • Blog
  • About
  • Student Login

Coding Interview Question: Matrix Product

  • April 4, 2017

Matrix Product: Coding Interview Question

Question

Given a matrix, find the path from top left to bottom right with the greatest product by moving only down and right.

eg.

1
2
3
4
5
6
7
8
9
10
11
12
13
[1, 2, 3]
[4, 5, 6]
[7, 8, 9]
 
1 -> 4 -> 7 -> 8 -> 9
2016
 
[-1, 2, 3]
[4, 5, -6]
[7, 8, 9]
 
-1 -> 4 -> 5 -> -6 -> 9
1080

Once you think that you’ve solved the problem, click below to see the solution.

 

As always, remember that practicing coding interview questions is as much about how you practice as the question itself. Make sure that you give the question a solid go before skipping to the solution. Ideally if you have time, write out the solution first by hand and then only type it into your computer to verify your work once you've verified it manually. To learn more about how to practice, check out this blog post.


Solution

How was that problem? You can check out the solution in the video below.

Here is the source code for the solution shown in the video (Github):

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
public static int matrixProduct(int[][] matrix) {
    if (matrix.length == 0 || matrix[0].length == 0) return 0;
        
    // Create cache of min and max product to a given cell
    int[][] maxCache = new int[matrix.length][matrix[0].length];
    int[][] minCache = new int[matrix.length][matrix[0].length];
        
    // Fill caches. We start at the top  left and iteratively find the greatest
    // at smallest path to each subsequent cell by considering the greatest and
    // smallest path to the cells above and to the left of the current cell
    for (int i = 0; i < matrix.length; i++) {
        for (int j = 0; j < matrix[0].length; j++) {
            int maxVal = Integer.MIN_VALUE;
            int minVal = Integer.MAX_VALUE;
              
            // If you're in the top left corner, just copy to cache
            if (i == 0 && j == 0) {
                maxVal = matrix[i][j];
                minVal = matrix[i][j];
            }
                
            // If we're not at the top, consider the value above
            if (i > 0) {
                int tempMax = Math.max(matrix[i][j] * maxCache[i-1][j], matrix[i][j] * minCache[i-1][j]);
                maxVal = Math.max(tempMax, maxVal);
                int tempMin = Math.min(matrix[i][j] * maxCache[i-1][j], matrix[i][j] * minCache[i-1][j]);
                minVal = Math.min(tempMin, minVal);
            }
            // If we're not on the left, consider the value to the left
            if (j > 0) {
                int tempMax = Math.max(matrix[i][j] * maxCache[i][j-1], matrix[i][j] * minCache[i][j-1]);
                maxVal = Math.max(tempMax, maxVal);
                int tempMin = Math.min(matrix[i][j] * maxCache[i][j-1], matrix[i][j] * minCache[i][j-1]);
                minVal = Math.min(tempMin, minVal);
            }
            maxCache[i][j] = maxVal;
            minCache[i][j] = minVal;
        }
    }
        
    // Return the max value at the bottom right
    return maxCache[maxCache.length - 1][maxCache[0].length - 1];
}

Did you get the right answer to this coding interview question? Please share your thoughts in the comments below.

DON'T DO ANOTHER CODING INTERVIEW...

...until you've mastered these 50 questions!

GET YOUR FREE GUIDE

RECOMMENDED ARTICLES

data structures

Article

The Definitive Guide to Data Structures for Coding Interviews

Data structures are critical to coding interview success. In this post, I'll show you exactly which data structures you need to know to nail your interviews.

Article

Acing the Google Interview: The Ultimate Guide

Acing the Google interview. Every engineer's dream. But the Google interview is really hard. In this post, you'll learn exactly how to prepare effectively.
stuck on coding interview

Article

10 ways to get unstuck and never fail another coding interview

It happens time and again. People fail coding interviews because they don’t know what to do when stuck on a problem. Developing a clear plan of attack helps you to succeed at any whiteboard coding interview.
Envelope Twitter Facebook Linkedin Youtube

© Byte by Byte 2016-2022

Privacy Policy

Terms and Conditions

Earnings Disclaimer

What if coding interviews were easy?

Sounds impossible right? It’s not!

Let me show you the RIGHT way to study for interviews so you can ace your Google Interview without breaking a sweat.

Download my FREE guide to the 50 most common coding interview questions asked at companies like Google, Facebooks, and Amazon.

Download my FREE guide to the 50 most common coding interview questions asked at companies like Google, Facebooks, and Amazon.

Get fully prepared for your Coding Interview and save 20% with Exponent. Learn More  →