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 output will be True as we can get 26 by adding A and B like (7 + 7 + 7 + 5).To solve this, we will follow these steps −Define a function util() . This will take x, a, b, is_ok, targetif x > target, thenreturnif is_ok[x] is True, thenreturnis_ok[x] ... 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], then the output will be True as the sequence is [Push, Pop, Push, Push, Pop, Push] as we are not popping element from empty list so these operations are valid.To solve this, we will follow these steps −push_count := 0for i in range 0 to size of nums - 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 same.To solve this, we will follow these steps −num_str := n as stringfor i in range 0 to size of num_str - 1, doif num_str[i] is not nay of ['0', '1', '8'] then, thenreturn Falseleft := 0right := size of num_str - 1while left < right, doif num_str[left] is not ... 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 the output will be True, as the most frequent character in s is 's'. And there are same number of occurrences of 's' in t.To solve this, we will follow these steps −freq := a map containing all characters of s and their frequenciesmax_freq_char = character in s where frequency ... 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 range 0 to n - 1, doleft := 0, right := n - 1while left

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 if we get transpose of top right sub-matrix of size 2x2 of mat1, we will get mat2.To solve this, we will follow these steps −row := row count of matricescolumn := column count of matricesfor i in range 0 to row - 1, dotemp1 := a new list, temp2 := ... 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 any number of operations or not.So, if the input is like100101100then the output will be True as we can perform the operation on the top left square sub-matrix of size (2x2) on mat1 to get mat2.To solve this, we will follow these steps −row := row count of mat1column := ... 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 uppercase will be same.So, if the input is like s = "piPpIePE", then the output will be True, as occurrences of lowercase letters and uppercase letters are same, and they are in the same order in lowercase and uppercase also.To solve this, we will follow these steps −lowercase := blank ... 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, 6, 4, 2], then the output will be True.To solve this, we will follow these steps −Define a function solve_iter(). This will take headif head is null, thenreturn Truewhile next of head is not null, docurrent := headif value of current value of (next of head) is not 0 ... Read More

Suppose we have two binary tree. We have to check whether leaf traversal of these two trees are same or not. As we know the leaf traversal is sequence of leaves traversed from left to right.So, if the input is likethen the output will be True as the left traversal sequence of both of the trees are same, that is [5, 7, 8].To solve this, we will follow these steps −s1 := a new list, s2 := another new listinsert r1 into s1 and r2 into s2while s1 and s2 are not empty, doif s1 is empty or s2 is ... Read More