x******1
发帖数: 155 | 1 两个电话面试，有一些小问题忘了,大概周一给feedback，希望可以move on.
Person 1：
Class vs object
Hashtable vs binary search tree, insert, search, delete
What is balanced binary search tree?
The worst complexity of binary search tree: O(n), why O(n)? not O(logn)
Singleton, follow-up: how to prevent from producing multiple instances
coding question:
bool strStr(char *s1, char *s2) leetcode原题
Person 2:
Write a function to reverse the sentence such that all words are reveresed
in place, but numbers and punctuation marks remain unchanged.
Example "I have 30 books, 20 pens, and one notebook." -> "I evah 30 skoob,
20 snep, dna eno koobeton."
Ebay好像以前问过这个题 | c********e
发帖数: 186 | | R*******d
发帖数: 13640 | | f*******3
发帖数: 206 | | l*********u
发帖数: 19053 | 5 bless
【在 x******1 的大作中提到】
: 两个电话面试，有一些小问题忘了,大概周一给feedback，希望可以move on.
: Person 1：
: Class vs object
: Hashtable vs binary search tree, insert, search, delete
: What is balanced binary search tree?
: The worst complexity of binary search tree: O(n), why O(n)? not O(logn)
: Singleton, follow-up: how to prevent from producing multiple instances
: coding question:
: bool strStr(char *s1, char *s2) leetcode原题
: Person 2:
| m******s
发帖数: 1469 | 6 Bless
【在 x******1 的大作中提到】
: 两个电话面试，有一些小问题忘了,大概周一给feedback，希望可以move on.
: Person 1：
: Class vs object
: Hashtable vs binary search tree, insert, search, delete
: What is balanced binary search tree?
: The worst complexity of binary search tree: O(n), why O(n)? not O(logn)
: Singleton, follow-up: how to prevent from producing multiple instances
: coding question:
: bool strStr(char *s1, char *s2) leetcode原题
: Person 2:
| n****o
发帖数: 239 | | s****y
发帖数: 478 | 8 bless
【在 x******1 的大作中提到】
: 两个电话面试，有一些小问题忘了,大概周一给feedback，希望可以move on.
: Person 1：
: Class vs object
: Hashtable vs binary search tree, insert, search, delete
: What is balanced binary search tree?
: The worst complexity of binary search tree: O(n), why O(n)? not O(logn)
: Singleton, follow-up: how to prevent from producing multiple instances
: coding question:
: bool strStr(char *s1, char *s2) leetcode原题
: Person 2:
|
| l****y
发帖数: 1461 | | C******m
发帖数: 213 | | | | z******g
发帖数: 271 | | x******1
发帖数: 155 | 12 两个电话面试，有一些小问题忘了,大概周一给feedback，希望可以move on.
Person 1：
Class vs object
Hashtable vs binary search tree, insert, search, delete
What is balanced binary search tree?
The worst complexity of binary search tree: O(n), why O(n)? not O(logn)
Singleton, follow-up: how to prevent from producing multiple instances
coding question:
bool strStr(char *s1, char *s2) leetcode原题
Person 2:
Write a function to reverse the sentence such that all words are reveresed
in place, but numbers and punctuation marks remain unchanged.
Example "I have 30 books, 20 pens, and one notebook." -> "I evah 30 skoob,
20 snep, dna eno koobeton."
Ebay好像以前问过这个题 | c********e
发帖数: 186 | | R*******d
发帖数: 13640 | | f*******3
发帖数: 206 | | l*********u
发帖数: 19053 | 16 bless
【在 x******1 的大作中提到】
: 两个电话面试，有一些小问题忘了,大概周一给feedback，希望可以move on.
: Person 1：
: Class vs object
: Hashtable vs binary search tree, insert, search, delete
: What is balanced binary search tree?
: The worst complexity of binary search tree: O(n), why O(n)? not O(logn)
: Singleton, follow-up: how to prevent from producing multiple instances
: coding question:
: bool strStr(char *s1, char *s2) leetcode原题
: Person 2:
| m******s
发帖数: 1469 | 17 Bless
【在 x******1 的大作中提到】
: 两个电话面试，有一些小问题忘了,大概周一给feedback，希望可以move on.
: Person 1：
: Class vs object
: Hashtable vs binary search tree, insert, search, delete
: What is balanced binary search tree?
: The worst complexity of binary search tree: O(n), why O(n)? not O(logn)
: Singleton, follow-up: how to prevent from producing multiple instances
: coding question:
: bool strStr(char *s1, char *s2) leetcode原题
: Person 2:
| n****o
发帖数: 239 | | s****y
发帖数: 478 | 19 bless
【在 x******1 的大作中提到】
: 两个电话面试，有一些小问题忘了,大概周一给feedback，希望可以move on.
: Person 1：
: Class vs object
: Hashtable vs binary search tree, insert, search, delete
: What is balanced binary search tree?
: The worst complexity of binary search tree: O(n), why O(n)? not O(logn)
: Singleton, follow-up: how to prevent from producing multiple instances
: coding question:
: bool strStr(char *s1, char *s2) leetcode原题
: Person 2:
| l****y
发帖数: 1461 | | | | C******m
发帖数: 213 | | z******g
发帖数: 271 | | c*****l
发帖数: 1493 | |
|
