Register for our webinar

### How to Nail your next Technical Interview

1 hour
1
Enter details
2
Select webinar slot
*Invalid Name
*Invalid Name
By sharing your contact details, you agree to our privacy policy.
Step 1
Step 2
Congratulations!
You have registered for our webinar
Oops! Something went wrong while submitting the form.
1
Enter details
2
Select webinar slot
*All webinar slots are in the Asia/Kolkata timezone
Step 1
Step 2
Confirmed
You are scheduled with Interview Kickstart.
Redirecting...
Oops! Something went wrong while submitting the form.

## You may be missing out on a 66.5% salary hike*

### Nick Camilleri

Head of Career Skills Development & Coaching
*Based on past data of successful IK students
Help us know you better!

## How many years of coding experience do you have?

Thank you! Your submission has been received!
Oops! Something went wrong while submitting the form.

## FREE course on 'Sorting Algorithms' by Omkar Deshpande (Stanford PhD, Head of Curriculum, IK)

Thank you! Please check your inbox for the course details.
Oops! Something went wrong while submitting the form.
Our June 2021 cohorts are filling up quickly. Join our free webinar to Uplevel your career

# Matrix Subtraction Problem Statement

Given two matrices of the same dimensions, return the resultant matrix of their subtraction.

## Example

``````{
"matrix1": [
[1, 2, 3],
[10, 11, 12]
],
"matrix2": [
[7, 8, 9],
[4, 5, 6]
]
}
``````

Output:

``````[
[-6, -6, -6],
[6, 6, 6]
]
``````

## Notes

The two matrix operands of the subtraction operation are provided as two arguments, `matrix1` and `matrix2`, to the function. The function should return the result of the subtraction of `matrix2` from `matrix1`.

Constraints:

• 1 <= number of rows, number of columns <= 500
• 1 <= value of matrix elements <= 103

## Code For Matrix Subtraction Solution: Iterative

``````/*
Asymptotic complexity in terms of the number of rows ( = \`n\`) and the number of columns ( = \`m\`):
* Time: O(n * m).
* Auxiliary space: O(1).
* Total space: O(n * m).
*/

vector<vector<int>> matrix_subtraction(vector<vector<int>> &matrix1, vector<vector<int>> &matrix2) {
int number_of_rows = matrix1.size();
int number_of_columns = matrix1[0].size();

// We'll store the result of the subtraction operation in the argument variable \`matrix1\` in-place and return it
// at the end. This way, we won't need any additional memory space for the resultant matrix, and so the auxiliary
// space complexity would stay at O(1).
for(int i = 0; i < number_of_rows; i++){
for(int j = 0; j < number_of_columns; j++){
matrix1[i][j] = matrix1[i][j] - matrix2[i][j];
}
}

return matrix1;
}

``````

We hope that these solutions to the matrix subtraction problem have helped you level up your coding skills. You can expect problems like these at top tech companies like Amazon and Google.

If you are preparing for a tech interview at FAANG or any other Tier-1 tech company, register for Interview Kickstart’s FREE webinar to understand the best way to prepare.

Interview Kickstart offers interview preparation courses taught by FAANG+ tech leads and seasoned hiring managers. Our programs include a comprehensive curriculum, unmatched teaching methods, and career coaching to help you nail your next tech interview.

We offer 18 interview preparation courses, each tailored to a specific engineering domain or role, including the most in-demand and highest-paying domains and roles, such as:

‍To learn more, register for the FREE webinar.

### Try yourself in the Editor

Note: Input and Output will already be taken care of.

# Matrix Subtraction Problem Statement

Given two matrices of the same dimensions, return the resultant matrix of their subtraction.

## Example

``````{
"matrix1": [
[1, 2, 3],
[10, 11, 12]
],
"matrix2": [
[7, 8, 9],
[4, 5, 6]
]
}
``````

Output:

``````[
[-6, -6, -6],
[6, 6, 6]
]
``````

## Notes

The two matrix operands of the subtraction operation are provided as two arguments, `matrix1` and `matrix2`, to the function. The function should return the result of the subtraction of `matrix2` from `matrix1`.

Constraints:

• 1 <= number of rows, number of columns <= 500
• 1 <= value of matrix elements <= 103

## Code For Matrix Subtraction Solution: Iterative

``````/*
Asymptotic complexity in terms of the number of rows ( = \`n\`) and the number of columns ( = \`m\`):
* Time: O(n * m).
* Auxiliary space: O(1).
* Total space: O(n * m).
*/

vector<vector<int>> matrix_subtraction(vector<vector<int>> &matrix1, vector<vector<int>> &matrix2) {
int number_of_rows = matrix1.size();
int number_of_columns = matrix1[0].size();

// We'll store the result of the subtraction operation in the argument variable \`matrix1\` in-place and return it
// at the end. This way, we won't need any additional memory space for the resultant matrix, and so the auxiliary
// space complexity would stay at O(1).
for(int i = 0; i < number_of_rows; i++){
for(int j = 0; j < number_of_columns; j++){
matrix1[i][j] = matrix1[i][j] - matrix2[i][j];
}
}

return matrix1;
}

``````

We hope that these solutions to the matrix subtraction problem have helped you level up your coding skills. You can expect problems like these at top tech companies like Amazon and Google.

If you are preparing for a tech interview at FAANG or any other Tier-1 tech company, register for Interview Kickstart’s FREE webinar to understand the best way to prepare.

Interview Kickstart offers interview preparation courses taught by FAANG+ tech leads and seasoned hiring managers. Our programs include a comprehensive curriculum, unmatched teaching methods, and career coaching to help you nail your next tech interview.

We offer 18 interview preparation courses, each tailored to a specific engineering domain or role, including the most in-demand and highest-paying domains and roles, such as:

‍To learn more, register for the FREE webinar.

## Worried About Failing Tech Interviews?

Attend our free webinar to amp up your career and get the salary you deserve.

Hosted By
Ryan Valles
Founder, Interview Kickstart
Accelerate your Interview prep with Tier-1 tech instructors
360° courses that have helped 14,000+ tech professionals
100% money-back guarantee*