LeetCode
Question
·
Jul 2021
·
Los Angeles
Facebook | Phone Screen
7 upvotes
2,387 views
12 replies
Question Details
Find longest subsequence in s that repeats n times. If multiple output any. Examples: s = "0011100111" and n = 3 should output "11" s = "0011100111" and n = 2...
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Dynamic Programming
Strings
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