Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit ac803e2

Browse files
committed
Update README.md
1 parent 1bf271c commit ac803e2

File tree

1 file changed

+11
-3
lines changed

1 file changed

+11
-3
lines changed

β€ŽREADME.md

Lines changed: 11 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -6,9 +6,9 @@
66

77
LeetCode is a website that has programming-related questions that are designed to be solved in a limited amount of time. This repository is a collection of some of my solutions written in [Rust](https://www.rust-lang.org/).
88

9-
## Solutions (124)
9+
## Solutions (132)
1010
| No. | Title | Solution | Problem | Difficulty |
11-
|:---:|:------|:--------:|:-------:|:----------:|
11+
|:---:|:------|:--------:|:-------:|:----------:|
1212
| 1 | Two Sum | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/two_sum.rs) | [Leetcode](https://leetcode.com/problems/two-sum/) | ![easy](https://shields.io/badge/-easy-green) |
1313
| 2 | Add Two Numbers | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/top_interview/linked_list/add_two_numbers.rs) | [Leetcode](https://leetcode.com/problems/add-two-numbers/) | ![medium](https://shields.io/badge/-medium-yellow) |
1414
| 3 | Longest Substring Without Repeating Characters | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/top_interview/array_and_string/length_of_longest_substring.rs) | [Leetcode](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | ![medium](https://shields.io/badge/-medium-yellow) |
@@ -65,8 +65,10 @@ LeetCode is a website that has programming-related questions that are designed t
6565
| 442 | Find All Duplicates in an Array | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/find_duplicates.rs) | [Leetcode](https://leetcode.com/problems/find-all-duplicates-in-an-array/) | ![medium](https://shields.io/badge/-medium-yellow) |
6666
| 452 | Minimum Number of Arrows to Burst Balloons | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/find_min_arrow_shots.rs) | [Leetcode](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/) | ![medium](https://shields.io/badge/-medium-yellow) |
6767
| 463 | Island Perimeter | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/island_perimeter.rs) | [Leetcode](https://leetcode.com/problems/island-perimeter/) | ![easy](https://shields.io/badge/-easy-green) |
68+
| 465 | Optimal Account Balancing | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/min_transfers.rs) | [Leetcode](https://leetcode.com/problems/optimal-account-balancing/) | ![hard](https://shields.io/badge/-hard-red) |
6869
| 485 | Max Consecutive Ones | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/find_max_consecutive_ones.rs) | [Leetcode](https://leetcode.com/problems/max-consecutive-ones/) | ![easy](https://shields.io/badge/-easy-green) |
6970
| 495 | Teemo Attacking | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/find_poisoned_duration.rs) | [Leetcode](https://leetcode.com/problems/teemo-attacking/) | ![easy](https://shields.io/badge/-easy-green) |
71+
| 496 | Next Greater Element I | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/next_greater_element.rs) | [Leetcode](https://leetcode.com/problems/next-greater-element-i/) | ![easy](https://shields.io/badge/-easy-green) |
7072
| 516 | Longest Palindromic Subsequence | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/longest_palindrome_subseq.rs) | [Leetcode](https://leetcode.com/problems/longest-palindromic-subsequence/) | ![medium](https://shields.io/badge/-medium-yellow) |
7173
| 543 | Diameter of Binary Tree | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/diameter_of_binary_tree.rs) | [Leetcode](https://leetcode.com/problems/diameter-of-binary-tree/) | ![easy](https://shields.io/badge/-easy-green) |
7274
| 547 | Number of Provinces | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/interview/amazon/find_circle_num.rs) | [Leetcode](https://leetcode.com/problems/number-of-provinces/) | ![medium](https://shields.io/badge/-medium-yellow) |
@@ -78,16 +80,20 @@ LeetCode is a website that has programming-related questions that are designed t
7880
| 725 | Split Linked List in Parts | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/split_list_to_parts.rs) | [Leetcode](https://leetcode.com/problems/split-linked-list-in-parts/) | ![medium](https://shields.io/badge/-medium-yellow) |
7981
| 741 | Cherry Pickup | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/cherry_pickup.rs) | [Leetcode](https://leetcode.com/problems/cherry-pickup/) | ![hard](https://shields.io/badge/-hard-red) |
8082
| 749 | Contain Virus | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/contain_virus.rs) | [Leetcode](https://leetcode.com/problems/contain-virus/) | ![hard](https://shields.io/badge/-hard-red) |
83+
| 764 | Largest Plus Sign | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/order_of_largest_plus_sign.rs) | [Leetcode](https://leetcode.com/problems/largest-plus-sign/) | ![medium](https://shields.io/badge/-medium-yellow) |
8184
| 774 | Minimize Max Distance to Gas Station | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/minmax_gas_dist.rs) | [Leetcode](https://leetcode.com/problems/minimize-max-distance-to-gas-station/) | ![medium](https://shields.io/badge/-medium-yellow) |
82-
| 841 | Keys and Rooms | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/keys-and-rooms.rs) | [Leetcode](https://leetcode.com/problems/keys-and-rooms/) | ![medium](https://shields.io/badge/-medium-yellow) |
85+
| 815 | Bus Routes | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/interview/uber/num_buses_to_destination.rs) | [Leetcode](https://leetcode.com/problems/bus-routes/) | ![hard](https://shields.io/badge/-hard-red) |
86+
| 841 | Keys and Rooms | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/can_visit_all_rooms.rs) | [Leetcode](https://leetcode.com/problems/keys-and-rooms/) | ![medium](https://shields.io/badge/-medium-yellow) |
8387
| 875 | Koko Eating Bananas | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/min_eating_speed.rs) | [Leetcode](https://leetcode.com/problems/koko-eating-bananas/) | ![medium](https://shields.io/badge/-medium-yellow) |
8488
| 901 | Online Stock Span | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/stock_span.rs) | [Leetcode](https://leetcode.com/problems/online-stock-span/) | ![medium](https://shields.io/badge/-medium-yellow) |
8589
| 922 | Sort Array By Parity II | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/sort_array_by_parity_ii.rs) | [Leetcode](https://leetcode.com/problems/sort-array-by-parity-ii/) | ![easy](https://shields.io/badge/-easy-green) |
8690
| 929 | Unique Email Addresses | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/num_unique_emails.rs) | [Leetcode](https://leetcode.com/problems/unique-email-addresses/) | ![easy](https://shields.io/badge/-easy-green) |
8791
| 930 | Binary Subarrays With Sum | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/num_subarrays_with_sum.rs) | [Leetcode](https://leetcode.com/problems/binary-subarrays-with-sum/) | ![medium](https://shields.io/badge/-medium-yellow) |
8892
| 937 | Reorder Data in Log Files | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/interview/amazon/reorder_log_files.rs) | [Leetcode](https://leetcode.com/problems/reorder-data-in-log-files/) | ![easy](https://shields.io/badge/-easy-green) |
8993
| 973 | K Closest Points to Origin | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/k_closest.rs) | [Leetcode](https://leetcode.com/problems/k-closest-points-to-origin/) | ![medium](https://shields.io/badge/-medium-yellow) |
94+
| 986 | Interval List Intersections | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/interval_intersection.rs) | [Leetcode](https://leetcode.com/problems/interval-list-intersections/) | ![medium](https://shields.io/badge/-medium-yellow) |
9095
| 991 | Broken Calculator | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/broken_calc.rs) | [Leetcode](https://leetcode.com/problems/broken-calculator/) | ![medium](https://shields.io/badge/-medium-yellow) |
96+
| 993 | Cousins in Binary Tree | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/is_cousins.rs) | [Leetcode](https://leetcode.com/problems/cousins-in-binary-tree/) | ![easy](https://shields.io/badge/-easy-green) |
9197
| 1008 | Construct Binary Search Tree from Preorder Traversal | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/bst_from_preorder.rs) | [Leetcode](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/) | ![medium](https://shields.io/badge/-medium-yellow) |
9298
| 1013 | Partition Array Into Three Parts With Equal Sum | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/can_three_parts_equal_sum.rs) | [Leetcode](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/) | ![easy](https://shields.io/badge/-easy-green) |
9399
| 1035 | Uncrossed Lines | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/max_uncrossed_lines.rs) | [Leetcode](https://leetcode.com/problems/uncrossed-lines/) | ![medium](https://shields.io/badge/-medium-yellow) |
@@ -108,12 +114,14 @@ LeetCode is a website that has programming-related questions that are designed t
108114
| 1315 | Sum of Nodes with Even-Valued Grandparent | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/interview/amazon/sum_even_grandparent.rs) | [Leetcode](https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent/) | ![medium](https://shields.io/badge/-medium-yellow) |
109115
| 1315 | Sum of Nodes with Even-Valued Grandparent | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/sum_even_grandparent.rs) | [Leetcode](https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent/) | ![medium](https://shields.io/badge/-medium-yellow) |
110116
| 1328 | Break a Palindrome | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/break_palindrome.rs) | [Leetcode](https://leetcode.com/problems/break-a-palindrome/) | ![medium](https://shields.io/badge/-medium-yellow) |
117+
| 1400 | Construct K Palindrome Strings | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/can_construct.rs) | [Leetcode](https://leetcode.com/problems/construct-k-palindrome-strings/) | ![medium](https://shields.io/badge/-medium-yellow) |
111118
| 1428 | Leftmost Column with at Least a One | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/left_most_column_with_one.rs) | [Leetcode](https://leetcode.com/problems/leftmost-column-with-at-least-a-one/) | ![medium](https://shields.io/badge/-medium-yellow) |
112119
| 1457 | Pseudo-Palindromic Paths in a Binary Tree | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/pseudo_palindromic_paths.rs) | [Leetcode](https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/) | ![easy](https://shields.io/badge/-easy-green) |
113120
| 1481 | Least Number of Unique Integers after K Removals | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/find_least_num_of_unique_ints.rs) | [Leetcode](https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/) | ![medium](https://shields.io/badge/-medium-yellow) |
114121
| 1570 | Dot Product of Two Sparse Vectors | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/dot_product.rs) | [Leetcode](https://leetcode.com/problems/dot-product-of-two-sparse-vectors/) | ![medium](https://shields.io/badge/-medium-yellow) |
115122
| 1604 | Alert Using Same Key-Card Three or More Times in a One Hour Period | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/interview/robinhood/alert_names.rs) | [Leetcode](https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/) | ![medium](https://shields.io/badge/-medium-yellow) |
116123
| 1710 | Maximum Units on a Truck | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/interview/amazon/maximum_units.rs) | [Leetcode](https://leetcode.com/problems/maximum-units-on-a-truck/) | ![easy](https://shields.io/badge/-easy-green) |
124+
| 1743 | Restore the Array From Adjacent Pairs | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/restore_array.rs) | [Leetcode](https://leetcode.com/problems/restore-the-array-from-adjacent-pairs/) | ![medium](https://shields.io/badge/-medium-yellow) |
117125
| 1801 | Number of Orders in the Backlog | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/get_number_of_backlog_orders.rs) | [Leetcode](https://leetcode.com/problems/number-of-orders-in-the-backlog/) | ![medium](https://shields.io/badge/-medium-yellow) |
118126
| 1861 | Rotating the Box | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/rotate_the_box.rs) | [Leetcode](https://leetcode.com/problems/rotating-the-box/) | ![medium](https://shields.io/badge/-medium-yellow) |
119127
| 1962 | Remove Stones to Minimize the Total | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/min_stone_sum.rs) | [Leetcode](https://leetcode.com/problems/remove-stones-to-minimize-the-total/) | ![medium](https://shields.io/badge/-medium-yellow) |

0 commit comments

Comments
(0)

AltStyle γ«γ‚ˆγ£γ¦ε€‰ζ›γ•γ‚ŒγŸγƒšγƒΌγ‚Έ (->γ‚ͺγƒͺγ‚ΈγƒŠγƒ«) /