Count of odd sum Submatrix with odd element count in the Matrix
Last Updated :
11 Nov, 2023
Given a matrix mat[][] of size N x N, the task is to count the number of submatrices with the following properties:
- The sum of all elements in the submatrix is odd.
- The number of elements in the submatrix is odd.
Examples:
Input: mat[][] = {{1, 2, 3}, {7, 5, 9}, {6, 8, 10}}
Output: 8
Explanation: As here total 8 submatrix is available in given matrix in which no. of elements is odd and sum of elements is also odd list of that matrix are {{1}}, {{3}}, {{7}}, {{5}}, {{9}}, {{7, 5, 9}}, {{2}, {5}, {8}}, {{1, 2, 3}, {7, 5, 9}, {5, 9, 6}}
Input: mat[][] = {{15, 2, 31}, {17, 11, 12}, {16, 51, 10}, {13, 52, 18}}
Output: 14
Naive Approach: We can solve this problem using a brute force approach, where we consider all possible submatrices of the given matrix and check if they satisfy the given properties.
Below is the code for the above approach:
C++
// C++ code for the above approach:
#include <bits/stdc++.h>
using namespace std;
int oddSumOddElementCountSubmatrix(
vector<vector<int> >& mat)
{
// Size of given 2-D matrix
int n = mat.size();
int count = 0;
// Here we need all submatrix which
// contains odd no. of element in them.
// So all the matrix whose size is in
// form 1*3, 1*5, 1*7, 3*1, 3*3, 3*5,
// 3*7, 5*1, ... are valid submatrix
// now we need to check for that sum
// of element present in that
// submatrix is odd or not
// So this nested 4 for loop generates
// all submatrix with size as
// mentioned above
for (int rsize = 1; rsize <= n; rsize += 2) {
for (int csize = 1; csize <= n; csize += 2) {
for (int row = 0; row + rsize <= n; row++) {
for (int col = 0; col + csize <= n; col++) {
// Now do summation of
// element present in
// that subarray and if
// it's odd increment
// the count
int sum = 0;
for (int i = row; i < row + rsize;
i++) {
for (int j = col; j < col + csize;
j++) {
sum += mat[i][j];
}
}
if (sum % 2 == 1) {
count++;
}
}
}
}
}
// Return answer
return count;
}
// Drivers code
int main()
{
vector<vector<int> > mat
= { { 1, 2, 3 }, { 7, 5, 9 }, { 6, 8, 10 } };
// Function Call
cout << "Number of odd sum submatrices with odd number "
"of elements: "
<< oddSumOddElementCountSubmatrix(mat) << "\n";
return 0;
}
import java.util.*;
public class Main {
public static int oddSumOddElementCountSubmatrix(int[][] mat) {
// Size of given 2-D matrix
int n = mat.length;
int count = 0;
// Here we need all submatrix which
// contains odd no. of element in them.
// So all the matrix whose size is in
// form 1*3, 1*5, 1*7, 3*1, 3*3, 3*5,
// 3*7, 5*1, ... are valid submatrix
// now we need to check for that sum
// of element present in that
// submatrix is odd or not
// So this nested 4 for loop generates
// all submatrix with size as
// mentioned above
for (int rsize = 1; rsize <= n; rsize += 2) {
for (int csize = 1; csize <= n; csize += 2) {
for (int row = 0; row + rsize <= n; row++) {
for (int col = 0; col + csize <= n; col++) {
// Now do summation of
// element present in
// that subarray and if
// it's odd increment
// the count
int sum = 0;
for (int i = row; i < row + rsize; i++) {
for (int j = col; j < col + csize; j++) {
sum += mat[i][j];
}
}
if (sum % 2 == 1) {
count++;
}
}
}
}
}
// Return answer
return count;
}
// Drivers code
public static void main(String[] args) {
int[][] mat = { { 1, 2, 3 }, { 7, 5, 9 }, { 6, 8, 10 } };
// Function Call
System.out.println("Number of odd sum submatrices with odd number of elements: " + oddSumOddElementCountSubmatrix(mat));
}
}
//This code is contributed by tushar rokade
def oddSumOddElementCountSubmatrix(mat):
# Size of given 2-D matrix
n = len(mat)
count = 0
# Here we need all submatrix which
# contains odd no. of element in them.
# So all the matrix whose size is in
# form 1*3, 1*5, 1*7, 3*1, 3*3, 3*5,
# 3*7, 5*1, ... are valid submatrix
# now we need to check for that sum
# of element present in that
# submatrix is odd or not
# So this nested 4 for loop generates
# all submatrix with size as
# mentioned above
for rsize in range(1, n+1, 2):
for csize in range(1, n+1, 2):
for row in range(n-rsize+1):
for col in range(n-csize+1):
# Now do summation of
# element present in
# that subarray and if
# it's odd increment
# the count
subMatSum = 0
for i in range(row, row+rsize):
for j in range(col, col+csize):
subMatSum += mat[i][j]
if subMatSum % 2 == 1:
count += 1
# Return answer
return count
# Driver code
mat = [[1, 2, 3], [7, 5, 9], [6, 8, 10]]
print("Number of odd sum submatrices with odd number of elements: ", oddSumOddElementCountSubmatrix(mat))
// C# code for above approach
using System;
public class GFG {
public static int oddSumOddElementCountSubmatrix(int[][] mat) {
// Size of given 2-D matrix
int n = mat.Length;
int count = 0;
// Here we need all submatrix which
// contains odd no. of element in them.
// So all the matrix whose size is in
// form 1*3, 1*5, 1*7, 3*1, 3*3, 3*5,
// 3*7, 5*1, ... are valid submatrix
// now we need to check for that sum
// of element present in that
// submatrix is odd or not
// So this nested 4 for loop generates
// all submatrix with size as
// mentioned above
for (int rsize = 1; rsize <= n; rsize += 2) {
for (int csize = 1; csize <= n; csize += 2) {
for (int row = 0; row + rsize <= n; row++) {
for (int col = 0; col + csize <= n; col++) {
// Now do summation of
// element present in
// that subarray and if
// it's odd increment
// the count
int sum = 0;
for (int i = row; i < row + rsize; i++) {
for (int j = col; j < col + csize; j++) {
sum += mat[i][j];
}
}
if (sum % 2 == 1) {
count++;
}
}
}
}
}
// Return answer
return count;
}
// Drivers code
public static void Main() {
int[][] mat = new int[][] { new int[] { 1, 2, 3 },
new int[] { 7, 5, 9 },
new int[] { 6, 8, 10 } };
// Function Call
Console.WriteLine("Number of odd sum submatrices with odd number of elements: " +
oddSumOddElementCountSubmatrix(mat));
}
}
// This code is contributed by Vaibhav Nandan
function oddSumOddElementCountSubmatrix(mat) {
// Size of given 2-D matrix
let n = mat.length;
let count = 0;
// Here we need all submatrix which
// contains odd no. of element in them.
// So all the matrix whose size is in
// form 1*3, 1*5, 1*7, 3*1, 3*3, 3*5,
// 3*7, 5*1, ... are valid submatrix
// now we need to check for that sum
// of element present in that
// submatrix is odd or not
// So this nested 4 for loop generates
// all submatrix with size as
// mentioned above
for (let rsize = 1; rsize <= n; rsize += 2) {
for (let csize = 1; csize <= n; csize += 2) {
for (let row = 0; row + rsize <= n; row++) {
for (let col = 0; col + csize <= n; col++) {
// Now do summation of
// element present in
// that subarray and if
// it's odd increment
// the count
let sum = 0;
for (let i = row; i < row + rsize; i++) {
for (let j = col; j < col + csize; j++) {
sum += mat[i][j];
}
}
if (sum % 2 === 1) {
count++;
}
}
}
}
}
// Return answer
return count;
}
// Test case
let mat = [[1, 2, 3], [7, 5, 9], [6, 8, 10]];
console.log("Number of odd sum submatrices with odd number of elements: " + oddSumOddElementCountSubmatrix(mat));
OutputNumber of odd sum submatrices with odd number of elements: 8
Time Complexity: O(N6), as 6 nested for loop requires to make matrix as required
Auxiliary Space: O(1), no extra space used.
Efficient Approach: To solve the problem follow the below idea:
- To optimize the solution, we can use a technique called prefix sums. We can precompute the sum of all elements in the matrix up to a particular row and column and store it in a separate matrix. This precomputation will allow us to calculate the sum of any submatrix in constant time.
- Once we have precomputed the prefix sums, we can iterate over all possible submatrices and check if they satisfy the above properties. To check if the sum of elements in a submatrix is odd, we can subtract the prefix sum of the bottom-right corner from the prefix sum of the top-left corner. If the difference is odd, the sum of the submatrix is odd.
- To check if the number of elements in a submatrix is odd, we can count the number of rows and columns in the submatrix and check if their product is odd.
Below are the steps for the above approach:
- Initialize a prefix sum matrix with 0, of the same size as the given matrix.
- Precompute the prefix sums of all elements up to each row and column in the prefix sum matrix.
- prefixSum[i][j] = prefixSum[i - 1][j] + prefixSum[i][j - 1] - prefixSum[i - 1][j - 1] + matrix[i - 1][j - 1].
- Iterate over all possible submatrices in the given matrix.
- For each submatrix, calculate the sum of its elements using the prefix sum matrix.
- If the sum is odd, count the number of elements in the submatrix.
- If the number of elements is odd, increment the counter.
- Return the final count.
Below is the code for the above approach:
C++
// C++ code for the above approach:
#include <bits/stdc++.h>
using namespace std;
int countOddSumSubmatrices(vector<vector<int> >& matrix)
{
int n = matrix.size();
int m = matrix[0].size();
int count = 0;
// Initialize prefix sum matrix
vector<vector<int> > prefixSum(n + 1,
vector<int>(m + 1, 0));
// Precompute prefix sums
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
prefixSum[i][j] = prefixSum[i - 1][j]
+ prefixSum[i][j - 1]
- prefixSum[i - 1][j - 1]
+ matrix[i - 1][j - 1];
}
}
// Iterate over all submatrices
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
for (int k = i; k <= n; k++) {
for (int l = j; l <= m; l++) {
// Calculate sum of
// submatrix
int sum = prefixSum[k][l]
- prefixSum[i - 1][l]
- prefixSum[k][j - 1]
+ prefixSum[i - 1][j - 1];
// Check if sum is odd
// and number of
// elements is odd
if (sum % 2 == 1
&& ((k - i + 1) * (l - j + 1)) % 2
== 1) {
count++;
}
}
}
}
}
return count;
}
// Drivers code
int main()
{
vector<vector<int> > matrix
= { { 1, 2, 3 }, { 7, 5, 9 }, { 6, 8, 10 } };
int count = countOddSumSubmatrices(matrix);
// Function Call
cout << "Number of odd sum submatrices with odd number "
"of elements: "
<< count << endl;
return 0;
}
import java.util.*;
public class Main {
public static int countOddSumSubmatrices(int[][] matrix) {
int n = matrix.length;
int m = matrix[0].length;
int count = 0;
// Initialize prefix sum matrix
int[][] prefixSum = new int[n + 1][m + 1];
// Precompute prefix sums
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
prefixSum[i][j] = prefixSum[i - 1][j]
+ prefixSum[i][j - 1]
- prefixSum[i - 1][j - 1]
+ matrix[i - 1][j - 1];
}
}
// Iterate over all submatrices
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
for (int k = i; k <= n; k++) {
for (int l = j; l <= m; l++) {
// Calculate sum of submatrix
int sum = prefixSum[k][l]
- prefixSum[i - 1][l]
- prefixSum[k][j - 1]
+ prefixSum[i - 1][j - 1];
// Check if sum is odd and the number of elements is odd
if (sum % 2 == 1
&& ((k - i + 1) * (l - j + 1)) % 2 == 1) {
count++;
}
}
}
}
}
return count;
}
public static void main(String[] args) {
int[][] matrix = {{1, 2, 3}, {7, 5, 9}, {6, 8, 10}};
int count = countOddSumSubmatrices(matrix);
// Function Call
System.out.println("Number of odd sum submatrices with an odd number of elements: " + count);
}
}
def count_odd_sum_submatrices(matrix):
n = len(matrix)
m = len(matrix[0])
count = 0
# Initialize the prefix sum matrix
prefix_sum = [[0] * (m + 1) for _ in range(n + 1)]
# Precompute prefix sums
for i in range(1, n + 1):
for j in range(1, m + 1):
prefix_sum[i][j] = prefix_sum[i - 1][j] + prefix_sum[i][j - 1] - prefix_sum[i - 1][j - 1] + matrix[i - 1][j - 1]
# Iterate over all submatrices
for i in range(1, n + 1):
for j in range(1, m + 1):
for k in range(i, n + 1):
for l in range(j, m + 1):
# Calculate the sum of the submatrix
submatrix_sum = prefix_sum[k][l] - prefix_sum[i - 1][l] - prefix_sum[k][j - 1] + prefix_sum[i - 1][j - 1]
# Check if the sum is odd and the number of elements is odd
if submatrix_sum % 2 == 1 and ((k - i + 1) * (l - j + 1)) % 2 == 1:
count += 1
return count
# Driver's code
if __name__ == "__main__":
matrix = [
[1, 2, 3],
[7, 5, 9],
[6, 8, 10]
]
count = count_odd_sum_submatrices(matrix)
# Function Call
print(f"Number of odd sum submatrices with an odd number of elements: {count}")
using System;
class GFG
{
static int countOddSumSubmatrices(int[][] matrix)
{
int n = matrix.Length;
int m = matrix[0].Length;
int count = 0;
// Initialize prefix sum matrix
int[][] prefixSum = new int[n + 1][];
for (int i = 0; i <= n; i++)
{
prefixSum[i] = new int[m + 1];
}
// Precompute prefix sums
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
prefixSum[i][j] = prefixSum[i - 1][j]
+ prefixSum[i][j - 1]
- prefixSum[i - 1][j - 1]
+ matrix[i - 1][j - 1];
}
}
// Iterate over all submatrices
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
for (int k = i; k <= n; k++)
{
for (int l = j; l <= m; l++)
{
// Calculate sum of submatrix
int sum = prefixSum[k][l]
- prefixSum[i - 1][l]
- prefixSum[k][j - 1]
+ prefixSum[i - 1][j - 1];
// Check if sum is odd and number of elements is odd
if (sum % 2 == 1
&& ((k - i + 1) * (l - j + 1)) % 2 == 1)
{
count++;
}
}
}
}
}
return count;
}
public static void Main()
{
int[][] matrix = {
new int[] { 1, 2, 3 },
new int[] { 7, 5, 9 },
new int[] { 6, 8, 10 }
};
int count = countOddSumSubmatrices(matrix);
// Function Call
Console.WriteLine("Number of odd sum submatrices with odd number of elements: " + count);
}
}
function countOddSumSubmatrices(matrix) {
const n = matrix.length;
const m = matrix[0].length;
let count = 0;
// Initialize prefix sum matrix
const prefixSum = new Array(n + 1).fill(0).map(() => new Array(m + 1).fill(0));
// Precompute prefix sums
for (let i = 1; i <= n; i++) {
for (let j = 1; j <= m; j++) {
prefixSum[i][j] = prefixSum[i - 1][j] + prefixSum[i][j - 1] - prefixSum[i - 1][j - 1] + matrix[i - 1][j - 1];
}
}
// Iterate over all submatrices
for (let i = 1; i <= n; i++) {
for (let j = 1; j <= m; j++) {
for (let k = i; k <= n; k++) {
for (let l = j; l <= m; l++) {
// Calculate sum of submatrix
const sum = prefixSum[k][l] - prefixSum[i - 1][l] - prefixSum[k][j - 1] + prefixSum[i - 1][j - 1];
// Check if sum is odd and the number of elements is odd
if (sum % 2 === 1 && ((k - i + 1) * (l - j + 1)) % 2 === 1) {
count++;
}
}
}
}
}
return count;
}
// Driver code
const matrix = [
[1, 2, 3],
[7, 5, 9],
[6, 8, 10]
];
const count = countOddSumSubmatrices(matrix);
// Function call
console.log("Number of odd sum submatrices with odd number of elements: " + count);
OutputNumber of odd sum submatrices with odd number of elements: 8
Time Complexity: O(N4), as 4 nested for loop
Auxiliary Space: O(N2), extra space needed for prefix matrix.
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem