Redian新闻
>
问JMS资生堂THE SKINCARE系列的如何
avatar
问JMS资生堂THE SKINCARE系列的如何# Fashion - 美丽时尚
x*1
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好像以前问过这个题
avatar
l*3
2
天气干,想试一下,不知道大家有没有用过这个系列产品,效果怎样,多谢了先
avatar
c*e
3
bless
avatar
R*d
4
bless
avatar
f*3
5
bless
avatar
l*u
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:

avatar
m*s
7
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:

avatar
n*o
8
bless!
avatar
s*y
9
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:

avatar
l*y
10
blessing!!
avatar
C*m
11
bless
avatar
z*g
12
bless!
avatar
x*1
13
两个电话面试,有一些小问题忘了,大概周一给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好像以前问过这个题
avatar
c*e
14
bless
avatar
R*d
15
bless
avatar
f*3
16
bless
avatar
l*u
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:

avatar
m*s
18
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:

avatar
n*o
19
bless!
avatar
s*y
20
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:

avatar
l*y
21
blessing!!
avatar
C*m
22
bless
avatar
z*g
23
bless!
avatar
c*l
24
mark, thx lz
相关阅读
logo
联系我们隐私协议©2024 redian.news
Redian新闻
Redian.news刊载任何文章,不代表同意其说法或描述,仅为提供更多信息,也不构成任何建议。文章信息的合法性及真实性由其作者负责,与Redian.news及其运营公司无关。欢迎投稿,如发现稿件侵权,或作者不愿在本网发表文章,请版权拥有者通知本网处理。