- Greatest divisor which divides all natural number in range [L, R]
- Count pairs in an array such that LCM(arr[i], arr[j]) > min(arr[i],arr[j])
- Count ordered pairs of positive numbers such that their sum is S and XOR is K
- Maximum value of XOR among all triplets of an array
- Count permutation such that sequence is non decreasing
- Concatenate strings in any order to get Maximum Number of "AB"
- Find number of magical pairs of string of length L
- Find the total Number of Digits in (N!)N
- Count pairs (i,j) such that (i+j) is divisible by A and B both
- Minimum Bitwise AND operations to make any two array elements equal
- Minimum number of segments required such that each segment has distinct elements
- Check if there exists any sub-sequence in a string which is not palindrome
- Check if suffix and prefix of a string are palindromes
- All possible co-prime distinct element pairs within a range [L, R]
- Check whether a binary string can be formed by concatenating given N numbers sequentially
- Count numbers whose difference with N is equal to XOR with N
- Count unordered pairs (i,j) such that product of a[i] and a[j] is power of two
- Count number of ordered pairs with Even and Odd Sums
- Sub-strings having exactly k characters that have ASCII value greater than p
- Count number of ordered pairs with Even and Odd Product
- All possible numbers of N digits and base B without leading zeros
- Check if it is possible to rearrange a binary string with alternate 0s and 1s
- Check if there is any pair in a given range with GCD is divisible by k
- Convert all lowercase characters to uppercase whose ASCII value is co-prime with k
- Find two numbers whose sum and GCD are given
- Probability of getting two consecutive heads after choosing a random coin among two different types of coins
- Sum of first N natural numbers which are not powers of K
- Count pairs of numbers from 1 to N with Product divisible by their Sum
- Minimum value that divides one number and divisible by other
- Find probability that a player wins when probabilities of hitting the target are given
- Count number of set bits in a range using bitset
- Composite XOR and Coprime AND
- Minimum operations of the given type required to make a complete graph
- Count number of trailing zeros in (1^1)*(2^2)*(3^3)*(4^4)*..
- Count all Prime Length Palindromic Substrings
- Arrange first N natural numbers such that absolute difference between all adjacent elements > 1
- Increasing sequence with given GCD
- Number of Simple Graph with N Vertices and M Edges
- Generate minimum sum sequence of integers with even elements greater
- Maximum money that can be withdrawn in two steps
- Minimum steps to make the product of the array equal to 1
- Choose points from two ranges such that no point lies in both the ranges
- Maximize the sum of products of the degrees between any two vertices of the tree
- Modify a binary array to Bitwise AND of all elements as 1
- Count all possible N digit numbers that satisfy the given condition
- Minimum LCM and GCD possible among all possible sub-arrays
- Ways to Remove Edges from a Complete Graph to make Odd Edges
- Find smallest number K such that K % p = 0 and q % K = 0
- Generate array with minimum sum which can be deleted in P steps
- Count number of trailing zeros in Binary representation of a number using Bitset
- Maximum length of subarray such that sum of the subarray is even
- Minimum deletions required such that any number X will occur exactly X times
- Partition first N natural number into two sets such that their sum is not coprime
- Count pairs of strings that satisfy the given conditions
- Count number of common elements between two arrays by using Bitset and Bitwise operation
- Find Nth smallest number that is divisible by 100 exactly K times
- Find maximum value of the last element after reducing the array with given operations
- Minimum deletions required to make GCD of the array equal to 1
- Find a sequence of N prime numbers whose sum is a composite number
- Minimum operations required to make every element greater than or equal to K
- Number of intersections between two ranges
- Length of longest subarray in which elements greater than K are more than elements not greater than K
- Count number of ways to get Odd Sum
- Maximum String Partition
- Count of integers that divide all the elements of the given array
- Check if string can be rearranged so that every Odd length Substring is Palindrome
- Probability such that two subset contains same number of elements
- Find permutation with maximum remainder Sum

souradeep hasn't improved any 'Articles' yet!