Source: LRU Cache (LeetCode: 146) Design and implement …
InterviewBit – Distinct Numbers in Window
Source: Distinct Numbers in Window Problem Description …
InterviewBit – Merge K Sorted Lists
Source: Merge K Sorted Lists Merge k sorted linked list…
InterviewBit – Magician and Chocolates
Source: Magician and Chocolates Problem Description Giv…
InterviewBit – Ways to form Max Heap
Source: Ways to form Max Heap Problem Description Max H…
InterviewBit – N max pair combinations
Source: N max pair combinations Given two arrays A &…
Sorting Algorithm Notes – Heapsort
堆積排序是指利用堆積這種資料結構所設計的一種排序演算法。堆積是一個近似完全二元樹的結構,並同時滿足堆積的性質:…