Redian新闻
>
求本书 Cracking Coding Interviews,
avatar
f*7
2
amazon买新书吧,这点钱算啥
avatar
z*2
3
Top 10 tech interview questions
Reverse a singly lined list
Print a binary search tree level by level
Max sub sequence problem
Find the nth smallest/largest number in a unsorted array
Two sum, three sun problem
Implement math pow function
Implement merge sort for more than two arrays
Find all the anagrams from a list of words
BFS and its variants (such as determine whether a graph is bipartie)
Coin change algorithm (given a number of denominations and a target number,
find the total number of ways to make the change).

【在 z**********2 的大作中提到】
: 哪儿有啊,谢谢
avatar
z*2
4
电子版呢
搬家带着不方便

【在 f*****7 的大作中提到】
: amazon买新书吧,这点钱算啥
avatar
g*y
5
这本书真要买。。。不要省钱。电子书没有最新版的好像。

【在 z**********2 的大作中提到】
: 哪儿有啊,谢谢
avatar
g*j
7
这里面真的好多被问到过

【在 z**********2 的大作中提到】
: Top 10 tech interview questions
: Reverse a singly lined list
: Print a binary search tree level by level
: Max sub sequence problem
: Find the nth smallest/largest number in a unsorted array
: Two sum, three sun problem
: Implement math pow function
: Implement merge sort for more than two arrays
: Find all the anagrams from a list of words
: BFS and its variants (such as determine whether a graph is bipartie)

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