LeetCode
Question
·
Jul 2020
·
Los Angeles
Facebook | Phone | Max Sum of Non-overlapping Subarray with Fixed Sum
1 upvote
365 views
3 replies
Question Details
This question contains two part: 1. Count the number of subarrays (continuous) whose sum equal to the given k. 2. In all subarrays found above, find as many non-overlapping subarrays as possible...
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Arrays
More from Meta
Reddit
Leetcode is cooked in 2026 and we don't hire people who only grind leetcode.
Reddit
Returning to SWE work after 3 years of cancer treatment
Reddit
2026 New Grad Recap
Reddit
Most likely failed meta phone screen
Reddit
Targeting OpenAI SWE Roles? Insights on what to expect from recent system design loops