amazon 疑点
摘要：
card.oop. ＃字大数据 bst, kth...... 阅读全文
posted @ 2014-08-11 12:07 brave_bo 阅读(138) 评论(0) 推荐(0)
amazon 面经 5
摘要：
http://www.geeksforgeeks.org/amazon-interview-set-105-campus/First PI:1. A brief discussion on my projects that I have done .2. One thing that I am mo... 阅读全文
posted @ 2014-08-10 14:51 brave_bo 阅读(391) 评论(0) 推荐(0)
amazon 面经4
摘要：
Round 1(Bar Raiser):Complete discussion on my project.Suppose you have a file with billion entries and you have to sort the data of a file according t... 阅读全文
posted @ 2014-08-10 07:55 brave_bo 阅读(176) 评论(0) 推荐(0)
amazon 面经3
摘要：
http://www.geeksforgeeks.org/amazon-interview-set-107/F2F-I:1) Brief discussion on work in current company2) Flatten linked list – http://www.geeksfor... 阅读全文
posted @ 2014-08-08 04:35 brave_bo 阅读(329) 评论(0) 推荐(0)
amazon 面经2
摘要：
http://www.geeksforgeeks.org/amazon-interview-set-108-campus/F2F-1:1) Given a sorted circular link list and a pointer to random node, now insert a new... 阅读全文
posted @ 2014-08-08 02:50 brave_bo 阅读(317) 评论(0) 推荐(0)
amazon 面经1
摘要：
1st round: 一个白人，先是聊了下project，然后一道coding题，找到距离一个节点k的所有节点。这个直接node bfs就可以解决。这一轮很基础。node bfs 加 count 计算level就行. facebook电面原题2nd round: 一个印度小伙，上来就是题，没有beh... 阅读全文
posted @ 2014-08-07 04:37 brave_bo 阅读(701) 评论(0) 推荐(0)
quicksort
摘要：
public void quicksort(int[] array, int low, int high){ int i = low; int j = high; if(i>j) return; int pivot = i... 阅读全文
posted @ 2014-08-04 07:05 brave_bo 阅读(148) 评论(0) 推荐(0)
amazon 设计 6 parking lot
摘要：
public abstract class Vehicle { protected ParkingSpace pSpace; public abstract boolean park(ParkingLot pLot); public boolean unpark(ParkingLot p... 阅读全文
posted @ 2014-08-04 05:21 brave_bo 阅读(1015) 评论(0) 推荐(0)
why using List list = new ArrayList() better than Arraylist list?
摘要：
This is called programming to interface. This will be helpful in case if you wish to move to some other implementation of List in the future. If you w... 阅读全文
posted @ 2014-08-04 04:19 brave_bo 阅读(210) 评论(0) 推荐(0)
amazon 汇总 算法
摘要：
7. write a function cn random an array.public class xiaodan_random { Random rand = new Random(); public void swap(int[] array, int i, int j){ ... 阅读全文
posted @ 2014-07-28 13:37 brave_bo 阅读(219) 评论(0) 推荐(0)
浙公网安备 33010602011771号