fb set
文章平均质量分 79
zhaobaoxue
这个作者很懒,什么都没留下…
展开
-
Finding all possible simple paths (paths without cycles) between two vertices in a graph
This problem is different from traditional BFS or DFS search, as the previously visited node can be visited again, as they are on different paths.M原创 2014-09-12 20:28:33 · 568 阅读 · 0 评论 -
Max Sum in circularly situated Values
Max Sum in circularly situated ValuesThis question was asked first in FACEBOOK On Campus for Internship.There are N trees in a circle. Each tree has a fruit value associated with it. A转载 2014-09-13 11:53:03 · 596 阅读 · 0 评论 -
Interview Set
1. You have an array of n elements, and a sum. Check if any 2 elements in the array sum to the given sum. ( Expected time complexity O(n). Use hashing)原创 2014-09-13 12:08:41 · 429 阅读 · 0 评论