location in beijing,there about 100+ people are waiting in a room. three or four round of interveiw. first round, ask unionSet problem.than ask time space complexity,and could be more effcience? sec round,1) heapSort; third round,given a list like a->b->d->e->f->g,turn it around like d->b->a->g->f->e