I have been trying to crack FAANG for 1.5 years now. Have given interviews to almost every FAANG company and gotten rejected. Today, it gives me great pleasure to share with you guys that I finally cracked the F in FAANG.

Leetcode and this community has been the north star in my interview prep and I feel like I owe this community and would like to give back. Below are the details of my recent onsite @ Meta/Facebook. I hope it helps someone.

For those who aspire to take this journey, to you I say, keep grinding, you'll get there.

Phone Screen:
1- valid-palindrome-2 (https://leetcode.com/problems/valid-palindrome-ii)
Recursive solution -> O(n) time and O(n) space for recursive stack
2 - diameter-of-a-binary-tree (https://leetcode.com/problems/diameter-of-binary-tree)
Recursive solution -> O(n) time and O(n) space for recursive stack

Onsite
Round 1:
System Design: Distributed Web Crawler

Round 2:
1 - Valid Word Abbreviation (https://leetcode.com/problems/valid-word-abbreviation)
Two Pointer -> O(n) time with O(1) space
2 - Shortest Path in a Binary Matrix (https://leetcode.com/problems/shortest-path-in-binary-matrix)
BFS -> O(nm) time and O(nm) space

Round 3:
1 - Variation of LRU cache (https://leetcode.com/problems/lru-cache)
DoublyLinkedList + Map solution -> O(1) time for all operations and O(n) space
2 - Minimum remove to make valid parenthesis (https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/)
Stack + HashSet solution -> O(n) time with O(n) space

Round 4:
Behavioral:

• Recent complex project
• Conflict Resolution