Skip to content

Tag Archives: maths-perfect-square

Given an array arr[] consisting of N positive integers, the task is to check if the product of elements of every subsequence of the given… Read More
Given an array arr[] consisting of N positive integers, the task is to print the nearest perfect square for each array element. Examples: Input: arr[]… Read More
Given an integer N, the task is to find the number of ways to represent the number N as sum of perfect squares. Examples: Input:… Read More
Given a positive integer N, the task is to check if N can be represented as a sum of a Prime Number and a Perfect… Read More
Given an array arr[ ] of size N, the task for each array element is to print the nearest perfect square having same parity. Examples:… Read More
Given an array arr[] consisting of N positive integers, the task is to find the nearest perfect power of 2 of the nearest perfect squares… Read More
Given an array points[] representing N points in a K-dimensional space, the task is to find the count of pairs of points in the space… Read More
Given an array arr[] of size N consisting of only of 0s initially, the task is to count the number of 1s that can be… Read More
Given array arr[] consisting of N non-negative integers, and an integer K, the task is to check if GCD of all composite numbers in the… Read More
Given a singly linked list containing N nodes, the task is to find the sum of all possible nodes of the list which contains value… Read More
Given an integer X, the task is to determine the minimum value of Y greater than X, such that count of divisors of X and… Read More
Given two positive integers A and B representing the sides of a triangle, the task is to check if the given two sides of the… Read More
Given an integer N, the task is to count the minimum number of times N needs to be incremented or decremented by 2 to convert… Read More
Given two arrays arr1[] and arr2[] of length N which contains Numerator and Denominator of N fractions respectively, the task is to count the number… Read More