## Sum of all perfect square divisors of numbers from 1 to N

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 »

- Must do Math for Competitive Programming
- Product of all Subarrays of an Array
- Perfect Sum Problem
- How is the time complexity of Sieve of Eratosthenes is n*log(log(n))?
- Pi(π) in C++ with Examples
- Check whether a number can be represented as difference of two squares
- Modulo Operator (%) in C/C++ with Examples
- Count of subsets with sum equal to X using Recursion
- Maximum number of unique values in the array after performing given operations
- Count of subarrays having exactly K perfect square numbers
- Sum of GCD of all possible sequences
- Find the numbers from 1 to N that contains exactly k non-zero digits
- Logarithm tricks for Competitive Programming
- Program to calculate Electricity Bill
- Longest sub-array with maximum GCD
- Count of subarrays which start and end with the same element
- Puzzle | Dividing a Square into N smaller squares
- Minimize the maximum difference of adjacent elements after at most K insertions
- Maximum GCD of all subarrays of length at least 2
- Find K distinct positive odd integers with sum N
- Maximum profit by buying and selling a share at most K times | Greedy Approach
- Longest Mountain Subarray
- Expected Number of Trials to get N Consecutive Heads
- Digital Root of a given large integer using Recursion
- Count number of pairs with positive sum in an array
- Program to calculate Percentile of a student based on rank
- Find the minimum number to be added to N to make it a prime number
- Probability of getting K heads in N coin tosses
- Find the K closest points to origin using Priority Queue
- Minimum window size containing atleast P primes in every window of given range

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 a numeric string str, the task is to count the number of ways the given string can be split, such that each segment is… Read More »

Given two integers N and K and an array arr[] consisting of duplicate elements, the task is to split N elements into K sets of… Read More »

Given a positive integer N, the task is to check whether the binary equivalent of that integer ends with “001” or not. Print “Yes” if… Read More »

Given two positive numbers A and B.The task is to print all the Panarithmic Number between two numbers (inclusively). Panarithmic Numbers or Practical number is… Read More »

Given an array of positive integers, the task is to find the minimum number of insertions to be done in the array, to make the… Read More »

Given an array arr[] of N integers, the task is to find the maximum value possible remaining in the array by repeating the following two… Read More »

Given two positive integers N1 and N2, the task is to find the sum of the products of same placed digits of the two numbers.… Read More »

Given an integer N, the task is to find all distinct co-prime sets up to the given integer N such that an element doesn’t appear… Read More »

Given an integer N print the sequence number of the given Triangular Number. If the number is not a triangular number then print -1. A… Read More »

Given a number N, the task is to print the Nth Hogben number. Hogben Number: In a spiral arrangement of the integers, Hogben Numbers appear… Read More »

Given a string S of size N, the task is to count all possible triplets in the given string which consists of only 3 colours… Read More »

Given an integer N, the task is to find two non-negative integers X and Y such that X4 – Y4 = N. If no such… Read More »

Given the length of a side a of a triangle and its adjacent angles B and C, the task is to find the remaininig two… Read More »

Given an array arr[] of N integers, the task is to find the product of all the pairs possible from the given array such as:… Read More »