[Java] Leetcode 295. Find Median from Data Stream [Two Heaps #1]

[@csquaredgaming]

I enjoyed this. My only comment would be I had to slow video down to 0.75x so my brain could process what you were saying properly. Possible suggestion would be to speak slightly slower and maybe I can catch what you are saying the first time around, instead of me having to play the parts I missed back several times. Still really good explanations though, I understand this concept now, ty.

[@robertbaindourov134]

great job Eric!

[@sunisshining1]

public double findMedian() { if(size%2!=0) return maxheap.size() > minheap.size() ? (double) maxheap.peek() : (double) minheap.peek(); return (maxheap.peek()+ minheap.peek()) / 2.0; }

[@nuha0232]

you are the best

[@raj_kundalia]

thank you!

[@SHSelect]

looks promising, well explained, thanks Eric

[@jerrywong5140]

Short and concise, love it!

[@ainazikmomunalieva3732]

Super explanation!

[@EricProgramming]

Glad it was helpful!

[@SandeepKumar-du3tg]

Amazing explaination!!