脸熟纽约面经

目前是 Software Engineer at Financial Services

店面45分钟考了 https://leetcode.com/problems/bulb-switcher/
Variation of https://leetcode.com/problems/range-sum-query-2d-immutable/

Onsite 5轮:
Coding round 1 (45 minutes): https://leetcode.com/problems/add-binary
Binary tree iterator

BQ轮 (45 minutes):
1 coding question at the end. It was least common ancestor for a tree.

午饭 (30 minutes)

系统设计 (45 minutes):
Design game feature in facebook. It was a chess game. It should have the following features
1. Play with friends
2. Undo move
3. Scoreboard

Coding round 2 (45 minutes):
类似 https://leetcode.com/problems/nested-list-weight-sum/
还有 https://leetcode.com/problems/k-closest-points-to-origin/

Coding round 3 (45 minutes):
IsAlmostPalindrome. Basically, figure out if the string becomes a palindrome after deleteing one character
Variation of https://leetcode.com/problems/average-of-levels-in-binary-tree/. Mine was a tree, not a binary tree.