← Back to experiences
[ OK ] Loaded —
[ INFO ]
$ cd
$ ls -lt
01
02
03
04
05
$ ls -lt
01
02
03
04
05
user@intervues:~/experiences/…$
Background: 6 YOE, Previous experience at Google and TikTok Position: E5 SWE at Meta Location: London Date: April
Screening: 0) Find range sum in BST. 1) Max sequence of 1s in a binary array if we can flip no more than k zeros
Onsite Coding 1: 0) Find sliding window max in an array 1) Print elements of a BST left to right
Onsite Coding 2: 0) Find shortest path in a binary matrix, follow-up: what if it's an infinite field 1) Find minimum number of flips of 0s into 1s in a binary m x n matrix to make the size of the biggest adjacent set of 1s >=k (k is given)
System design: Design a system which removes "bad" ad posts from Instagram before they are visible to users
Behavioral: Multiple STAR method questions.
Successfully completed all questions and advanced to team matching.