Merge k Sorted Lists (這題是用PQ,或者merge sort都可以做,關於第K大的問題,參考: Find Kth 題目類型總結)
Sort an Array (重點掌握merge sort和quick sort,因爲兩者可以演變爲,divide conquer, quick select, 參考: Find Kth 題目類型總結)
Sort Colors
Sort Colors II (rainbow sort)
Sort List
Merge Intervals (Interval 是一類很重要的題目,往往跟Sweep line相結合, 參考: 掃描線Sweep Line算法總結)
Convert Sorted Array to Binary Search Tree
Convert Sorted List to Binary Search Tree
Search in Rotated Sorted Array
關於search,這裏有Binary Search的總結