## 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
- Which C++ libraries are useful for competitive programming?
- Breadth First Search without using Queue
- Which Java libraries are useful for competitive programming?
- Minimize the maximum difference between adjacent elements in an array
- 7 Best Coding Challenge Websites in 2020
- Which Python Modules are useful for competitive programming?
- Speed up Code executions with help of Pragma in C/C++
- Basic Algorithm Techniques Not Taught in Academics
- Setting up a C++ Competitive Programming Environment
- Writing code faster during Competitive Programming in C++
- Check if sum of Fibonacci elements in an Array is a Fibonacci number or not
- Count of subarrays of an Array having all unique digits
- Logarithm tricks for Competitive Programming
- Default values in a Map in C++ STL
- Move all zeroes to end of array using Two-Pointers
- Sum of GCD of all possible sequences
- How To Approach A Coding Problem ?
- Minimize the maximum difference of adjacent elements after at most K insertions
- Maximum LCM among all pairs (i, j) from the given Array
- Count of subarrays which start and end with the same element
- Submatrix of given size with maximum 1's
- Kth most frequent Character in a given String
- Length of the smallest substring which contains all vowels
- Longest Mountain Subarray
- Find distance between two nodes in the given Binary tree for Q queries
- Find maximum subset sum formed by partitioning any subset of array into 2 partitions with equal sum
- Find last remaining element after reducing the Array
- Queries for elements having values within the range A to B in the given index range using Segment Tree
- Count of substrings of length K with exactly K distinct characters

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 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 length N, the task is to check if it can be formed by merging two permutations of same or different… 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 N*N binary matrix arr[][], the task is to check if the matrix contains a square of at least size 2 x 2 whose… 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 string S and a matrix Q of queries, each specifying the starting and ending indices L( = Q[i][0]) and R( = Q[i][0]) respectively… Read More »

Given a binary valued Undirected Graph with V vertices and E edges, the task is to find the maximum decimal equivalent among all the connected… Read More »

Given a binary string S of length N, the task is to find the minimum number of bit flips required to convert the given string… Read More »

Given an array arr[] consisting of integers of length N and an integer K (1 <= K <= N), the task is to find the… Read More »

Given an array arr of distinct integers, the task is to find count of sub-arrays of size i having all elements from 1 to i,… Read More »

Given a matrix board of characters and a string Word, the task is to check if Word exists on the board constructed from a sequence… Read More »

Given a numeric string N and an integer K, the task is to split digits of N into subparts such that the number of segments… Read More »

Given a numeric string S consisting of only three types of characters 0, 1 and 2 initially and following two operations: Occurrence of two consecutive… Read More »

Given an array arr[] containing N elements, the task is to count the number of sub-arrays whose XOR of all the elements is equal to… Read More »