LeetCode Solutions in Rust

Note: Some solutions have multiple approaches implemented

LeetCode Algorithm

#	Problem	Solution	Difficulty
1	Two Sum	Solution	Easy
2	Add Two Numbers	Solution	Medium
3	Longest Substring Without Repeating Characters	Solution	Medium
4	Median of Two Sorted Arrays	Solution	Hard
5	Longest Palindromic Substring	Solution	Medium
6	ZigZag Conversion	Solution	Easy
7	Reverse Integer	Solution	Easy
8	String to Integer (atoi)	Solution	Easy
9	Palindrome Number	Solution	Easy
10	Regular Expression Matching	Solution	Hard
11	Container With Most Water	Solution	Medium
12	Integer to Roman	Solution	Medium
13	Roman to Integer	Solution	Easy
14	Longest Common Prefix	Solution	Easy
15	3Sum	Solution	Medium
16	3Sum Closest	Solution	Medium
17	Letter Combinations of a Phone Number	Solution	Medium
18	4Sum	Solution	Medium
19	Remove Nth Node From End of List	Solution	Easy
20	Valid Parentheses	Solution	Easy
21	Merge Two Sorted Lists	Solution	Easy
22	Generate Parentheses	Solution	Medium
23	Merge k Sorted Lists	Solution	Hard
24	Swap Nodes in Pairs	Solution	Medium
25	Reverse Nodes in k-Group	Solution	Hard
26	Remove Duplicates from Sorted Array	Solution	Easy
27	Remove Element	Solution	Easy
28	Implement strStr()	Solution	Easy
29	Divide Two Integers	Solution	Medium
30	Substring with Concatenation of All Words	Solution	Hard
31	Next Permutation	Solution	Medium
32	Longest Valid Parentheses	Solution	Hard
33	Search in Rotated Sorted Array	Solution	Hard
34	Find First and Last Position of Element in Sorted Array	Solution	Medium
35	Search Insert Position	Solution	Medium
36	Valid Sudoku	Solution	Easy
37	Sudoku Solver	Solution	Hard
38	Count and Say	Solution	Easy
39	Combination Sum	Solution	Medium
40	Combination Sum II	Solution	Medium
41	First Missing Positive	Solution	Hard
42	Trapping Rain Water	Solution	Hard
43	Multiply Strings	Solution	Medium
44	Wildcard Matching	Solution	Hard
45	Jump Game II	Solution	Hard
46	Permutations	Solution	Medium
47	Permutations II	Solution	Hard
48	Rotate Image	Solution	Medium
49	Group Anagrams	Solution	Medium
50	"Pow(x, n)"	Solution	Medium
51	N-Queens	Solution	Hard
52	N-Queens II	Solution	Hard
53	Maximum Subarray	Solution	Medium
54	Spiral Matrix	Solution	Medium
55	Jump Game	Solution	Medium
56	Merge Intervals	Solution	Hard
57	Insert Interval	Solution	Hard
58	Length of Last Word	Solution	Easy
59	Spiral Matrix II	Solution	Medium
60	Permutation Sequence	Solution	Medium
61	Rotate List	Solution	Medium
62	Unique Paths	Solution	Medium
63	Unique Paths II	Solution	Medium
64	Minimum Path Sum	Solution	Medium
65	Valid Number	Solution	Easy
66	Plus One	Solution	Easy
67	Add Binary	Solution	Easy
68	Text Justification	Solution	Hard
69	Sqrt(x)	Solution	Medium
70	Climbing Stairs	Solution	Easy
71	Simplify Path	Solution	Medium
72	Edit Distance	Solution	Hard
73	Set Matrix Zeroes	Solution	Medium
74	Search a 2D Matrix	Solution	Medium
75	Sort Colors	Solution	Medium
76	Minimum Window Substring	Solution	Hard
77	Combinations	Solution	Medium
78	Subsets	Solution	Medium
79	Word Search	Solution	Medium
80	Remove Duplicates from Sorted Array II	Solution	Medium
81	Search in Rotated Sorted Array II	Solution	Medium
82	Remove Duplicates from Sorted List II	Solution	Medium
83	Remove Duplicates from Sorted List	Solution	Easy
84	Largest Rectangle in Histogram	Solution	Hard
85	Maximal Rectangle	Solution	Hard
86	Partition List	Solution	Medium
87	Scramble String	Solution	Hard
88	Merge Sorted Array	Solution	Easy
89	Gray Code	Solution	Medium
90	Subsets II	Solution	Medium
91	Decode Ways	Solution	Medium
92	Reverse Linked List II	Solution	Medium
93	Restore IP Addresses	Solution	Medium
94	Binary Tree Inorder Traversal	Solution	Medium
95	Unique Binary Search Trees II	Solution	Medium
96	Unique Binary Search Trees	Solution	Medium
97	Interleaving String	Solution	Hard
98	Validate Binary Search Tree	Solution	Medium
99	Recover Binary Search Tree	Solution	Hard
100	Same Tree	Solution	Easy
101	Symmetric Tree	Solution	Easy
102	Binary Tree Level Order Traversal	Solution	Medium
103	Binary Tree Zigzag Level Order Traversal	Solution	Medium
104	Maximum Depth of Binary Tree	Solution	Easy
105	Construct Binary Tree from Preorder and Inorder Traversal	Solution	Medium
106	Construct Binary Tree from Inorder and Postorder Traversal	Solution	Medium
107	Binary Tree Level Order Traversal II	Solution	Medium
108	Convert Sorted Array to Binary Search Tree	Solution	Easy
109	Convert Sorted List to Binary Search Tree	Solution	Medium
110	Balanced Binary Tree	Solution	Easy
111	Minimum Depth of Binary Tree	Solution	Easy
112	Path Sum	Solution	Easy
113	Path Sum II	Solution	Medium
114	Flatten Binary Tree to Linked List	Solution	Medium
115	Distinct Subsequences	Solution	Hard
*116	Populating Next Right Pointers in Each Node	Solution	Medium
*117	Populating Next Right Pointers in Each Node II	Solution	Medium
118	Pascal's Triangle	Solution	Easy
119	Pascal's Triangle II	Solution	Easy
>120	Triangle	Solution	Medium
121	Best Time to Buy and Sell Stock	Solution	Easy
122	Best Time to Buy and Sell Stock II	Solution	Medium
123	Best Time to Buy and Sell Stock III	Solution	Hard
124	Binary Tree Maximum Path Sum	Solution	Hard
125	Valid Palindrome	Solution	Easy
126	Word Ladder II	Solution	Hard
127	Word Ladder	Solution	Hard
128	Longest Consecutive Sequence	Solution	Medium
129	Sum Root to Leaf Numbers	Solution	Medium
130	Surrounded Regions	Solution	Medium
131	Palindrome Partitioning	Solution	Medium
132	Palindrome Partitioning II	Solution	Hard
133	Clone Graph	Solution	Medium
134	Gas Station	Solution	Medium
135	Candy	Solution	Hard
136	Single Number	Solution	Easy
137	Single Number II	Solution	Medium
138	Copy List with Random Pointer	Solution	Medium
139	Word Break	Solution	Medium
140	Word Break II	Solution	Hard

* - rust solution isn't available