Employee of the Year

Problem Statement

Employee of the Year Problem Description Marie is a bank manager and has a team of N employees having ID numbers from 1 to N. Each employee has coins of different denominations M (1 to M). Marie is creating unique groups for the "Employee of the Year" felicitation event. These groups can be formed subject to the following conditions: 1. The sum of all the coins of each denomination in the group is an even number. 2. Each unique group must have at least 1 member who is not common to any other group. You are given a 2D integer array A, which represents the number of coins of each denomination for N employees. Your task is to help Marie find and return the number of possible unique groups. Note: Each unique group must have at least one member. Each employee must have at least T coin. Input Specification input1: An integer value N, representing the number of employees. input2: An integer value M, representing the number of different denominations. input3: A 2D integer array A of size N X M