1. Random list of M non-negative integers whose sum is N
  2. Greatest divisor which divides all natural number in range [L, R]
  3. Count pairs in an array such that LCM(arr[i], arr[j]) > min(arr[i],arr[j])
  4. Count ordered pairs of positive numbers such that their sum is S and XOR is K
  5. Maximum value of XOR among all triplets of an array
  6. Count permutation such that sequence is non decreasing
  7. Concatenate strings in any order to get Maximum Number of "AB"
  8. Find number of magical pairs of string of length L
  9. Find the total Number of Digits in (N!)N
  10. Count pairs (i,j) such that (i+j) is divisible by A and B both
  11. Minimum Bitwise AND operations to make any two array elements equal
  12. Minimum number of segments required such that each segment has distinct elements
  13. Check if there exists any sub-sequence in a string which is not palindrome
  14. Check if suffix and prefix of a string are palindromes
  15. All possible co-prime distinct element pairs within a range [L, R]
  16. Check whether a binary string can be formed by concatenating given N numbers sequentially
  17. Count numbers whose difference with N is equal to XOR with N
  18. Count unordered pairs (i,j) such that product of a[i] and a[j] is power of two
  19. Count number of ordered pairs with Even and Odd Sums
  20. Sub-strings having exactly k characters that have ASCII value greater than p
  21. Count number of ordered pairs with Even and Odd Product
  22. All possible numbers of N digits and base B without leading zeros
  23. Check if it is possible to rearrange a binary string with alternate 0s and 1s
  24. Check if there is any pair in a given range with GCD is divisible by k
  25. Convert all lowercase characters to uppercase whose ASCII value is co-prime with k
  26. Find two numbers whose sum and GCD are given
  27. Probability of getting two consecutive heads after choosing a random coin among two different types of coins
  28. Sum of first N natural numbers which are not powers of K
  29. Count pairs of numbers from 1 to N with Product divisible by their Sum
  30. Minimum value that divides one number and divisible by other
  31. Find probability that a player wins when probabilities of hitting the target are given
  32. Count number of set bits in a range using bitset
  33. Composite XOR and Coprime AND
  34. Minimum operations of the given type required to make a complete graph
  35. Count number of trailing zeros in (1^1)*(2^2)*(3^3)*(4^4)*..
  36. Count all Prime Length Palindromic Substrings
  37. Arrange first N natural numbers such that absolute difference between all adjacent elements > 1
  38. Increasing sequence with given GCD
  39. Number of Simple Graph with N Vertices and M Edges
  40. Generate minimum sum sequence of integers with even elements greater
  41. Maximum money that can be withdrawn in two steps
  42. Minimum steps to make the product of the array equal to 1
  43. Choose points from two ranges such that no point lies in both the ranges
  44. Maximize the sum of products of the degrees between any two vertices of the tree
  45. Modify a binary array to Bitwise AND of all elements as 1
  46. Count all possible N digit numbers that satisfy the given condition
  47. Minimum LCM and GCD possible among all possible sub-arrays
  48. Ways to Remove Edges from a Complete Graph to make Odd Edges
  49. Find smallest number K such that K % p = 0 and q % K = 0
  50. Generate array with minimum sum which can be deleted in P steps
  51. Count number of trailing zeros in Binary representation of a number using Bitset
  52. Maximum length of subarray such that sum of the subarray is even
  53. Minimum deletions required such that any number X will occur exactly X times
  54. Partition first N natural number into two sets such that their sum is not coprime
  55. Count pairs of strings that satisfy the given conditions
  56. Count number of common elements between two arrays by using Bitset and Bitwise operation
  57. Find Nth smallest number that is divisible by 100 exactly K times
  58. Find maximum value of the last element after reducing the array with given operations
  59. Minimum deletions required to make GCD of the array equal to 1
  60. Find a sequence of N prime numbers whose sum is a composite number
  61. Minimum operations required to make every element greater than or equal to K
  62. Number of intersections between two ranges
  63. Length of longest subarray in which elements greater than K are more than elements not greater than K
  64. Count number of ways to get Odd Sum
  65. Maximum String Partition
  66. Count of integers that divide all the elements of the given array
  67. Check if string can be rearranged so that every Odd length Substring is Palindrome
  68. Probability such that two subset contains same number of elements
  69. Find permutation with maximum remainder Sum
  70. Find numbers which are multiples of first array and factors of second array
  71. Find the sum of prime numbers in the Kth array
  72. Count number of binary strings such that there is no substring of length greater than or equal to 3 with all 1's
  73. Count total number of even sum sequences
  74. Find the ratio of number of elements in two Arrays from their individual and combined average
  75. Find next greater element with no consecutive 1 in it's binary representation
  76. Sum of Digits of the Good Strings
  77. Sum of numbers in a range [L, R] whose count of divisors is prime
  78. Count non-adjacent subsets from numbers arranged in Circular fashion
  79. Count of pairs in an array such that the highest power of 2 that divides their product is 1
  80. Find Range Value of the Expression
  81. Minimize sum by dividing all elements of a subarray by K
  82. Length of the longest subsequence such that xor of adjacent elements is non-decreasing
  83. Maximum prime moves to convert X to Y
  84. Minimum number to be added to all digits of X to make X > Y
  85. Rearrange array elements such that Bitwise AND of first N - 1 elements is equal to last element
  86. Find Kth smallest value for b such that a + b = a | b
  87. Find permutation array from the cumulative sum array
  88. Find the coordinates of a triangle whose Area = (S / 2)
  89. Minimize the sum of digits of A and B such that A + B = N
  90. Find the integer points (x, y) with Manhattan distance atleast N
  91. Number of binary strings such that there is no substring of length ≥ 3
  92. Find an array of size N that satisfies the given conditions
  93. Queries to check whether bitwise AND of a subarray is even or odd
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.