Suppose we have a number n, we have to check whether n is a Factorial prime or not. As we know a number is said to be a factorial prime when it is a prime number that is one less than or one more than a factorial of any number.So, ... Read More

Suppose we have a number target. We have another two numbers A and B. We have to check whether we can get target by adding A and B as many times as we want.So, if the input is like Target = 26 A = 5 B = 7, then the ... Read More

Suppose we have one binary list, where 1 denotes push operation and 0 denotes a pop operation on a stack or a queue. We have to check whether the possible set of operations are valid or not.So, if the input is like nums = [1, 0, 1, 1, 0, 1], ... Read More

Suppose we have a number n. We have to check whether the mirror image of the number is same as the given number or not when it is displayed on Seven Segment display.So, if the input is like n = 818, then the output will be True.the mirror image is ... Read More

Suppose we have two strings s and t, we have to select the most frequent character from s and then we have to check whether that particular character is present in t same number of times or not.So, if the input is like s = "crosssection", t = "securesystem", then ... Read More

Suppose we have a square matrix. We have to check whether the matrix remains same after performing row reversal operations on each row, or not.So, if the input is like686282333then the output will be TrueTo solve this, we will follow these steps −n := row count of matrixfor i in ... Read More

Suppose we have two N X M called mat1 and mat2. In an operation, we can transpose any square sub-matrix in mat1. We have to check whether we can get mat2 from mat1 or not by performing given operation.So, if the input is like567123689562173689then the output will be True, because ... Read More

Suppose we have two N X M binary matrices A and B. In a single operation, we can select a sub-matrix (at least 2x2) and convert the parity of the corner elements (flip bits). Finally, we have to check whether the matrix A can be converted to B by performing ... Read More

Suppose we have a string s with only lowercase or uppercase letters not numbers. We have to check whether both lowercase and uppercase letters follow the same order respectively or not. So, if a letter occurs more than once in lowercase then the occurrence of the same character in the ... Read More

Suppose we have a linked list we have to define two functions to check whether the linked list is sorted in non-increasing order or not. One of the method will work as iterative manner and another one in recursive manner.So, if the input is like L = [15, 13, 8, ... Read More