docs: mark done problem 295

Author: bujosa

src/hard/readme.md

@@ -418,3 +418,15 @@ medianFinder.findMedian(); // return 1.5 (i.e., (1 + 2) / 2)
 medianFinder.addNum(3);    // arr[1, 2, 3]
 medianFinder.findMedian(); // return 2.0
 ```
+
+## How to Run in main.rs
+
+Put the code below in main.rs and run `cargo run`
+
+```rust
+    let mut median_finder = leetcode::hard::find_median_from_data_stream::MedianFinder::new();
+    median_finder.add_num(1);
+    median_finder.add_num(2);
+    let result = median_finder.find_median();
+    println!("result: {:?}", result);
+```

src/readme.md

@@ -103,4 +103,4 @@
   - [x] [84. Largest rectangle in histogram](../src/hard/largest_rectangle_in_histogram.rs) -> [Problem Description](../src/hard/readme.md#84-largest-rectangle-in-histogram)
   - [x] [212. Word search II](../src/hard/word_search_ii.rs) -> [Problem Description](../src/hard/readme.md#212-word-search-ii)
   - [x] [239. Sliding window maximum](../src/hard/sliding_window_maximum.rs) -> [Problem Description](../src/hard/readme.md#239-sliding-window-maximum)
-  - [ ] [295. Find median from data stream](../src/hard/find_median_from_data_stream.rs) -> [Problem Description](../src/hard/readme.md#295-find-median-from-data-stream)
+  - [x] [295. Find median from data stream](../src/hard/find_median_from_data_stream.rs) -> [Problem Description](../src/hard/readme.md#295-find-median-from-data-stream)

theory/categories/6.heap_priority_queue/readme.md

@@ -69,10 +69,10 @@ A priority queue can be implemented using a heap.
 - [x] [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | Medium | [Solution](../../../src/medium/kth_largest_element_in_an_array.rs) | [Problem Description](../../../src/medium/readme.md#215-kth-largest-element-in-an-array)
 - [x] [Task Scheduler](https://leetcode.com/problems/task-scheduler/) | Medium | [Solution](../../../src/medium/task_scheduler.rs) | [Problem Description](../../../src/medium/readme.md#621-task-scheduler)
 - [x] [Design Twitter](https://leetcode.com/problems/design-twitter/) | Medium | [Solution](../../../src/medium/design_twitter.rs) | [Problem Description](../../../src/medium/readme.md#355-design-twitter)
-- [ ] [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) | Hard | [Solution](../../../src/hard/find_median_from_data_stream.rs) | [Problem Description](../../../src/hard/readme.md#295-find-median-from-data-stream)
+- [x] [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) | Hard | [Solution](../../../src/hard/find_median_from_data_stream.rs) | [Problem Description](../../../src/hard/readme.md#295-find-median-from-data-stream)
 
 Category: `Heap / Priority Queue`
 Created on: 2023-11-02 21:12
-Last modified on: 2023-11-04 00:06
-Status: In Progress
+Last modified on: 2023-11-04 00:45
+Status: Done
 Author: [David Bujosa](https://github.com/bujosa)