LeetCode
Question
·
Nov 2021
Just finished Facebook VO
5 upvotes
2,861 views
13 replies
Question Details
1650, needs O(1) space 227, O(1) space 460, this one needs time complexity better than O(n^2) but no solutions are better than that. Any idea?
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Coding
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