Filtering arrays based on a condition is a common task in Python programming. The filter() function provides an efficient way to extract elements that meet specific criteria. In this example, we'll filter numbers that are less than a given threshold value. Problem Statement Given a list of numbers and a threshold value x, we need to find all numbers that are less than x using Python's filter() function. For example, if nums = [1, 5, 8, 3, 6, 9, 12, 77, 55, 36, 2, 5, 6, 12, 87] and x = 50, the output should be [1, ... 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 nums ret := a new list for each num in nums, do ... Read More
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. Algorithm To solve this, we will follow these steps − s := 0 while ... 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 selected The elements which are selected are factors of all elements of nums2 So, if the input is like nums1 = [3, 9] and nums2 = [27, 81], then the output will be 2 because the numbers are 9 and 27. Algorithm To solve this, we will follow these steps: ... 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. ... Read More
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. Method 1: Using pop() and insert() We can simulate the rotation by moving the last ... Read More
When working with two numbers, we often need to find how many positive integers divide both numbers evenly. These are called common divisors. A key insight is that all common divisors of two numbers are also divisors of their GCD (Greatest Common Divisor). So, if the input is like a = 288 and b = 240, then the output will be 10 because the common divisors are [1, 2, 3, 4, 6, 8, 12, 16, 24, 48]. Algorithm To solve this problem, we follow these steps ? Find the GCD of ... Read More
Postal address validation is important for ensuring data integrity in applications. A valid postal code must meet specific criteria including proper length, numeric format, and digit pattern restrictions. Validation Criteria A valid postal code must satisfy the following conditions ? It must be exactly 6 digits long It must be a number in the range from 100000 to 999999 (cannot start with 0) It must not contain more than one alternating repetitive digit pair (digits at positions i and i+2 should not be the same more than once) Example Let's implement a function ... Read More
Suppose we have coins of denominations (1, 2, 5 and 10). We need to find in how many ways we can make n rupees using these denominations. We have an array called count with 4 elements, where count[0] indicates number of coins of denomination 1, count[1] indicates number of coins of denomination 2, and so on. So, if the input is like n = 27 and count = [8, 4, 3, 2], then the output will be 18, meaning there are 18 possible combinations. Some of them are ? 10*2 + 5*1 + 2*1 = 27 10*2 ... Read More
Suppose we have a list of words in lowercase letters. We need to find the total score of these words based on specific vowel counting rules. Scoring Rules Consider vowels as [a, e, i, o, u, y] If a word contains an even number of vowels, its score is 2 If a word contains an odd number of vowels, its score is 1 The total score is the sum of all individual word scores Example Analysis For words = ["programming", "science", "python", "website", "sky"]: "programming" has 3 vowels (o, a, i) → ... Read More
Data Structure
Networking
RDBMS
Operating System
Java
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Economics & Finance