LeetCode
Question
·
Apr 2022
·
Los Angeles
Meta | Phone Screen | Partition Array Into Two Arrays to Minimize Sum Difference Time Complexity
426 views
3 replies
Question Details
I was given the following algorithm for a very similar problem as this one: I am asked to give the time and space complexity for the code below. js const bestJSMeetInMiddle = function...
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Arrays
Binary Search
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