Design a Data Structure - Find Median from Data Stream
Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.
For example,
[2,3,4], the median is 3
[2,3], the median is (2 + 3) / 2 = 2.5
Design a data structure that supports the following two operations:
void addNum(int num) - Add an integer number from the data stream to the data structure.
double findMedian() - Return the median of all elements so far.
🔥 DONT CLICK THIS: https://bit.ly/2BEDWYG
🎬 Design a Data Structure Playlist : https://www.youtube.com/playlist?list=PLAC2AM9O1C5Kt0Yeyee_ZBMhvkc0XDYUo
🔗 Share with your network : https://youtu.be/du2nw3jox00
💡 Source code: https://github.com/naval41/DesignDataStructure/blob/master/Median.java
👍 Let's Connect on Facebook : https://bit.ly/31KPcgI
📲 Connect on Telegram : https://t.me/joinchat/Kc_ZkBsijqXJDWrtnEv5LQ
#findmedian #heap #datastructuredesign #programming #algorithms #coding
