This are combined level of questions of prefix/suffix and sliding window.
Hard level topic usually asked in higher level of tech interviews at top MNCs.
Notes: https://drive.google.com/drive/folders/1EjbB1IdMiK3ErQYmham2DbbmKTKhr99r?usp=sharing
Questions:
https://leetcode.com/problems/find-two-non-overlapping-sub-arrays-each-with-target-sum/
https://leetcode.com/problems/maximum-sum-of-two-non-overlapping-subarrays/
#prefix #suffix #dp #slidingwindow #dsa #techinterview #code
