Suppose we have a N*M matrix A, this is the representation of 3D figure. The height of the building at point (i, j) is A[i][j]. We have to find the surface area of the figure.So, if the input is like N = 3, M = 3, A = [[1, 4, 5], [3, 3, 4], [1, 3, 5]], then the output will be 72.To solve this, we will follow these steps −res := 0for i in range 0 to N, dofor j in range 0 to M, doup_side := 0left_side := 0if i > 0, thenup_side := array[i - 1, j]if ... Read More

Suppose we have an array of integers A; we have to find all the values for sum so that for a value sum[i] the array can be divided into sub-arrays of sum sum[i]. If we cannot divide the array into sub-arrays of equal sum then return -1.So, if the input is like A = [2, 4, 2, 2, 2, 4, 2, 6], then the output will be [6, 8, 12] as the array can be divided into sub-arrays of sum 6, 8 and 12. These are as follows: [{2, 4}, {2, 2, 2}, {4, 2}, {6}] [{2, 4, 2}, {2, ... Read More

Suppose we have three sorted arrays A, B, and C (these can be of different sizes), we have to find compute the minimum absolute difference between the maximum and minimum number of any triplet (A[i], B[j], C[k]) such that they are under arrays A, B and C respectively, So, if the input is like A : [ 2, 5, 6, 9, 11 ], B : [ 7, 10, 16 ], C : [ 3, 4, 7, 7 ] , then the output will be 1 as by selecting A[i] = 6 B[j] = 7 and C[k] = 7, we will ... Read More

Suppose we have an array A of n values (elements may not be distinct). We have to find the sum of maximum difference possible from all subsets of given array. Now consider max(s) denotes the maximum value in any subset, and min(s) denotes the minimum value in the set. We have to find the sum of max(s)-min(s) for all possible subsets.So, if the input is like A = [1, 3, 4], then the output will be 9.To solve this, we will follow these steps −n := size of Asort the list Asum_min := 0, sum_max := 0for i in range ... Read More

Suppose we have a given integer N; we have to find the sum of all Truncatable primes less than N. As we know the truncatable prime is a number which is left-truncatable prime (if the leading "left" digit is successively removed, then all resulting numbers are treated as prime) as well as right-truncatable prime (if the last "right" digit is successively removed, then all the resulting numbers are treated as prime). An example of truncatable prime is 9137 as this is lefttruncatable prime because 9137, 137, 37 and 7 are primes. Hence 9137 is a truncatable prime.So, if the input ... Read More

Suppose we have two strings s1 and s2, we have to find the smallest substring in s1 such that all characters of s2 will be used efficiently.So, if the input is like s1 = "I am a student", s2 = "mdn", then the output will be "m a studen"To solve this, we will follow these steps −N := 26str_len := size of main_str, patt_len := size of patternif str_len < patt_len, thenreturn Nonehash_pat := an array of size N and fill with 0hash_str := an array of size N and fill with 0for i in range 0 to patt_len, dohash_pat[ASCII ... Read More

Suppose we have a sorted array of positive numbers, this array is sorted in ascending order, er have to find the smallest positive value that cannot be represented as sum of elements of any subset of given set. We have to solve this problem in O(n) time.So, if the input is like A = [1, 4, 8, 12, 13, 17], then the output will be 2.To solve this, we will follow these steps −n := size of Aanswer := 1for i in range 0 to n, doif A[i]

Suppose we have a Markov chain graph g; we have the find the probability to reach the state F at time T if we start from state S when time t = 0. As we know a Markov chain is a random process consisting of various states and the probabilities to move one state to another. This can be represented as a directed graph; the nodes are states and the edges have the probability of going from one node to another. From one state to another, it takes unit time to move. The sum of the probabilities of the outgoing ... Read More

Suppose we have two arrays A and B. The size of A is the number of rows and A[i] is the number of boxes in the ith row. And B is the array of balls where B[i] denotes a number on the ball. Given that ball i (value B[i]) will be placed in a box whose position from starting is B[i]. We have to find the row and column of the boxes corresponding to each B[i].So, if the input is like A = [3, 4, 5, 6], B = [1, 3, 5, 2], then the output will be [(1, 1), ... Read More

Suppose we have a string S with lowercase letters, now two players are playing the game. The rules are as follows −The player wins the game, if, at any move, a player can shuffle the characters of the string to get a palindrome string.The player cannot win when he/she has to remove any character from the string.We have to keep in mind that both players play the game optimally and player1 starts the game. We have to find the winner of the game.So, if the input is like "pqpppq", then the output will be Player1 as player-1 in the first ... Read More