Dec. 28, 2016
Introduction
Julia reviewed her blog:
http://juliachencoding.blogspot.ca/2016/10/fraudulent-activity-notification.html
Code Review
Read editorial notes,
Two solution, one is counting sort, using time complexity O(n) - n is with 200 constant factor; second one use priority heap - two heaps
This can be solved using two priority queues in O(nlogn).
Watch the video:
Data Structures: Solve 'Find the Running Median' Using Heaps
Data structures: Heaps
Julia, write down the code in the above lecture video, and then use it for my own copy of C# PriorityQueue class.
Find some code to study:
No comments:
Post a Comment