docs: mark done problem last stone weight

Author: bujosa

src/readme.md

@@ -44,7 +44,7 @@
   - [x] [572. Subtree of another tree](../src/easy/subtree_of_another_tree.rs) -> [Problem Description](../src/easy/readme.md#572-subtree-of-another-tree)
   - [x] [703. Kth largest element in a stream](../src/easy/kth_largest_element_in_a_stream.rs) -> [Problem Description](../src/easy/readme.md#703-kth-largest-element-in-a-stream)
   - [x] [704. Binary search](../src/easy/binary_search.rs) -> [Problem Description](../src/easy/readme.md#704-binary-search)
-  - [ ] [1046. Last stone weight](../src/easy/last_stone_weight.rs) -> [Problem Description](../src/easy/readme.md#1046-last-stone-weight)
+  - [x] [1046. Last stone weight](../src/easy/last_stone_weight.rs) -> [Problem Description](../src/easy/readme.md#1046-last-stone-weight)
 - [Medium](../src/medium)
   - [x] [2. Add two numbers](../src/medium/add_two_numbers.rs) -> [Problem Description](../src/medium/readme.md#2-add-two-numbers)
   - [x] [3. Longest substring without repeating characters](../src/medium/longest_substring_without_repeating_characters.rs) -> [Problem Description](../src/medium/readme.md#3-longest-substring-without-repeating-characters)

theory/categories/6.heap_priority_queue/readme.md

@@ -64,14 +64,14 @@ A priority queue can be implemented using a heap.
 ## Problems
 
 - [x] [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/) | Easy | [Solution](../../../src/easy/kth_largest_element_in_a_stream.rs) | [Problem Description](../../../src/easy/readme.md#703-kth-largest-element-in-a-stream)
-- [ ] [Last Stone Weight](https://leetcode.com/problems/last-stone-weight/) | Easy | [Solution](../../../src/easy/last_stone_weight.rs) | [Problem Description](../../../src/easy/readme.md#1046-last-stone-weight)
+- [x] [Last Stone Weight](https://leetcode.com/problems/last-stone-weight/) | Easy | [Solution](../../../src/easy/last_stone_weight.rs) | [Problem Description](../../../src/easy/readme.md#1046-last-stone-weight)
 - [ ] [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/) | Medium | [Solution](../../../src/medium/k_closest_points_to_origin.rs) | [Problem Description](../../../src/medium/readme.md#973-k-closest-points-to-origin)
 - [ ] [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)
 - [ ] [Task Scheduler](https://leetcode.com/problems/task-scheduler/) | Medium | [Solution](../../../src/medium/task_scheduler.rs) | [Problem Description](../../../src/medium/readme.md#621-task-scheduler)
 - [ ] [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-02 22:10
+Last modified on: 2023-11-03 01:55
 Status: In Progress
 Author: [David Bujosa](https://github.com/bujosa)