DivyanshuShekhar1
DivyanshuShekhar1
  1. Sum of maximum elements of all possible sub-arrays of an array
  2. Sum of minimum elements of all possible sub-arrays of an array
  3. Sum of XOR of all subarrays
  4. Sum of bitwise AND of all subarrays
  5. Merge K sorted arrays | Set 3 ( Using Divide and Conquer Approach )
  6. Search element in a Spirally sorted Matrix
  7. Merge K sorted arrays of different sizes | ( Divide and Conquer Approach )
  8. Sum of all Submatrices of a Given Matrix
  9. XOR of a submatrix queries
  10. Number of submatrices with OR value 1
  11. Number of submatrices with all 1s
  12. XOR of XORs of all sub-matrices
  13. Sum of bitwise AND of all submatrices
  14. Sum of Bitwise-OR of all Submatrices
  15. Double Knapsack | Dynamic Programming
  16. Two equal sum segment range queries
  17. Count number of ways to reach a given score in a Matrix
  18. XOR of all the elements in the given range [L, R]
  19. Maximum sum such that no two elements are adjacent | Set 2
  20. Find minimum steps required to reach the end of a matrix | Set - 1
  21. Number of ways to reach the end of matrix with non-zero AND value
  22. Minimize the number of steps required to reach the end of the array
  23. Find minimum steps required to reach the end of a matrix | Set 2
  24. Minimize the number of steps required to reach the end of the array | Set 2
  25. Minimum steps required to reach the end of a matrix | Set 2
  26. Queries for bitwise OR in the index range [L, R] of the given array
  27. Queries for bitwise AND in the index range [L, R] of the given array
  28. Queries for bitwise AND in the given matrix
  29. Queries for bitwise OR in the given matrix
  30. Maximum sum in an array such that every element has exactly one adjacent element to it
  31. Sum of maximum of all subarrays | Divide and Conquer
  32. Count number of ways to divide an array into two halves with same sum
  33. Number of subsets with zero sum
You may use GeeksforGeeks CONTRIBUTE portal to help other geeks. For more info, please refer this.