Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
Articles by Arnab Chakraborty
Page 108 of 377
Find missing element in a sorted array of consecutive numbers in Python
Suppose we have an array A of n unique numbers, these n elements are present in the array in ascending order, but there is one missing element. We have to find the missing element.So, if the input is like A = [1, 2, 3, 4, 5, 6, 7, 9], then the output will be 8.To solve this, we will follow these steps −n := size of Aleft := 0right := n - 1mid := 0while right > left , domid := left +(right - left) / 2if A[mid] - mid is same as A[0], thenif A[mid + 1] - A[mid] ...
Read MoreFind the largest multiple of 3 from array of digits - Set 2 in C++
Suppose we have an array of different digits; we have to find the largest multiple of 3 that can be generated by concatenating some of the given digits in that array in any order. The answer may be very large so make it as string. If there is no answer return an empty string.So, if the input is like [7, 2, 8], then the output will be 87.To solve this, we will follow these steps −Define one 2D array d, there will be three rowssort the array digitssum := 0for initialize i := 0, when i < size of digits, ...
Read MoreFind N distinct numbers whose bitwise Or is equal to K in Python
Suppose we have two integers N and K; we have to find N unique values whose bit-wise OR is same as K. If there is no such result, then return -1So, if the input is like N = 4 and K = 6, then the output will be [6, 0, 1, 2].To solve this, we will follow these steps −MAX := 32visited := a list of size MAX and fill with Falseres := a new listDefine a function add() . This will take numpoint := 0value := 0for i in range 0 to MAX, doif visited[i] is non-zero, thengo for ...
Read MoreFind the largest Perfect Subtree in a given Binary Tree in Python
Suppose we have a given Binary Tree; we have to find the size of largest Perfect sub-tree in that given Binary Tree. As we know the perfect binary tree is a binary tree in which all internal nodes have two children and all leaves are at the identical level.So, if the input is likethen the output will be 3, and the subtree isTo solve this, we will follow these steps −Define one block called RetType, this will hold isPerfect, height and rootTree, they are all initially 0Define a function called get_prefect_subtree(), this takes rootr_type := a new RetTypeif root is ...
Read MoreFind n-th lexicographically permutation of a strings in Python
Suppose we have a string whose length is m, and this string is containing only lowercase letters, we have to find the n-th permutation of string lexicographically.So, if the input is like string = "pqr", n = 3, then the output will be "qpr" as all permutations are [pqr, prq, qpr, qrp, rpq, rqp], they are in sorted order.To solve this, we will follow these steps −MAX_CHAR := 26MAX_FACT := 20factorials := an array of size MAX_FACTfactorials[0] := 1for i in range 1 to MAX_FACT, dofactorials[i] := factorials[i - 1] * isize := size of stringoccurrence := an array of ...
Read MoreFind the largest rectangle of 1’s with swapping of columns allowed in Python
Suppose we have a binary matrix, we have to find the largest rectangle of all 1's in that given matrix. The rectangle can be built by swapping or exchanging any pair of columns of that matrix.So, if the input is like100101001111010then the output will be the 6 in this case. The rectangle can be generating by exchanging column 1 with 3. The matrix after exchanging will be −001100011110110To solve this, we will follow these steps −row := size of matcol := size of mat[0]temp := a matrix of order (row + 1) x (col + 1), and fill with 0for ...
Read MoreFind nth term of a given recurrence relation in Python
Suppose we have a sequence of numbers called bn, this is represented using a recurrence relation like b1=1 and bn+1/bn=2n . We have to find the value of log2(bn) for a given n.So, if the input is like 6, then the output will be 5 as log2(bn) = (n * (n - 1)) / 2 = (6*(6-1))/2 = 15We can solve this problem by solving this relation as follows −bn+1/bn = 2nbn/bn-1 = 2n-1…b2/b1 = 21 , If we multiply all of above, we can get(bn+1/bn).(bn/bn-1)……(b2/b1) = 2n + (n-1)+……….+1So, bn+1/b1 = 2n(n+1)/2As 1 + 2 + 3 + ………. ...
Read MoreFind original numbers from gcd() every pair in Python
Suppose we have an array A where GCD of every possible pair of elements of another array is given, we have to find the original numbers which are used to compute the given GCD array.So, if the input is like A = [6, 1, 1, 13], then the output will be [13, 6] as gcd(13, 13) is 13, gcd(13, 6) is 1, gcd(6, 13) is 1, gcd(6, 6) is 6To solve this, we will follow these steps −n := size of Asort array A in descending orderoccurrence := an array of size A[0] and fill with 0for i in range ...
Read MoreFind the lexicographically largest palindromic Subsequence of a String in Python
Suppose we have a string S; we have to find the lexicographically largest palindromic subsequence of that string.So, if the input is like "tutorialspointtutorial", then the output will be "uu"To solve this, we will follow these steps −ans := blank stringmax_val := s[0]for i in range 1 to size of s, domax_val := maximum of max_val, s[i]for i in range 0 to size of s, doif s[i] is same as max_val, thenans := ans + s[i]return ansExample Let us see the following implementation to get better understanding −def largest_palindromic_substr(s): ans = "" max_val = s[0] for i in ...
Read MoreFind pairs with given product in a sorted Doubly Linked List in Python
Suppose we have a sorted doubly linked list of unique positive numbers; we have to find pairs in the doubly linked list whose product is same as a given value x. We have to keep in mind that, this will be solved without consuming any extra space.So, if the input is like L = 1 ⇔ 2 ⇔ 4 ⇔ 5 ⇔ 6 ⇔ 8 ⇔ 9 and x = 8, then the output will be (1, 8), (2, 4)To solve this, we will follow these steps −curr := head, nxt := headwhile nxt.next is not None is non-zero, donxt ...
Read More