Screening:

1. Binary Tree Vertical Order Traversal No variant

2. Flatten 2D Vector No variant

Coding 1:

1. Max Consecutive Ones III
   Variant: Instead of 1s and 0s, ‘H’ and ‘W’.
   days = [‘W’,’H’,’H’,’W’,’W’,’H’,W’] and PTO = 2
   Output: 5

2. Populating Next Right Pointers in Each Node No variant
   Expected O(1) space complexity, so needed to use linked list approach

Coding 2:

1. Dot Product of Two Sparse Vectors No variant

2. Binary Tree Right Side View
   Variant: Get Left and Right-Side Views

Product Architecture:

1. An easier version of TicketMaster (only 1 venue and no seat mapping)

Behavioral:

1. Challenging project
2. Difficult coworker
3. Tight deadline
4. Mentoring experience
5. Conflict resolution

Verdict: Rejected. I heard back in 3 business days