Meta Offer | Coding Interview Experience

Hey y'all, reposting on behalf of anonymous's Meta interview experience (to be clear, they were asked the listed variants). OP communicated he decided to stay, um, anonymous. Here's the original [Post

Hey y'all, reposting on behalf of anonymous's Meta interview experience (to be clear, they were asked the listed variants). OP communicated he decided to stay, um, anonymous. Here's the original Post but I enriched the questions with more deets below (links to leetcode problem): 1. LC 1004: Max Consecutive Ones III. Variant with matrix - what if you had to return the maximum number of PTO days you can consecutively take given an array of W and H's? W is a work day, and H is a holiday. The trick is, you have to do this in a 2D matrix, N * M. 2. LC 708: Insert into Sorted Circular Linked List. Variant with "loose" sorting. 3. LC 1091: Shortest Path in Binary Matrix. Variant,

return a (need NOT be the shortest) path. Here, please use DFS. They're looking to trip you up, thinking you'll instinctively solve it with BFS. 4. LC 528: Random Pick By Weight. Variant with city name and population dictionary. Had to return a city instead of index. FYI, big tech companies like Meta and Google will almost always ask this variant. Overall, the return type differs, and so does the input (and thus, a bit of your implementation). 5. LC 1249: Minimum Remove to make valid parentheses. Easy variant, just had to give the number of removals 6. LC 71: Simplify Path. Variant with pwd

output and cd command argument.

Output absolute path after cd'ing from pwd. Please be aware they could ask you a follow-up with ~ commands. 7. LC 680: Valid Palindrome II (No variant) 8. LC 215: Kth Largest Element in an Array (No variant) Hope this helps & good luck on your studies!