|
31 | 31 | - [x] [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) - [Solution](src/minimum_window_substring.rs)
|
32 | 32 | - [x] [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) - [Solution](src/sliding_window_maximum.rs)
|
33 | 33 |
|
34 |
| -### Stack |
| 34 | +### Stack ✓ |
35 | 35 |
|
36 | 36 | - [x] [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) - [Solution](src/valid_parentheses.rs)
|
37 | 37 | - [x] [Min Stack](https://leetcode.com/problems/min-stack/) - [Solution](src/min_stack.rs)
|
38 | 38 | - [x] [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/) - [Solution](src/evaluate_reverse_polish_notation.rs)
|
39 | 39 | - [x] [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) - [Solution](src/generate_parentheses.rs)
|
40 | 40 | - [x] [Daily Temperatures](https://leetcode.com/problems/daily-temperatures/) - [Solution](src/daily_temperatures.rs)
|
41 | 41 | - [x] [Car Fleet](https://leetcode.com/problems/car-fleet/) - [Solution](src/car_fleet.rs)
|
42 |
| -- [ ] [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/) |
| 42 | +- [x] [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/) - [Solution](src/largest_rectangle_in_histogram.rs) |
43 | 43 |
|
44 |
| -### Binary Search |
| 44 | +### Binary Search ✓ |
45 | 45 |
|
46 | 46 | - [x] [Binary Search](https://leetcode.com/problems/binary-search/) - [Solution](src/binary_search.rs)
|
47 | 47 | - [x] [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/) - [Solution](src/search_a_2d_matrix.rs)
|
48 | 48 | - [x] [Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas/) - [Solution](src/koko_eating_bananas.rs)
|
49 | 49 | - [x] [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) - [Solution](src/find_minimum_in_rotated_sorted_array.rs)
|
50 | 50 | - [x] [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) - [Solution](src/search_in_rotated_sorted_array.rs)
|
51 | 51 | - [x] [Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store/) - [Solution](src/time_based_key_value_store.rs)
|
52 |
| -- [ ] [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) |
| 52 | +- [x] [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) - [Solution](src/median_of_two_sorted_arrays.rs) |
53 | 53 |
|
54 | 54 | ### Linked List
|
55 | 55 |
|
56 | 56 | - [x] [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) - [Solution](src/reverse_linked_list.rs)
|
57 | 57 | - [x] [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) - [Solution](src/merge_two_sorted_lists.rs)
|
58 |
| -- [ ] [Reorder List](https://leetcode.com/problems/reorder-list/) |
| 58 | +- [x] [Reorder List](https://leetcode.com/problems/reorder-list/) - [Solution](src/reorder_list.rs) |
59 | 59 | - [x] [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) - [Solution](src/remove_nth_node_from_end_of_list.rs)
|
60 |
| -- [ ] [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/) |
| 60 | +- [ ] [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/) - *Unavailable in Rust* |
61 | 61 | - [x] [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) - [Solution](src/add_two_numbers.rs)
|
62 |
| -- [ ] [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) |
| 62 | +- [ ] [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) - *Unavailable in Rust* |
63 | 63 | - [x] [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) - [Solution](src/find_the_duplicate_number.rs)
|
64 | 64 | - [x] [LRU Cache](https://leetcode.com/problems/lru-cache/) - [Solution](src/lru_cache.rs)
|
65 | 65 | - [x] [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) - [Solution](src/merge_k_sorted_lists.rs)
|
66 |
| -- [ ] [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) |
| 66 | +- [x] [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) - [Solution](src/reverse_nodes_in_k_groups.rs) |
67 | 67 |
|
68 |
| -### Trees |
| 68 | +### Trees ✓ |
69 | 69 |
|
70 | 70 | - [x] [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) - [Solution](src/invert_binary_tree.rs)
|
71 | 71 | - [x] [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) - [Solution](src/maximum_depth_of_binary_tree.rs)
|
72 | 72 | - [x] [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/) - [Solution](src/diameter_of_binary_tree.rs)
|
73 | 73 | - [x] [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) - [Solution](src/balanced_binary_tree.rs)
|
74 | 74 | - [x] [Same Tree](https://leetcode.com/problems/same-tree/) - [Solution](src/same_tree.rs)
|
75 |
| -- [ ] [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/) |
| 75 | +- [x] [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/) - [Solution](src/subtree_of_another_tree.rs) |
76 | 76 | - [x] [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) - [Solution](src/lowest_common_ancestor_of_a_binary_search_tree.rs)
|
77 | 77 | - [x] [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) - [Solution](src/binary_tree_level_order_traversal.rs)
|
78 | 78 | - [x] [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) - [Solution](src/binary_tree_right_side_view.rs)
|
79 | 79 | - [x] [Count Good Nodes in Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree/) - [Solution](src/count_good_nodes_in_binary_tree.rs)
|
80 | 80 | - [x] [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) - [Solution](src/validate_binary_search_tree.rs)
|
81 | 81 | - [x] [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) - [Solutoin](src/kth_smallest_element_in_a_bst.rs)
|
82 | 82 | - [x] [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) - [Solution](src/construct_binary_tree_from_preorder_and_inorder_traversal.rs)
|
83 |
| -- [ ] [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) |
| 83 | +- [x] [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) - [Solution](src/binary_tree_maximum_path_sum.rs) |
84 | 84 | - [x] [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) - [Solution](src/serialize_and_deserialize_binary_tree.rs)
|
85 | 85 |
|
86 | 86 | ### Tries
|
|
95 | 95 | - [x] [Last Stone Weight](https://leetcode.com/problems/last-stone-weight/) - [Solution](src/last_stone_weight.rs)
|
96 | 96 | - [x] [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/) - [Solution](src/k_closest_points_to_origin.rs)
|
97 | 97 | - [x] [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) - [Solution](src/kth_largest_element_in_an_array.rs)
|
98 |
| -- [ ] [Task Scheduler](https://leetcode.com/problems/task-scheduler/) |
| 98 | +- [x] [Task Scheduler](https://leetcode.com/problems/task-scheduler/) - [Solution](src/task_scheduler.rs) |
99 | 99 | - [ ] [Design Twitter](https://leetcode.com/problems/design-twitter/)
|
100 | 100 | - [x] [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) - [Solution](src/find_median_from_data_stream.rs)
|
101 | 101 |
|
|
146 | 146 | - [x] [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/) - [Solution](src/palindromic_substrings.rs)
|
147 | 147 | - [ ] [Decode Ways](https://leetcode.com/problems/decode-ways/)
|
148 | 148 | - [x] [Coin Change](https://leetcode.com/problems/coin-change/) - [Solution](src/coin_change.rs)
|
149 |
| -- [ ] [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) |
| 149 | +- [x] [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) - [Solution](src/maximum_product_subarray.rs) |
150 | 150 | - [ ] [Word Break](https://leetcode.com/problems/word-break/)
|
151 | 151 | - [x] [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) - [Solution](src/longest_increasing_subsequence.rs)
|
152 | 152 | - [x] [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/) - [Solution](src/partition_equal_subset_sum.rs)
|
|
207 | 207 |
|
208 | 208 | ## [Blind 75](https://www.teamblind.com/post/New-Year-Gift---Curated-List-of-Top-100-LeetCode-Questions-to-Save-Your-Time-OaM1orEU) Progress
|
209 | 209 |
|
210 |
| -### Array |
| 210 | +### Array ✓ |
211 | 211 |
|
212 | 212 | - [x] [Two Sum](https://leetcode.com/problems/two-sum/) - [Solution](src/two_sum.rs)
|
213 | 213 | - [x] [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) - [Solution](src/best_time_to_buy_and_sell_stock.rs)
|
214 | 214 | - [x] [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) - [Solution](src/contains_duplicate.rs)
|
215 | 215 | - [x] [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) - [Solution](src/product_of_array_except_self.rs)
|
216 | 216 | - [x] [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) - [Solution](src/maximum_subarray.rs)
|
217 |
| -- [ ] [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) |
| 217 | +- [x] [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) - [Solution](src/maximum_product_subarray.rs) |
218 | 218 | - [x] [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) - [Solution](src/find_minimum_in_rotated_sorted_array.rs)
|
219 | 219 | - [x] [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) - [Solution](src/search_in_rotated_sorted_array.rs)
|
220 | 220 | - [x] [3 Sum](https://leetcode.com/problems/3sum/) - [Solution](src/three_sum.rs)
|
|
0 commit comments