## Sum of common divisors of two numbers A and B

Given two number A and B, the task is to find the sum of common factors of two numbers A and B. The numbers A… 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
- Sum of similarities of string with all of its suffixes
- Make all numbers of an array equal
- Maximize the total profit of all the persons
- Find triplets in an array whose AND is maximum
- Some useful C++ tricks for beginners in Competitive Programming
- Length of the longest Subarray with only Even Elements
- Check if a number is perfect square without finding square root
- Print matrix in snake pattern from the last column
- Sort the array of strings according to alphabetical order defined by another string
- Python in Competitive Programming
- 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
- Minimum changes required to make two arrays identical
- Number of array elements derivable from D after performing certain operations
- C++: Methods of code shortening in competitive programming
- Sum of the multiples of two numbers below N
- Number of quadrilaterals possible from the given points
- 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
- Smallest Pair Sum in an array

Given two number A and B, the task is to find the sum of common factors of two numbers A and B. The numbers A… Read More »

Given an integer N, the task is to find N elements which fail the below-sorting algorithm. If none of the N elements fail, then print… Read More »

Given a number N, the task is to find the sum of all the multiples of A and B below N. Examples: Input:N = 11,… Read More »

Given an integer and ranges (e.g. [a, b]) which are intersecting and overlapping. The task is to find all the number within the range that… Read More »

Given two integers and , the task is to find the sum of all the numbers within the range [1, n] excluding the numbers which… Read More »

Given a number . The task is to check if the number is formed by concatenating the numbers 1, 14 and 144 only any number… Read More »

Given a string , the task is to check if the frequencies of all the characters of the string are prime or not. If all… Read More »

Given an array of size . Move two pointers, one from the left side and one from the right side of the array, a pointer… Read More »

Given two coins which have probability of getting heads p% and q% respectively, the task is to determine the probability of getting two consecutive heads… Read More »

Given a prime . The task is to count all the primitive roots of . A primitive root is an integer x (1 <= x… Read More »

Given an array of size and an integer . Perform the following operations on the given array: If a[i] > M then push a[i] –… Read More »

Given two positive integers n and r where n > r >1. The task is to find the value of f(n)/(f(r)*f(n-r)). F(n) is deined as… Read More »

Given an array of N elements, the task is to check if the array has an element which is equal to the sum of all… Read More »

Given a number N(less than 10^9). The task is to print all the numbers less than N which are having a maximum of 2 unique… Read More »

Given segments as ranges [L, R] where ranges are non-intersecting and non-overlapping. The task is to find all number between 1 to that doesn’t belong… Read More »