## Largest perfect square number in an Array

Given an array of n integers. The task is to find the largest number which is a perfect square. Print -1 if there is no… Read More »

- Count number of 1s in the array after N moves
- Number of times the largest perfect square number can be subtracted from N
- Check if product of array containing prime numbers is a perfect square
- Smallest and Largest N-digit perfect squares
- Print n numbers such that their sum is a perfect square
- Number of elements with even factors in the given range
- Sum of distances between the two nearest perfect squares to all the nodes of the given linked list

Given an array of n integers. The task is to find the largest number which is a perfect square. Print -1 if there is no… Read More »

Given an integer array , the task is to sort only the elements which are perfect squares at their relative positions in the array (positions… Read More »

Given an array of integer elements, the task is to find the length of the largest sub-array of such that all the elements of the… Read More »

Given an Integer N. The task is count numbers P less than N such that P is a product of two distinct perfect squares. Examples:… Read More »

Given a number . The task is to find the largest factor of that number which is a perfect square. Examples: Input : N =… Read More »

Given a number N, the task is to count all ‘a’ and ‘b’ that satisfy the condition a^2 + b^2 = N. Note:- (a, b)… Read More »

Given a number N, the task is to find No. of perfect Squares and perfect Cubes from 1 to a given integer, N ( Both… Read More »

Given a number N, the task is to find the next perfect square greater than N. Examples: Input: N = 6 Output: 9 9 is… Read More »

Given n, find the nth number which is not a perfect square among natural numbers (1, 2, 3, 4, 5, 6, … ) Examples: Input… Read More »

The gmp_perfect_square() is an inbuilt function in PHP which checks if the given GMP number(GNU Multiple Precision: For large numbers) is a perfect square or… Read More »

Given a integer n, we need to find how many digits remove from the number to make it a perfect square. Examples : Input :… Read More »

Given a String str and the task is to check sum of ASCII value of all characters is a perfect square or not. Examples :… Read More »

Prerequisite: Hamiltonian Cycle Given an integer n(>=2), find a permutation of numbers from 1 to n such that the sum of two consecutive numbers of… Read More »

Given a number, check if it is perfect square or not. Examples : Input : 2500 Output : Yes 2500 is a perfect square. 50… Read More »

Given n integers, find the largest number is not a perfect square. Print -1 if there is no number that is perfect square. Examples: Input… Read More »