IT討論區(117) 準備好宣誓未呀

有冇出黎做野既師兄仲記得/學過interval tree前兩日做個coding interview test有題卡關過唔到100% test case。類似話比個list of start time & end time pair你叫你寫個function detect成個list 有冇intersection。太耐冇撚做唔記得左結果就係衰撚左呢題

屌最慘係一submit完就記返起我呢D題目一見到唔識就一黎sort鳩左佢先再慢慢諗

其實又唔一定係為做題目,實際項目(scheduler/ time management)之類既應用都會用到不過Algo題型真係好撚多唔操開/出黎做野耐左真係好難KEEP住所有TOPIC都記得

我琴日又係有題一交完就醒起用錯data structure

近排工作有用到類似
Merge Overlapping Intervals

其實都係sort 完再iterate

你用cache就係想減少server loading，咁梗係無cache到先call server

你呢題唔駛用tree啦
Sort by start time and end time 然後loop compare previous end 同current start

近排工作上真係有用到
Merge Overlapping Intervals

very large data set 過唔到

BTW我都係第一時間sort by start time之後 by end time。用cur 對比prev。過到一D TEST CASE但好多唔得懷疑compare time個condintion出錯但冇backup

做野會慢慢諗test case一個個log出黎驗證,interview 得咁多時間成撚日卡左係edge case到拿唔到100%

如果sort過唔到咁tree都過唔到啦，兩者都係nlog(n)

都係操多d，無咩計

Sorted -> [][][][[]][[[]]]
Quite trivial