S********e
发帖数: 28 | 1 攢人品及回報本版的幫助。
=== PS 1 ===
1. Similar to 'Combination Sum I/II' on Leetcode.
=== PS 2 ===
1. Similar to 'Design/Implement LRU Cache'. Key requirements: efficient look
-up while maintaining insertion order.
2. Figure out potential concurrent issues for a code segment. Key
observations: use 'wait/notify' instead of 'sleep' for coordination between
threads.
=== Onsite ===
1. Given a 2D array of integers, determine if it is possible to go from one
cell to another cell following non-descreasing path.
2. Partition integer array into 3 parts (<, =, >) in O(n) one pass in-place.
3. Lunch interview with hiring manager.
4. 2-Sum, 3-Sum
5. Implement 'put' and 'getMedian' APIs for processing data streams.
6. How to implement getGlobalUniqueId() API.
质略谌耍墒略谔欤〈蠹壹佑停 |
s********u
发帖数: 1109 | 2 'Design/Implement LRU Cache'这个题到处都在问啊，应该就是list+hashtable吧 |
S********e
发帖数: 28 | 3 應該行。如果用java，可以用LinkedHashmap，感覺當時考官一聽這個，就很順了。 |
s********u
发帖数: 1109 | 4 嗯 是的。但我感觉说linkedhashmap的话，像作弊一样，就完全没有自己设计的成分了
。。。当然这个东西其实就是hashmap+linkedlist
【在 S********e 的大作中提到】
: 應該行。如果用java，可以用LinkedHashmap，感覺當時考官一聽這個，就很順了。
|
k*********6
发帖数: 738 | 5 能冒昧问下楼主申的是哪个方向或组吗？如果不想再版上说能请发到站内信箱吗？ 多
谢。 |
s*****n
发帖数: 994 | 6 楼主怎么拿到interview机会的啊?T家都不理我
look
between
【在 S********e 的大作中提到】
: 攢人品及回報本版的幫助。
: === PS 1 ===
: 1. Similar to 'Combination Sum I/II' on Leetcode.
: === PS 2 ===
: 1. Similar to 'Design/Implement LRU Cache'. Key requirements: efficient look
: -up while maintaining insertion order.
: 2. Figure out potential concurrent issues for a code segment. Key
: observations: use 'wait/notify' instead of 'sleep' for coordination between
: threads.
: === Onsite ===
|
s*****n
发帖数: 994 | 7 楼主怎么拿到interview机会的啊?T家都不理我
look
between
【在 S********e 的大作中提到】
: 攢人品及回報本版的幫助。
: === PS 1 ===
: 1. Similar to 'Combination Sum I/II' on Leetcode.
: === PS 2 ===
: 1. Similar to 'Design/Implement LRU Cache'. Key requirements: efficient look
: -up while maintaining insertion order.
: 2. Figure out potential concurrent issues for a code segment. Key
: observations: use 'wait/notify' instead of 'sleep' for coordination between
: threads.
: === Onsite ===
|
w********s
发帖数: 214 | 8 那个LRU的hashmap+linkedlist方法有没有比较详细的说明呢？望大牛分享下，谢谢 |
n****e
发帖数: 678 | |
s********u
发帖数: 1109 | 10 看cc150的ood那一章，有一个题。
其实最简单的，你搜下 lru cache implementation不就完了。再搜索下linkedhashmap
。现在我感觉最有效率的学习来源，就是stackoverflow。
【在 w********s 的大作中提到】
: 那个LRU的hashmap+linkedlist方法有没有比较详细的说明呢？望大牛分享下，谢谢
|
|
|
l*n
发帖数: 529 | 11 SO上对问题的解释有竞争性，所以很容易找到把问题解释得很清楚的答案。这时候最大
的问题就是自己找对问题。:D
linkedhashmap
【在 s********u 的大作中提到】
: 看cc150的ood那一章，有一个题。
: 其实最简单的，你搜下 lru cache implementation不就完了。再搜索下linkedhashmap
: 。现在我感觉最有效率的学习来源，就是stackoverflow。
|
S********e
发帖数: 28 | |
g***9
发帖数: 159 | 13 6. How to implement getGlobalUniqueId() API.
这道题没能理解问的意思... 求解释, 谢谢! |
m*****y
发帖数: 120 | 14 1. Given a 2D array of integers, determine if it is possible to go from one
cell to another cell following non-descreasing path.
How to work on this one? Is it simply a BSF search with some restriction on
each step? |
s********u
发帖数: 1109 | 15 I think this should be Leetcode:unique path.
one
on
【在 m*****y 的大作中提到】
: 1. Given a 2D array of integers, determine if it is possible to go from one
: cell to another cell following non-descreasing path.
: How to work on this one? Is it simply a BSF search with some restriction on
: each step?
|
m*****y
发帖数: 120 | 16 But this only ask for exist a path or not, plus, it has restriction on where
it can move to. (the Backtracking Solution doesn't help too much, basically
it search from end to start instead, which is the same as search from start
to end)
cell to another cell following non-descreasing path.
【在 s********u 的大作中提到】
: I think this should be Leetcode:unique path.
:
: one
: on
|
l*n
发帖数: 529 | 17 这个跟迷宫没差别吧，bfs或者dfs搜就好了。
one
on
【在 m*****y 的大作中提到】
: 1. Given a 2D array of integers, determine if it is possible to go from one
: cell to another cell following non-descreasing path.
: How to work on this one? Is it simply a BSF search with some restriction on
: each step?
|
