摘要：
Example1: (Customer Obsession, Ownership) Problem: one bad affiliate can impact all the customers Solution: failure resilience project Result: Saved c 阅读全文
摘要：
Design a data structure that supports the following two operations: search(word) can search a literal word or a regular expression string containing o 阅读全文
摘要：
Inorder Successor in Binary Search Tree 2.8 In Binary Tree, Inorder successor of a node is the next node in Inorder traversal of the Binary Tree. Inor 阅读全文
摘要：
Given a non-empty binary search tree and a target value, find k values in the BST that are closest to the target. Note: Given target value is a floati 阅读全文
摘要：
Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target. Note: Given target value is a floati 阅读全文
摘要：
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive. Example: Note: 阅读全文
摘要：
2017(10-12月) 码农类 博士 全职@Facebook - 猎头 - Onsite |Fail在职跳槽1. 1。 Laoyin. Validate BST. Regex matching。烙印给完题都举好多个例子，有拖延时间的嫌疑。regex那题本人做过但做不到秒杀，烙印非要我解释清楚再写c 阅读全文
摘要：
Given an unsorted array nums, reorder it in-place such that nums[0] <= nums[1] >= nums[2] <= nums[3].... For example, given nums = [3, 5, 2, 1, 6, 4], 阅读全文
摘要：
1. 給你兩個string if function(s1) == function(s2) return trueelse return false. 1point3acres.com/bbsfunction做的事情 遇到b 就刪除前面一個字元 其他就不管 當b太多的時候 return "" for 阅读全文