面的是 DocuSign Front End Engineer 3
地点在 San Francisco
我做了五年 Full stack
店面 (1 小时)
- Coding questions related to Javascript closures.
- Given a Javascript Map as <Name, Year Of Birth>, find the year with maximum number of births.
Onsite
第一轮
- https://leetcode.com/problems/longest-substring-without-repeating-characters/
- Implementation of Memoization in Javascript using closures
第二轮
- https://leetcode.com/problems/binary-tree-inorder-traversal/, n-ary tree
- https://leetcode.com/problems/linked-list-cycle/
- https://leetcode.com/problems/peak-index-in-a-mountain-array/
第三轮
- https://leetcode.com/problems/valid-palindrome/
- Javascript Prototypes
- Adding string reverse method to String prototype in Javascript
第四轮
- Design an algorithm to find the shortest path between two people in a social network. Coding on white board
- Follow up question:- Scaling if we have a billion users
第五轮
- Behavioral questions with Manager
- Some standard scalability questions related to Master Slave architecture, Load Balancer, Nginx Proxy etc
- Asynchronous programming in Javascript, Promises, async, await etc
第六轮 [第二天面的 Director]
- Behavioral questions
第三天收到 Offer