Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
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
Suppose we have an array called nums and another value k, we have to check whether LCM of nums is divisible by k or not.So, if the input is like nums = [12, 15, 10, 75] k = 10, then the output will be True as the LCM of the array elements is 300 so this is divisible by 10.To solve this, we will follow these steps −for i in range 0 to size of nums - 1, doif nums[i] is divisible by k, thenreturn Truereturn FalseExampleLet us see the following implementation to get better understanding − Live Demodef solve(nums, k) ... Read More
Suppose we have some weights like a^0, a^1, a^2, …, a^100, here 'a' is an integer, and we also have a weighing scale where weights can be put on both the sides of that scale. We have to check whether a particular item of weight W can be measured using these weights or not.So, if the input is like a = 4, W = 17, then the output will be True the weights are a^0 = 1, a^1 = 4, a^2 = 16, we can get 16 + 1 = 17.To solve this, we will follow these steps −found := ... Read More
Suppose we have an array of numbers called nums, and also have another value K. We have to check whether we can partition the array nums into K contiguous subarrays such that the elements sum of each subarrays is equal.So, if the input is like nums = [2, 5, 3, 4, 7] k = 3, then the output will be True as we can make three partitions like [(2, 5), (3, 4), (7)] all have equal sum 7.To solve this, we will follow these steps −n := size of numscumul_sum := cumulative sum of all elements in numstotal_sum := cumul_sum[n ... Read More
Suppose we have two strings s and t, t is in uppercase. We have to check whether we can convert s to t by performing following operations.Convert some lowercase letters uppercase.Remove all of the lowercase letters.So, if the input is like s = "fanToM", t = "TOM", then the output will be True as we can change ‘o’ to ‘O’ then remove all other lowercase letters from s to make it t.To solve this, we will follow these steps −n := size of s, m := size of tdp:= a matrix of size (m + 1)x(n + 1) and fill ... Read More
Suppose there is an island. There is only one store in that location, this store remains open always except Sunday. We have following values as input −N (Maximum number of food someone can buy each day).S (Number of days someone is required to survive).M (Number of food required each day to survive).If it is Monday, and we need to survive for the next S number of days. We have to check whether we can survive or not, if we can find the minimum number of days on which we need to buy food, so that we can survive the next ... Read More