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. Find minimum steps required to reach the end of a matrix | Set - 1
  7. Number of ways to divide a Binary tree into two halves
  8. Sum of minimum elements of all possible sub-arrays of an array
  9. Sum of XOR of all subarrays
  10. Sum of bitwise AND of all subarrays
  11. Merge K sorted arrays | Set 3 ( Using Divide and Conquer Approach )
  12. Search element in a Spirally sorted Matrix
  13. Merge K sorted arrays of different sizes | ( Divide and Conquer Approach )
  14. Sum of all Submatrices of a Given Matrix
  15. XOR of a submatrix queries
  16. Number of submatrices with OR value 1
  17. Number of submatrices with all 1s
  18. XOR of XORs of all sub-matrices
  19. Sum of bitwise AND of all submatrices
  20. Sum of Bitwise-OR of all Submatrices
  21. Double Knapsack | Dynamic Programming
  22. Two equal sum segment range queries
  23. Count number of ways to reach a given score in a Matrix
  24. XOR of all the elements in the given range [L, R]
  25. Maximum sum such that no two elements are adjacent | Set 2
  26. Find minimum steps required to reach the end of a matrix | Set 2
  27. Minimize the number of steps required to reach the end of the array | Set 2
  28. Minimum steps required to reach the end of a matrix | Set 2
  29. Queries for bitwise OR in the index range [L, R] of the given array
  30. Queries for bitwise AND in the index range [L, R] of the given array
  31. Queries for bitwise AND in the given matrix
  32. Queries for bitwise OR in the given matrix
  33. Maximum sum in an array such that every element has exactly one adjacent element to it
  34. Sum of maximum of all subarrays | Divide and Conquer
  35. Subset with sum closest to zero
  36. Count number of ways to divide an array into two halves with same sum
  37. Number of subsets with zero sum
  38. Number of ways to divide an array into K equal sum sub-arrays
  39. Queries to check if string B exists as substring in string A
  40. Maximise matrix sum by following the given Path
  41. Maximise array sum after taking non-overlapping sub-arrays of length K
  42. Maximum sum of non-overlapping subarrays of length atmost K
  43. Queries to check whether all the elements can be made positive by flipping signs exactly K times
  44. 0-1 knapsack queries
  45. Count number of distinct substrings of a given length
  46. Maximum items that can be filled in K Knapsacks of given Capacity
  47. Coin Change | BFS Approach
  48. Flatten BST to sorted list | Increasing order
  49. Flatten Binary Tree in order of Zig Zag traversal
  50. Flatten Binary Tree in order of Level Order Traversal
  51. Pair with a given sum in BST | Set 2
  52. Find three element from given three arrays such that their sum is X | Set 2
  53. Number of pairs with a given sum in a Binary Search Tree
  54. Triplet with a given sum in BST | Set 2
  55. Nodes from given two BSTs with sum equal to X
  56. Find the minimum absolute difference in two different BST's
  57. Cartesian tree from inorder traversal | Segment Tree
  58. Flatten binary tree in order of post-order traversal
  59. Pair with minimum absolute difference | BST
  60. Implementing Forward Iterator in BST
  61. Implementing Backward Iterator in BST
You may use GeeksforGeeks CONTRIBUTE portal to help other geeks. For more info, please refer this.