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
-
Economics & Finance
Python Articles
Page 104 of 855
Check if product of array containing prime numbers is a perfect square in Python
Suppose we have an array nums with all prime numbers. We have to check whether the product of all numbers present in nums is a perfect square or not.So, if the input is like nums = [3, 3, 7, 7], then the output will be True as product of all elements in nums is 441 which is a perfect square as 21^2 = 441.To solve this, we will follow these steps −m := a map containing all elements in nums and their frequenciesfor each key in nums, doif m[key] is odd, thenreturn Falsereturn TrueExampleLet us see the following implementation to ...
Read MoreCheck if product of digits of a number at even and odd places is equal in Python
Suppose we have a number n. We have to check whether the product of odd placed digits and the even placed digits are same or not.So, if the input is like n = 2364, then the output will be True as product of odd placed numbers are 2 * 6 = 12 and product of even placed numbers are 3 * 4 = 12 which are same.To solve this, we will follow these steps −if num < 10, thenreturn Falseodd_place := 1, even_place := 1while num > 0, dod := last digit of numodd_place := odd_place * dnum := quotient ...
Read MoreCheck if product of first N natural numbers is divisible by their sum in Python
Suppose we have a number n. We have to check whether the product of (1*2*...*n) is divisible by (1+2+...+n) or notSo, if the input is like num = 5, then the output will be True as (1*2*3*4*5) = 120 and (1+2+3+4+5) = 15, and 120 is divisible by 15.To solve this, we will follow these steps −if num + 1 is prime, thenreturn falsereturn trueExampleLet us see the following implementation to get better understanding −def isPrime(num): if num > 1: for i in range(2, num): if num % i == 0: return False return True return False def solve(num): if isPrime(num + 1): return False return True num = 3 print(solve(num))Input5OutputTrue
Read MoreSerialize and Deserialize BST in Python
Suppose we want to design an algorithm to serialize and deserialize a binary search tree. Serialization is the process of converting something (data structure or object) into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link. This can be reconstructed later that process is deserialization.So, if the input is like [5, 2, 9, 1, 3, 7], then the output will be Serialized output 5.2.9.1.3.7.N.N.N.N.N.N.N Deserialized output: 1, 2, 3, 5, 7, 9, (inorder traversal)To solve this, we will follow these steps −Define a function serialize() . ...
Read MoreProgram to convert one list identical to other with sublist sum operation in Python
Suppose we have two lists l1 and l2, we have to make the lists equal by applying this operation repeatedly − Choose a sublist, and replace the whole sublist with its sum. Finally return the size of the longest resulting list possible after applying above operations. If there's no solution, return -1.So, if the input is like l1 = [1, 4, 7, 1, 2, 10] l2 = [5, 6, 1, 3, 10], then the output will be 4, as if we perform this operation as follows −Take l1's sublist [1, 4] we get [5, 7, 1, 2, 10]Take l1's sublist ...
Read MoreProgram to find number of coins needed to make the changes in Python
Suppose we have coins of different denominations (1, 5, 10, 25) and a total amount of money amount. We have to define one function to compute the fewest number of coins that we need to make up that amount. So if the input is 64, the output is 7. This is formed using 25 + 25 + 10 + 1 + 1 + 1 + 1 = 64.To solve this, we will follow these steps −if amount = 0, then return 0if minimum of coins array > amount, then return -1define one array called dp, of size amount + 1, ...
Read MoreProgram to make pairwise adjacent sums small in Python
Suppose we have a list of non-negative numbers say nums and a non-negative value k. Now suppose we can perform an operation where we select a single positive umber in nums and decrease it by 1. We have to find the minimum number of operations required such that every pair of adjacent values in the list sums
Read MoreProgram to find maximum sum of non-adjacent nodes of a tree in Python
Suppose we have a binary tree, we have to find the maximum sum of the values that can be obtained given no two values can be adjacent parent to child.So, if the input is likethen the output will be 17 as 10, 4, 3 are not adjacent to each other.To solve this, we will follow these steps −Define a function f() . This will take nodeif node is null, thenreturn (0, 0)(a, b) := f(left of node)(c, d) := f(right of node)return a pair (maximum of value of node + b + d and a + c, a + c)from ...
Read MoreProgram to maximize the minimum value after increasing K sublists in Python
Suppose we have a list of numbers called nums and two values, size and k. Now suppose there is an operation where we take a contiguous sublist of length size and increment every element by one. We can perform this operation k times, we have to find the largest minimum value possible in nums.So, if the input is like nums = [2, 5, 2, 2, 7], size = 3, k = 2, then the output will be 3, as we can increase [2, 5, 2] to get [3, 6, 3, 2, 7] and then increment [6, 3, 2] to get ...
Read MoreProgram to find maximum length of non-sharing words in Python
Suppose we have a list of lowercase alphabetical strings called words, we have to find the maximum sum of the lengths of two distinct words that do not share a common letter. So, if the input is like words = ["abcd", "mno", "abdcmno", "amno"], then the output will be 7, as the words do not share any common letters are ["abcd", "mno"], total length is 7.To solve this, we will follow these steps −Define a function sign() . This will take wordvalue := 0for each c in word, dovalue := value OR (2^(ASCII of c - ASCII of 'a'))return valueFrom ...
Read More