## Subsets of size K with product equal to difference of two perfect squares

Given a distinct integers array arr[] of size N and an integer K, the task is to count the number of subsets of size K… Read More »

- Check whether a number can be represented as difference of two squares
- Count of subarrays having exactly K perfect square numbers
- Check if a given number is a Perfect square using Binary Search
- Floor square root without using sqrt() function : Recursive
- Find two numbers such that difference of their squares equal to N
- Count of subarrays whose sum is a perfect square
- Minimum number of squares whose sum equals to a given number N | Set-3
- Maximum subsequence sum from a given array which is a perfect square
- Count of interesting primes upto N
- Sunny Number
- Array range queries to find the number of perfect square elements with updates
- Find sum of product of every number and its frequency in given range
- Count of pairs in an array whose product is a perfect square
- Count elements in an Array that can be represented as difference of two perfect squares
- Count of perfect squares of given length
- Construct an Array such that cube sum of all element is a perfect square
- Sum of all Perfect Squares lying in the range [L, R] for Q queries
- Count of pairs of integers whose difference of squares is equal to N
- Perfect Square factors of a Number
- Construct an Array of size N whose sum of cube of all elements is a perfect square
- Probability of getting a perfect square when a random number is chosen in a given range
- Check if N can be represented as sum of squares of two consecutive integers
- Check whether the number can be made perfect square after adding K
- Find the Largest N digit perfect square number in Base B
- Subsets of size K with product equal to difference of two perfect squares
- Previous perfect square and cube number smaller than number N
- Count of primes in a given range that can be expressed as sum of perfect squares
- Square root of a number by Repeated Subtraction method
- Sum of all perfect square divisors of numbers from 1 to N
- Least number to be added to or subtracted from N to make it a Perfect Square

Given a distinct integers array arr[] of size N and an integer K, the task is to count the number of subsets of size K… Read More »

Given a number N, the task is to find the sum of all the perfect square divisors of numbers from 1 to N. Examples: Input:… Read More »

Given the size of array N, the task is to construct an array of size N with positive integer elements such that the cube sum… Read More »

Given an array arr[] with positive and negative elements, the task is to count all subarrays whose sum is a perfect square. Examples: Input: arr[]… Read More »

Given an integer N, the tasks is to construct a sorted array arr[] of size N, such that the sum of cube of all elements… Read More »

Given two integers N and B, the task is to find the largest N digit numbers of Base B which is a perfect square. Examples:… Read More »

Given an integer N, the task is to check whether N can be represented as a sum of squares of two consecutive integers or not.… Read More »

Check if a given number N is a perfect square or not. If yes then return the number of which it is a perfect square,… Read More »

Given an array arr[] of N integers, the task is to perform the following two queries: query(start, end): Print the number of perfect square numbers… Read More »

Given an integer N, the task is to find the number of perfect squares of length N. Examples: Input: N = 1 Output: 3 Explanation:… Read More »

Given a positive integer N, the task is to check whether the given number N is Sunny Number or not. A number N is a… Read More »

Given a unsorted integer array arr[] and an integer K. The task is to count the number of subarray with exactly K Perfect Square Numbers.… Read More »

Given two integers L and R that denote a range, the task is to find the probability of getting a perfect square number when a… Read More »

Given an integer N, the task is to find the previous perfect square or perfect cube smaller than the number N. Examples: Input: N =… Read More »

Given a number N, the task is to check if this number can be represented as the difference of two perfect squares or not. Examples:… Read More »