Business Analyst

You are given a binary matrix with ‘M’ rows and ‘N’ columns initially consisting of all 0s. 'Q' queries follow. The queries can be of 4 types:

Query 1: 1 R index
Query 2: 1 C index 
Query 3: 2 R index
Query 4: 2 C index

In each query, the first input is the type of the query, the second input is whether we have to consider the row ('R') or the column ('C') and the third input is the index of the row/column. 

For each type 1 query, we need to flip the elements of the row/column having the given index. 

For each type 2 query, we have to output the number of zeros present in the row/column having the given index. 

Note:

Note that the matrix is a binary matrix, meaning that it only contains either 0 or 1.

Example :

Given M = 3, N = 3, 
Queries : 1R1, 1R2, 2C1

So, in the above example the change in the matrix would look like this:

Next query 2C1 will return the count of the number of zeroes in the 1st column: 1

Ninja has a binary string ‘S’ of length ‘N’. Initially, all the characters in a string are ‘1’, i.e.

S[i] = ‘1’ for each 1 <= ‘i’ <= ‘N’.

An operation is defined as choosing a number between 1 to 4, and doing the following steps accordingly.

1. If the chosen number is 1, then flip all the characters in string.

2. If the chosen number is 2, then flip all the characters at odd indexes.

3. If the chosen number is 3, then flip all the characters at even indexes.

4. If the chosen number is 4, then flip all the characters at (3k + 1) indexes. 

You need to find out that after performing operations exactly ‘M’ number of times, how many distinct final strings can be there.

Note :

1. A binary string is a string in which all characters are either ‘1’ or ‘0’.

2. Flipping a character means that if the character is ‘1’ then change it to 0, or if it is ‘0’ then change it to ‘1’.

You are given a Singly Linked List of integers. Return true if it has a cycle, else return false.

A cycle occurs when a node's next points back to a previous node in the list.

Example:

In the given linked list, there is a cycle, hence we return true.