Tag Archives: maths-perfect-square

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
Given a matrix mat[][] of dimension NxM, the task is to count the number of unique paths from the top-left cell, i.e. mat[0][0], to the… Read More
Given an array, arr[] of size N, the task is to print the start and end indices of all subarrays whose sum is a perfect… Read More
Given an integer N, the task is to generate a matrix of dimensions N x N using positive integers from the range [1, N] such… Read More
Given an integer N, the task is to print a sequence of length N consisting of alternate odd and even numbers in increasing order such… Read More
Given an integer N, the task is to check if the given number is a perfect square having all its digits as a perfect square… Read More
Given an array arr[] and an integer K, the task is to find a subarray of length K having sum which is a perfect square.… Read More
Given an array arr[] of size N and an array range[], the task is to check if the sum of the subarray {range[0], .. ,… Read More