## Check if a number is divisible by 47 or not

Given a number N, the task is to check whether the number is divisible by 47 or not. Examples: Input: N = 1645 Output: yes… Read More »

Given a number N, the task is to check whether the number is divisible by 47 or not. Examples: Input: N = 1645 Output: yes… Read More »

Given a number N, the task is to check whether the number is divisible by 31 or not. Examples: Input: N = 1922 Output: Yes… Read More »

Given a number N, the task is to check whether the number is divisible by 43 or not. Examples: Input: N = 2795 Output: yes… Read More »

Given a number N, the task is to check whether the number is divisible by 71 or not. Examples: Input: N = 25411681 Output: yes… Read More »

Given an array arr[] of N integers, the task is to find the largest subset of arr[] such that in every pair of numbers from… Read More »

Given an array arr[] of N integers and an integer M, the task is to find the number of non-empty subsequences such that the sum… Read More »

Given a binary string S, the task is to find the maximum number of parts that you can split it into such that every part… Read More »

Given four integers A, B, C and D. The task is to find the count of integers in the range [A, B] that are not… Read More »

Given four integers N, A, B and C. The task is to find the count of integers from the range [1, N] which are divisible… Read More »

Given five integers N, A, B, X and Y. The task is to find the maximum profit obtained from the numbers from the range [1,… Read More »

Given an array arr[], the task is to find the smallest possible integer (other than 1) which divides every element of the given array. Examples:… Read More »

Given an integer N. The task is to find the count of all the numbers from 1 to N which are not divisible by any… Read More »

Given an integer N, the task is to find the count of numbers from 1 to N which are divisible by all the numbers from… Read More »

Given an array arr[] of positive integers and an integer x, the task is to minimize the sum of elements of the array after performing… Read More »

Given a number N(1 ≤ N ≤ 1018) without leading zeros. The task is to find the minimum number of moves required to make N… Read More »