Meta interview question

K-th largest in a tree Implement regexp Bindary search Web perf case study