Arnab Chakraborty

Arnab Chakraborty

3,768 Articles Published

Articles by Arnab Chakraborty

Page 40 of 377

Check if number can be displayed using seven segment led in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 1K+ Views

Suppose we have a number n, and we have another input c. We have to check whether n can be displayed using 7-segment displays or not. Now here is a constraint. We are only allowed to glow at most c number of LEDs.So, if the input is like n = 315 c = 17, then the output will be True as 315 needs 12 LEDs and we have 17.To solve this, we will follow these steps −seg := a list containing led counts for all digits : [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]s := n as ...

Read More

Check if number is palindrome or not in Octal in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 560 Views

Suppose we have a number which is either in octal or in decimal form. If this is in octal form check whether it is palindrome or not. If the number in decimal, then convert it to octal then check whether it is palindrome or not.So, if the input is like num = 178, then the output will be True as the number is not in octal form (8 is not valid symbol in octal but valid in decimal), then convert it to octal which is 262 and this is palindrome.To solve this, we will follow these steps −base := 8 ...

Read More

Check if one of the numbers is one’s complement of the other in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 665 Views

Suppose we have two numbers x and y. We have to check whether one of these two numbers is 1's complement of the other or not. We all know the 1's complement of a binary number is flipping all bits from 0 to 1 or 1 to 0.So, if the input is like x = 9, y = 6, then the output will be True as the binary representations are x = 1001 and y = 0110 which are complement of each other.To solve this, we will follow these steps −z = x XOR yreturn true when all bits in ...

Read More

Check if possible to move from given coordinate to desired coordinate in C++

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 378 Views

Suppose we have two coordinates (sx, sy), and (tx, ty), we have to check whether we can move from starting point to ending point or not. Here we can move consists of taking a point (x, y) and transforming it to either (x, x+y) or (x+y, y).So if the inputs are (1, 1) and (4, 5), then the answer will be true, this is because move (1, 1) to (2, 1), then (3, 1), then (4, 1), then (4, 5).To solve this, we will follow these steps −while tx > sx and ty > sy, do −if tx > ty, ...

Read More

Check if product of array containing prime numbers is a perfect square in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 231 Views

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 More

Check if product of digits of a number at even and odd places is equal in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 362 Views

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 More

Check if reversing a sub array make the array sorted in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 404 Views

Suppose we have an array called nums with unique elements. We have to check whether the array will be sorted or not after reversing one sub-array of it. If the array is already sorted, then also return true.So, if the input is like nums = [4, 6, 27, 25, 15, 9, 37, 42], then the output will be True because if we reverse [9, 15, 25, 27], then the array will be sorted.To solve this, we will follow these steps −n := size of numsif array has only one element then return Truei := 1for i in range 1 to ...

Read More

Check if product of first N natural numbers is divisible by their sum in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 269 Views

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 More

Check if right triangle possible from given area and hypotenuse in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 299 Views

Suppose we have the hypotenuse and area of a right angle triangle, we have to find the base and height of this triangle. If it is not possible return False.So, if the input is like hypo = 10, area = 24, then the output will be (6, 8).To solve this, we will follow these steps −hypo_sq := hypo * hypos := square root of (hypo_sq / 2.0)maxArea := calculate area of triangle using base s and hypotenuse hypoif area > maxArea, thenreturn Falseleft := 0.0, right := swhile |right - left| > 0.000001, dobase := (left + right) / 2.0if ...

Read More

Check if subarray with given product exists in an array in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 697 Views

Suppose we have an array called nums and this contains positive and negative numbers. We have another value k. We have to check whether any subarray whose product is k is present in the array or not.So, if the input is like nums = [-2, -1, 1, 3, 5, 8], k = 6, then the output will be True as the subarray is [-2, -1, 3]To solve this, we will follow these steps −minimum := nums[0], maximum := nums[0]prod_max := nums[0]for i in range 1 to size of nums - 1, doif nums[i] < 0, thenswap maximum and minimummaximum := ...

Read More
Showing 391–400 of 3,768 articles
« Prev 1 38 39 40 41 42 377 Next »
Advertisements