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