You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+6-1Lines changed: 6 additions & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -6,7 +6,7 @@
6
6
7
7
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/).
8
8
9
-
## Solutions (71)
9
+
## Solutions (76)
10
10
| No. | Title | Solution | Problem | Difficulty |
11
11
|:---:|:------|:--------:|:-------:|:----------:|
12
12
| 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 |
@@ -33,6 +33,7 @@ LeetCode is a website that has programming-related questions that are designed t
33
33
| 169 | Majority Element |[Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/top_interview/others/majority_element.rs)|[Leetcode](https://leetcode.com/problems/majority-element/solution/)| Easy |
34
34
| 174 | Dungeon Game |[Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/calculate_minimum_hp.rs)|[Leetcode](https://leetcode.com/problems/dungeon-game/)| Hard |
35
35
| 200 | Number of Islands |[Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/num_islands.rs)|[Leetcode](https://leetcode.com/problems/number-of-islands/)| Medium |
36
+
| 208 | Implement Trie (Prefix Tree) |[Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/implement_trie_prefix_tree.rs)|[Leetcode](https://leetcode.com/problems/implement-trie-prefix-tree/)| Medium |
36
37
| 230 | Kth Smallest Element in a BST |[Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/kth_smallest.rs)|[Leetcode](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)| Medium |
| 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 |
62
+
| 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 |
61
63
| 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 |
64
+
| 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 |
62
65
| 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 |
66
+
| 1041 | Robot Bounded In Circle |[Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/interview/amazon/is_robot_bounded.rs)|[Leetcode](https://leetcode.com/problems/robot-bounded-in-circle/submissions/)| Medium |
63
67
| 1134 | Armstrong Number |[Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/is_good_array.rs)|[Leetcode](https://leetcode.com/problems/armstrong-number/)| Easy |
64
68
| 1137 | N-th Tribonacci Number |[Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/tribonacci.rs)|[Leetcode](https://leetcode.com/problems/n-th-tribonacci-number/)| Easy |
65
69
| 1143 | Longest Common Subsequence |[Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/longest_common_subsequence.rs)|[Leetcode](https://leetcode.com/problems/longest-common-subsequence/)| Medium |
@@ -72,6 +76,7 @@ LeetCode is a website that has programming-related questions that are designed t
72
76
| 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 |
73
77
| 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 |
74
78
| 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 |
79
+
| 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 |
75
80
| 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 |
76
81
| 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 |
0 commit comments