1. Greatest divisor which divides all natural number in range [L, R]
  2. Count pairs in an array such that LCM(arr[i], arr[j]) > min(arr[i],arr[j])
  3. Count ordered pairs of positive numbers such that their sum is S and XOR is K
  4. Maximum value of XOR among all triplets of an array
  5. Concatenate strings in any order to get Maximum Number of "AB"
  6. Find number of magical pairs of string of length L
  7. Find the total Number of Digits in (N!)N
  8. Count pairs (i,j) such that (i+j) is divisible by A and B both
  9. Minimum Bitwise AND operations to make any two array elements equal
  10. Minimum number of segments required such that each segment has distinct elements
  11. Check if there exists any sub-sequence in a string which is not palindrome
  12. Check if suffix and prefix of a string are palindromes
  13. All possible co-prime distinct element pairs within a range [L, R]
  14. Check whether a binary string can be formed by concatenating given N numbers sequentially
  15. Count numbers whose difference with N is equal to XOR with N
  16. Count unordered pairs (i,j) such that product of a[i] and a[j] is power of two
  17. Count number of ordered pairs with Even and Odd Sums
  18. Sub-strings having exactly k characters that have ASCII value greater than p
  19. Count number of ordered pairs with Even and Odd Product
  20. All possible numbers of N digits and base B without leading zeros
  21. Check if it is possible to rearrange a binary string with alternate 0s and 1s
  22. Check if there is any pair in a given range with GCD is divisible by k
  23. Convert all lowercase characters to uppercase whose ASCII value is co-prime with k
  24. Find two numbers whose sum and GCD are given
  25. Probability of getting two consecutive heads after choosing a random coin among two different types of coins
  26. Sum of first N natural numbers which are not powers of K
  27. Count pairs of numbers from 1 to N with Product divisible by their Sum
  28. Minimum value that divides one number and divisible by other
  29. Find probability that a player wins when probabilities of hitting the target are given
  30. Count number of set bits in a range using bitset
  31. Composite XOR and Coprime AND
  32. Minimum operations of the given type required to make a complete graph
  33. Count number of trailing zeros in (1^1)*(2^2)*(3^3)*(4^4)*..
  34. Count all Prime Length Palindromic Substrings
  35. Arrange first N natural numbers such that absolute difference between all adjacent elements > 1
  36. Increasing sequence with given GCD
  37. Number of Simple Graph with N Vertices and M Edges
  38. Generate minimum sum sequence of integers with even elements greater
  39. Maximum money that can be withdrawn in two steps
  40. Choose points from two ranges such that no point lies in both the ranges
  41. Maximize the sum of products of the degrees between any two vertices of the tree
  42. Modify a binary array to Bitwise AND of all elements as 1
  43. Count all possible N digit numbers that satisfy the given condition
  44. Minimum LCM and GCD possible among all possible sub-arrays
  45. Ways to Remove Edges from a Complete Graph to make Odd Edges
  46. Find smallest number K such that K % p = 0 and q % K = 0
  47. Generate array with minimum sum which can be deleted in P steps
  48. Count number of trailing zeros in Binary representation of a number using Bitset
  49. Maximum length of subarray such that sum of the subarray is even
  50. Minimum deletions required such that any number X will occur exactly X times
  51. Partition first N natural number into two sets such that their sum is not coprime
  52. Count pairs of strings that satisfy the given conditions
  53. Count number of common elements between two arrays by using Bitset and Bitwise operation
  54. Find Nth smallest number that is divisible by 100 exactly K times
  55. Find maximum value of the last element after reducing the array with given operations
  56. Minimum deletions required to make GCD of the array equal to 1
  57. Find a sequence of N prime numbers whose sum is a composite number
  58. Minimum operations required to make every element greater than or equal to K
  59. Number of intersections between two ranges
You may use GeeksforGeeks CONTRIBUTE portal to help other geeks. For more info, please refer this.

souradeep hasn't improved any 'Articles' yet!
You may use GeeksforGeeks CONTRIBUTE portal to help other geeks. For more info, please refer this.