DivyanshuShekhar1
DivyanshuShekhar1
  1. Number of subarrays having absolute sum greater than K | Set-2
  2. Flatten BST to sorted list | Decreasing order
  3. Sum of maximum elements of all possible sub-arrays of an array
  4. Number of ways to reach the end of matrix with non-zero AND value
  5. Minimize the number of steps required to reach the end of the array
  6. Count number of increasing sub-sequences : O(NlogN)
  7. Find minimum steps required to reach the end of a matrix | Set - 1
  8. Number of ways to divide a Binary tree into two halves
  9. Sum of minimum elements of all possible sub-arrays of an array
  10. Sum of XOR of all subarrays
  11. Sum of bitwise AND of all subarrays
  12. Merge K sorted arrays | Set 3 ( Using Divide and Conquer Approach )
  13. Search element in a Spirally sorted Matrix
  14. Merge K sorted arrays of different sizes | ( Divide and Conquer Approach )
  15. Sum of all Submatrices of a Given Matrix
  16. XOR of a submatrix queries
  17. Number of submatrices with OR value 1
  18. Number of submatrices with all 1s
  19. XOR of XORs of all sub-matrices
  20. Sum of bitwise AND of all submatrices
  21. Sum of Bitwise-OR of all Submatrices
  22. Double Knapsack | Dynamic Programming
  23. Two equal sum segment range queries
  24. Count number of ways to reach a given score in a Matrix
  25. XOR of all the elements in the given range [L, R]
  26. Maximum sum such that no two elements are adjacent | Set 2
  27. Find minimum steps required to reach the end of a matrix | Set 2
  28. Minimize the number of steps required to reach the end of the array | Set 2
  29. Minimum steps required to reach the end of a matrix | Set 2
  30. Queries for bitwise OR in the index range [L, R] of the given array
  31. Queries for bitwise AND in the index range [L, R] of the given array
  32. Queries for bitwise AND in the given matrix
  33. Queries for bitwise OR in the given matrix
  34. Maximum sum in an array such that every element has exactly one adjacent element to it
  35. Sum of maximum of all subarrays | Divide and Conquer
  36. Subset with sum closest to zero
  37. Count number of ways to divide an array into two halves with same sum
  38. Number of subsets with zero sum
  39. Number of ways to divide an array into K equal sum sub-arrays
  40. Queries to check if string B exists as substring in string A
  41. Maximise matrix sum by following the given Path
  42. Maximise array sum after taking non-overlapping sub-arrays of length K
  43. Maximum sum of non-overlapping subarrays of length atmost K
  44. Queries to check whether all the elements can be made positive by flipping signs exactly K times
  45. 0-1 knapsack queries
  46. Fractional Knapsack Queries
  47. Count number of distinct substrings of a given length
  48. Maximum items that can be filled in K Knapsacks of given Capacity
  49. Number of ways to split a binary number such that every part is divisible by 2
  50. Coin Change | BFS Approach
  51. Flatten BST to sorted list | Increasing order
  52. Flatten Binary Tree in order of Zig Zag traversal
  53. Flatten Binary Tree in order of Level Order Traversal
  54. Pair with a given sum in BST | Set 2
  55. Find three element from given three arrays such that their sum is X | Set 2
  56. Number of pairs with a given sum in a Binary Search Tree
  57. Triplet with a given sum in BST | Set 2
  58. Nodes from given two BSTs with sum equal to X
  59. Find the minimum absolute difference in two different BST's
  60. Cartesian tree from inorder traversal | Segment Tree
  61. Flatten binary tree in order of post-order traversal
  62. Pair with minimum absolute difference | BST
  63. Implementing Forward Iterator in BST
  64. Implementing Backward Iterator in BST
  65. Longest sub-sequence with maximum GCD
  66. Longest sub-sequence with non-negative sum
  67. Count of subsets with sum equal to X
  68. Number of non-decreasing sub-arrays of length K
  69. Number of subsets with a given AND value
  70. Sum of subsets of all the subsets of an array | O(3^N)
  71. Longest sub-sequence with minimum LCM
  72. Number of subsets with a given OR value
  73. Sum of subsets of all the subsets of an array | O(2^N)
  74. Sum of subsets of all the subsets of an array | O(N)
  75. Longest subsequence whose sum is divisible by a given number
  76. Longest subsequence with a given AND value
  77. Number of non-decreasing sub-arrays of length greater than or equal to K
  78. Number of non-decreasing sub-arrays of length less than or equal to K
  79. Longest sub-sequence with a given OR value : O(N) Approach
  80. Maximum number of splits of a binary number
  81. Longest subsequence with a given AND value | O(N)
  82. Check the divisibility of Hexadecimal numbers
  83. Number of subarrays with GCD equal to 1
  84. Longest subsequence with a given OR value : Dynamic Programming Approach
  85. Smallest subarray with GCD as 1 | Segment Tree
  86. Number of subsets with sum divisible by M | Set 2
  87. Number of subarrays with GCD = 1 | Segment tree
  88. Knapsack with large Weights
  89. Find whether X exists in Y after jumbling X
  90. Largest number dividing maximum number of elements in the array
  91. Remove one element to get minimum OR value
  92. Remove one element to get maximum XOR
  93. Number of subsequences in a given binary string divisible by 2
  94. Number of sub-strings in a given binary string divisible by 2
  95. Largest sub-string of a binary string divisible by 2
  96. Minimum elements to be removed from the ends to make the array sorted
  97. Smallest number dividing minimum number of elements in the array | Set 2
  98. Expected number of moves to reach the end of a board | Dynamic programming
  99. Expected number of moves to reach the end of a board | Matrix Exponentiation
  100. Smallest non-zero substring which has any permutation divisible by 2^K
  101. Smallest number dividing minimum number of elements in the Array
  102. Remove minimum numbers from the array to get minimum OR value
  103. Maximize the sum of differences of consecutive elements after removing exactly K elements
  104. Remove minimum elements from ends of array so that sum decreases by at least K | O(N)
  105. Number of sub-sequences of non-zero length of a binary string divisible by 3
  106. Longest sub-sequence of a binary string divisible by 3
  107. Longest sub-array with maximum GCD
  108. Number of ways to convert a character X to a string Y
  109. Minimum swaps required to make a binary string divisible by 2^k
  110. Minimum cost to traverse from one index to another in the String
  111. Minimum cost to reach from the top-left to the bottom-right corner of a matrix
  112. Minimize the sum of differences of consecutive elements after removing exactly K elements
  113. Largest row-wise and column-wise sorted sub-matrix
You may use GeeksforGeeks CONTRIBUTE portal to help other geeks. For more info, please refer this.