Programming Articles - Page 999 of 3363

Suppose we have a list of numbers called nums. We also have another number x. We have to find all numbers from nums which are less than x by filtering. In we use python there is one filter() method that takes function as argument and filter using this function.So, if the input is like nums = [1, 5, 8, 3, 6, 9, 12, 77, 55, 36, 2, 5, 6, 12, 87] x = 50, then the output will be [1, 5, 8, 3, 6, 9, 12, 36, 2, 5, 6, 12]To solve this, we will follow these steps −define a ... Read More

Suppose we have outer points of a polygon in clockwise order. We have to check these points are forming a convex polygon or not. A polygon is said to be concave if any one of its interior angle is greater than 180°.From this diagram it is clear that for each three consecutive points the interior angle is not more than 180° except CDE.So, if the input is like points = [(3, 4), (4, 7), (7, 8), (8, 4), (12, 3), (10, 1), (5, 2)], then the output will be True.To solve this, we will follow these steps −n := size ... Read More

Suppose we have a list of n elements; we have to repeat each element in the list n number of times.So, if the input is like nums = [1,5,8,3], then the output will be [1, 1, 1, 1, 5, 5, 5, 5, 8, 8, 8, 8, 3, 3, 3, 3]To solve this, we will follow these steps −n := size of numsret := a new listfor each num in nums, doret := ret concatenate a list with n number of numsreturn retExampleLet us see the following implementation to get better understandingdef solve(nums):    n = len(nums)    ret = []    for num in nums:       ret += [num]*n    return ret nums = [1,5,8,3] print(solve(nums))Input[1,5,8,3] Output[1, 1, 1, 1, 5, 5, 5, 5, 8, 8, 8, 8, 3, 3, 3, 3]

Suppose we have a number n. We have to find the super digit of this number. The super digit of a single digit number is the digit itself but for multi-digit numbers super digit is the sum of all digits repeatedly until the sum is a single digit number.So, if the input is like n = 513682, then the output will be 7 because (5+1+3+6+8+2) = 25, (2 + 5) = 7.To solve this, we will follow these steps −s := 0while n > 0 or s > 9, doif n is same as 0, thenn := ss := 0s ... Read More

Suppose we have two arrays called nums1 and nums2. We have to find the number of values that satisfy the following conditions −The elements in nums1 are the factors of the elements which are being selectedThe elements which are selected is a factor of all of the elements of nums2So, if the input is like nums1 = [3, 9] nums2 = [27, 81], then the output will be 2 because the numbers are 9 and 27, because9 mod 3 = 09 mod 9 = 027 mod 9 = 081 mod 9 = 027 mod 3 = 027 mod 9 = ... Read More

Suppose we have outer points of a polygon in clockwise order. We have to check these points are forming a convex hull or not.From this diagram it is clear that for each three consecutive points the interior angle is not more than 180°. So if all angles are not more than 180° then the polygon is convex hull.So, if the input is like points = [(3, 4), (4, 7), (7, 8), (11, 6), (12, 3), (10, 1), (5, 2)], then the output will be True.To solve this, we will follow these steps −n := size of pointsfor i in range ... Read More

Suppose we have an array nums of some large numbers. The large numbers are in range (-2^31 to 2^31 - 1). We have to find the sum of these numbers.So, if the input is like nums = [5000000003, 3000000005, 8000000007, 2000000009, 7000000011], then the output will be 25000000035.To solve this, we will follow these steps −x := 0for initialize i := 0, when i < size of nums, update (increase i by 1), do −x := x + nums[i]return xExampleLet us see the following implementation to get better understanding#include #include using namespace std; long long int solve(vector nums){    long long int x = 0;    for(int i=0; i

Suppose we have an array nums, and a value k and another value i. We have to find the element at index i after rotating elements of nums, k number of times to the right.So, if the input is like nums = [2, 7, 9, 8, 10] k = 3 i = 2, then the output will be 10 because after 3rd rotation array will be [9, 8, 10, 2, 7], so now the ith element will be nums[2] = 10.To solve this, we will follow these steps −for r in range 0 to k, dodelete last element from nums ... Read More

Suppose we have two numbers a and b. We have to find how many positive integers are there, that are divisors to both a and b.So, if the input is like a = 288 b = 240, then the output will be 10 because the common divisors are [1, 2, 3, 4, 6, 8, 12, 16, 24, 48].To solve this, we will follow these steps −res := 0for i in range 1 to gcd(a, b) + 1, doif (a mod i) is 0 and (b mod i) is 0, thenres := res + 1return resExampleLet us see the following implementation ... Read More

Suppose we have a postal code we have to check whether it is valid or not. A valid postal code has following criteriaIt must be a number in the range from 100000 to 999999 (both inclusive).It must not contain more than one alternating repetitive digit pair.So, if the input is like s = "700035", then the output will be True as this is in range 100000 to 999999 and there are no consecutive digits either.To solve this, we will follow these steps −n := size of snb := 0ok := Truefor i in range 0 to n - 1, dook ... Read More