Suppose, we have two positive integers n and m, such that 2 ≤ n ≤ 1018 and 2 ≤ m ≤ n. Our goal is to find out if there are any all-digit-permutations of the number n; so that it is equal to some power of m. If there is ... Read More

Suppose, we are provided with a large positive integer number N. We have to check if we can find out a number from its digit-permutations; such that the permutation is equal to its reverse form, i.e. its palindrome, and is also divisible by 3.For example, suppose we have the number ... Read More

Suppose, we are provided with a huge number and we have to find out whether any permutation of the digits of the number is divisible by 8. The number is provided to us in string format.So, if the input is like: input_num = 4696984, then the output will be “Divisible ... Read More

Suppose, we are given a large number and we have to check whether the number is divisible by 19.So, if the input is like 86982, then the output will be “Divisible”.We will solve this problem using the repeated addition method, where we extract the last digit from the number, multiply ... Read More

Suppose, we are given a number and we have to check whether the number is divisible by 17.So, if the input is like 99943, then the output will be Divisible.We will solve this problem using the repeated subtraction method, where we extract the last digit of the number and subtract ... Read More

Suppose, we are given a set of intervals that consists of values (a, b) where a represents the starting time and b represents the ending time of an event. Our task is to check whether any of these intervals completely overlap any other interval in this set. If any of ... Read More

Suppose we have a string s. We have to check whether an anagram of that string is forming a palindrome or not.So, if the input is like s = "aarcrec", then the output will be True one anagram of this string is "racecar" which is palindrome.To solve this, we will ... Read More

Suppose we have a number n, we have to check whether n can be expressed as a sum of two semi-primes or not.As we know the semi-prime is a number if it can be expressed as product of two primes number. First few semi-prime numbers are (1 - 100 range): ... Read More

Suppose we have an array called nums represents an encoding of a binary string of size k, we have to check whether given encoding uniquely finds a binary string or not. Here the encoding has counts of contiguous 1s which are separated by single 0s.So, if the input is like ... Read More

Suppose we have an array of numbers called nums. We have to check whether the array is holding elements of a binary search tree in the sequence of its inorder traversal or not.So, if the input is like nums = [5, 8, 15, 18, 20, 26, 39], then the output ... Read More