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
Server Side Programming Articles
Page 461 of 2109
Check whether the two numbers differ at one-bit position only in Python
Suppose we have two numbers x and y. We have to check whether these two numbers differ at one-bit position or not in their binary representation. So, if the input is like x = 25 and y = 17, then the output will be True because x = 11001 in binary and y = 10001. Only one-bit position is different. Algorithm To solve this, we will follow these steps ? Calculate z = x XOR y Count the number of set bits in z ...
Read MoreCheck whether the sum of prime elements of the array is prime or not in Python
When working with arrays containing numbers, we often need to identify prime numbers and perform operations on them. This problem requires us to find all prime elements in an array, sum them up, and check if that sum is also prime. So, if the input is like nums = [1, 2, 4, 5, 3, 3], then the output will be True as sum of all primes are (2+5+3+3) = 13 and 13 is also prime. Understanding Prime Numbers A prime number is a natural number greater than 1 that has no positive divisors other than 1 and ...
Read MoreCheck whether the sum of absolute difference of adjacent digits is Prime or not in Python
Sometimes we need to check if the sum of absolute differences between adjacent digits in a number results in a prime number. This involves calculating differences between consecutive digits and testing if their sum is prime. Problem Understanding Given a number n, we need to ? Calculate the absolute difference between each pair of adjacent digits Sum all these differences Check if the sum is a prime number For example, if n = 574, then |5−7| + |7−4| = 2 + 3 = 5, which is prime, so the result is True. Algorithm ...
Read MoreCheck whether the point (x, y) lies on a given line in Python
To check whether a point (x, y) lies on a given line, we need to verify if the point satisfies the line equation. For a line in the form y = mx + b, where m is the slope and b is the y-intercept, we substitute the point's coordinates into the equation. If the equation holds true (left side equals right side), then the point lies on the line. Otherwise, it doesn't. Problem Example Given a line with slope m = 3 and y-intercept b = 5, we need to check if point (6, 23) lies on ...
Read MoreCheck whether the number formed by concatenating two numbers is a perfect square or not in Python
Sometimes we need to check if concatenating two numbers creates a perfect square. A perfect square is a number that can be expressed as the product of an integer with itself (like 16 = 4²). So, if the input is like x = 2 and y = 89, then the output will be True as after concatenating the number will be 289 which is 17². Algorithm To solve this problem, we will follow these steps − Convert both numbers to strings Concatenate the strings and convert back ...
Read MoreCheck whether the number can be made perfect square after adding 1 in Python
Given a number n, we need to check whether adding 1 to it results in a perfect square. A perfect square is a number that can be expressed as the product of an integer with itself (like 4 = 2², 9 = 3², 16 = 4²). For example, if n = 288, then n + 1 = 289, and 289 = 17², so the answer is True. Algorithm To solve this problem, we follow these steps ? Calculate res_num = n + 1 Find sqrt_val = integer part of square root of res_num If sqrt_val ...
Read MoreCheck whether the length of given linked list is Even or Odd in Python
Determining whether a linked list has an even or odd number of nodes is a common programming problem. The most efficient approach uses the two-pointer technique to traverse the list in a single pass without counting all nodes. Algorithm Explanation The algorithm uses a single pointer that moves two steps at a time: Start from the head and jump two nodes forward in each iteration If the pointer becomes None, the list has an even number of nodes If the pointer reaches the last node (next is None), the list has an odd number of nodes ...
Read MoreCheck whether the given numbers are Cousin prime or not in Python
Two numbers are called cousin primes when both are prime numbers and their absolute difference is exactly 4. This is different from twin primes (difference of 2) and sexy primes (difference of 6). For example, (7, 11) are cousin primes because both are prime and |11 - 7| = 4. Similarly, (19, 23) are cousin primes. Algorithm To check if two numbers are cousin primes ? Check if the absolute difference between the numbers is exactly 4 Verify that both numbers are prime Return True only if both conditions are satisfied Implementation ...
Read MoreCheck whether the given number is Wagstaff prime or not in Python
A Wagstaff prime is a prime number that can be expressed in the form (2q + 1)/3, where q is an odd prime number. These numbers are named after mathematician Samuel S. Wagstaff Jr. Wagstaff Prime Formula W = (2^q + 1) / 3 where q is an odd prime Example For n = 683, we can verify it's a Wagstaff prime because 683 = (211 + 1)/3, where q = 11 is an odd prime. Algorithm To check if a number is a ...
Read MoreCheck whether the given number is Euclid Number or not in Python
A Euclid number is an integer that can be represented as the product of the first n prime numbers plus 1. In mathematical terms, a Euclid number follows the formula: En = Pn + 1 where Pn is the product of the first n prime numbers. For example, 211 is a Euclid number because it can be expressed as (2×3×5×7) + 1 = 210 + 1 = 211. Algorithm To check if a number is a Euclid number, we need to ? Generate all prime numbers up to a reasonable limit using the Sieve ...
Read More