## Check if a number is perfect square without finding square root

We need to check whether a number is a perfect square or not without finding its square root. Examples: Input : n = 36 Output… Read More »

- Practice for cracking any coding interview
- How to get rid of Java TLE problem
- How can one become good at Data structures and Algorithms easily?
- Burst Balloon to maximize coins
- Understanding The Coin Change Problem With Dynamic Programming
- Subset array sum by generating all the subsets
- Reach the numbers by making jumps of two given lengths
- Make all numbers of an array equal
- Sum of similarities of string with all of its suffixes
- Some useful C++ tricks for beginners in Competitive Programming
- Maximize the total profit of all the persons
- Find triplets in an array whose AND is maximum
- Check if a number is perfect square without finding square root
- Length of the longest Subarray with only Even Elements
- Sort the array of strings according to alphabetical order defined by another string
- Python in Competitive Programming
- Print matrix in snake pattern from the last column
- Sum of the first N Prime numbers
- How to read Competitive Programming Questions?
- How can competitive programming help you get a job?
- Check if it is possible to reach a number by making jumps of two given length
- C++: Methods of code shortening in competitive programming
- Minimum changes required to make two arrays identical
- Number of array elements derivable from D after performing certain operations
- Sum of the multiples of two numbers below N
- Number of quadrilaterals possible from the given points
- Color N boxes using M colors such that K boxes have different color from the box on its left
- Minimum number of increasing subsequences
- Find two numbers whose divisors are given in a random order
- Minimum number of sets with numbers less than Y

We need to check whether a number is a perfect square or not without finding its square root. Examples: Input : n = 36 Output… Read More »

Given an array of integers arr[], the task is to find all the values for sum such that for a value sum[i] the array can… Read More »

Given a range represented by two positive integers L and R. Find the number lying in the range having the maximum product of the digits.… Read More »

Given N numbers and two numbers L and R., the task is to print the count of numbers in the range [L, R] which are… Read More »

Given two numbers N and K. The task is to print K numbers which are powers of 2 and their sum is N. Print -1… Read More »

You have an unlimited number of 10-rupee coins and exactly one coin of r rupee and you need to buy minimum items each of cost… Read More »

Given a range represented by two positive integers l and r and two integers d and m. Find the count of numbers lying in the… Read More »

Given an array arr[] of size n ≥ 3, the task is to find the minimum possible difference between the the maximum and the minimum… Read More »

Given a graph G, the task is to check if it represents a Star Topology. A Star Topology is the one shown in the image… Read More »

Given a graph G, the task is to check if it represents a Ring Topology. A Ring Topology is the one shown in the image… Read More »

Given integers k, d1, d2 and an integer array arr[]. Starting from number k you are allowed to make jumps of size d1 and d2… Read More »

Given a range represented by two positive integers L and R and a positive integer K. Find the count of numbers in the range where… Read More »

Given a tree, where each vertex V has a value A[V] stored in it. The task is to find the minimum number of operations required… Read More »

Given an array of N integers and 3 integers D, A and B. The task is to find the number of array elements that we… Read More »

Given a graph G, check if it represents a Bus Topology. A Bus Topology is the one shown in the image below: Examples: Input: Output:… Read More »