Search⌘ K
AI Features
Home
Courses
Decode the Coding Interview in Elixir: Real-World Examples

Sparse Matrix Multiplication

Explore how to multiply two sparse matrices by converting them into hash maps to store only non-zero elements. Understand the algorithmic implementation, and analyze time and space complexities to prepare for coding interview challenges.

We'll cover the following...

Description

We have two sparse matrices, A and B.

“A sparse matrix is one in which most of the elements are zero.”

You need to multiply the two matrices and return the output matrix. You can assume that A’s column number is equal to B’s row number.

Constraints

The following are some constraints:

  • 1 <= A.length, B.length <= 100
  • 1 <= A[i].length, B[i].length <= 100
  • -100 <= A[i][j], B[i][j] <= 100

Let’s review this scenario using the example below:

Coding exercise

Elixir
defmodule Solution do
  def multiply(_a, _b) do
    # write your code here
  end
end

Solution

We have two sparse matrices, meaning most of the matrices’ elements are zero. We can represent the input matrices as hashmaps, and only save the non-zero elements and ...