add problem and discuss link to existing solutions

src/solution/s0001_two_sum.rs

@@ -18,6 +18,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/two-sum/
+// discuss: https://leetcode.com/problems/two-sum/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 use std::collections::HashMap;

src/solution/s0002_add_two_numbers.rs

@@ -19,6 +19,9 @@
 pub struct Solution {}
 use crate::util::linked_list::{to_list, ListNode};
 
+// problem: https://leetcode.com/problems/add-two-numbers/
+// discuss: https://leetcode.com/problems/add-two-numbers/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 impl Solution {

src/solution/s0003_longest_substring.rs → src/solution/s0003_longest_substring_without_repeating_characters.rs

@@ -12,6 +12,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/longest-substring-without-repeating-characters/
+// discuss: https://leetcode.com/problems/longest-substring-without-repeating-characters/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 impl Solution {

src/solution/s0004_median_of_two_sorted_arrays.rs

@@ -28,6 +28,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/median-of-two-sorted-arrays/
+// discuss: https://leetcode.com/problems/median-of-two-sorted-arrays/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 // TODO: nth slice

src/solution/s0005_longest_palindromic_substring.rs

@@ -21,6 +21,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/longest-palindromic-substring/
+// discuss: https://leetcode.com/problems/longest-palindromic-substring/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 impl Solution {

src/solution/s0006_zigzag_conversion.rs

@@ -38,6 +38,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/zigzag-conversion/
+// discuss: https://leetcode.com/problems/zigzag-conversion/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 impl Solution {

src/solution/s0007_reverse_integer.rs

@@ -30,6 +30,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/reverse-integer/
+// discuss: https://leetcode.com/problems/reverse-integer/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 impl Solution {
     pub fn reverse(x: i32) -> i32 {

src/solution/s0008_string_to_integer_atoi.rs

@@ -61,6 +61,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/string-to-integer-atoi/
+// discuss: https://leetcode.com/problems/string-to-integer-atoi/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 impl Solution {

src/solution/s0009_palindrome_number.rs

@@ -33,6 +33,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/palindrome-number/
+// discuss: https://leetcode.com/problems/palindrome-number/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 // TODO: not optimal, we only have to revert half of the string

src/solution/s0010_regular_expression_matching.rs

@@ -69,6 +69,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/regular-expression-matching/
+// discuss: https://leetcode.com/problems/regular-expression-matching/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 // TODO: NFA

src/solution/s0011_container_with_most_water.rs

@@ -22,6 +22,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/container-with-most-water/
+// discuss: https://leetcode.com/problems/container-with-most-water/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 // Brute force: O(N^2)

src/solution/s0012_integer_to_roman.rs

@@ -61,6 +61,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/integer-to-roman/
+// discuss: https://leetcode.com/problems/integer-to-roman/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 impl Solution {

src/solution/s0013_roman_to_integer.rs

@@ -61,6 +61,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/roman-to-integer/
+// discuss: https://leetcode.com/problems/roman-to-integer/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 impl Solution {

src/solution/s0014_longest_common_prefix.rs

@@ -27,6 +27,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/longest-common-prefix/
+// discuss: https://leetcode.com/problems/longest-common-prefix/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 use std::str::Chars;

src/solution/s0015_3sum.rs

@@ -22,6 +22,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/3sum/
+// discuss: https://leetcode.com/problems/3sum/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 impl Solution {

src/solution/s0016_3sum_closest.rs

@@ -14,6 +14,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/3sum-closest/
+// discuss: https://leetcode.com/problems/3sum-closest/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 impl Solution {

src/solution/s0017_letter_combinations_of_a_phone_number.rs

@@ -21,6 +21,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/letter-combinations-of-a-phone-number/
+// discuss: https://leetcode.com/problems/letter-combinations-of-a-phone-number/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 impl Solution {

src/solution/s0018_4sum.rs

@@ -23,6 +23,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/4sum/
+// discuss: https://leetcode.com/problems/4sum/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 // TODO: change to faster N^3 solution... maybe

src/solution/s0019_remove_nth_node_from_end_of_list.rs

@@ -23,6 +23,9 @@
 pub struct Solution {}
 use crate::util::linked_list::{to_list, ListNode};
 
+// problem: https://leetcode.com/problems/remove-nth-node-from-end-of-list/
+// discuss: https://leetcode.com/problems/remove-nth-node-from-end-of-list/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 // one pass (two pointer runner pattern) cannot make borrow checker happy

src/solution/s0020_valid_parentheses.rs

@@ -50,6 +50,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/valid-parentheses/
+// discuss: https://leetcode.com/problems/valid-parentheses/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 impl Solution {

src/solution/s0021_merge_two_sorted_lists.rs

@@ -13,6 +13,9 @@
 pub struct Solution {}
 use crate::util::linked_list::{to_list, ListNode};
 
+// problem: https://leetcode.com/problems/merge-two-sorted-lists/
+// discuss: https://leetcode.com/problems/merge-two-sorted-lists/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 // recursive will be much easier to understand

src/solution/s0022_generate_parentheses.rs

@@ -20,6 +20,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/generate-parentheses/
+// discuss: https://leetcode.com/problems/generate-parentheses/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 // DFS

src/solution/s0023_merge_k_sorted_lists.rs

@@ -19,6 +19,9 @@
 pub struct Solution {}
 use crate::util::linked_list::{to_list, ListNode};
 
+// problem: https://leetcode.com/problems/merge-k-sorted-lists/
+// discuss: https://leetcode.com/problems/merge-k-sorted-lists/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 use std::cmp::Ordering;
 use std::collections::BinaryHeap;

src/solution/s0024_swap_nodes_in_pairs.rs

@@ -19,6 +19,9 @@
 pub struct Solution {}
 use crate::util::linked_list::{to_list, ListNode};
 
+// problem: https://leetcode.com/problems/swap-nodes-in-pairs/
+// discuss: https://leetcode.com/problems/swap-nodes-in-pairs/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 impl Solution {

src/solution/s0025_reverse_nodes_in_k_group.rs

@@ -27,6 +27,9 @@
 pub struct Solution {}
 use crate::util::linked_list::{to_list, ListNode};
 
+// problem: https://leetcode.com/problems/reverse-nodes-in-k-group/
+// discuss: https://leetcode.com/problems/reverse-nodes-in-k-group/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 impl Solution {

src/solution/s0026_remove_duplicates_from_sorted_array.rs

@@ -45,6 +45,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/remove-duplicates-from-sorted-array/
+// discuss: https://leetcode.com/problems/remove-duplicates-from-sorted-array/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 impl Solution {

src/solution/s0027_remove_element.rs

@@ -49,6 +49,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/remove-element/
+// discuss: https://leetcode.com/problems/remove-element/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 impl Solution {

src/solution/s0028_implement_strstr.rs

@@ -28,6 +28,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/implement-strstr/
+// discuss: https://leetcode.com/problems/implement-strstr/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 impl Solution {

src/solution/s0029_divide_two_integers.rs

@@ -30,6 +30,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/divide-two-integers/
+// discuss: https://leetcode.com/problems/divide-two-integers/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 impl Solution {

src/solution/s0030_substring_with_concatenation_of_all_words.rs

@@ -26,6 +26,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/substring-with-concatenation-of-all-words/
+// discuss: https://leetcode.com/problems/substring-with-concatenation-of-all-words/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 struct Term {
     expect: i32,

src/solution/s0031_next_permutation.rs

@@ -16,6 +16,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/next-permutation/
+// discuss: https://leetcode.com/problems/next-permutation/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 impl Solution {

src/solution/s0032_longest_valid_parentheses.rs

@@ -22,6 +22,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/longest-valid-parentheses/
+// discuss: https://leetcode.com/problems/longest-valid-parentheses/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 // time: O(N) space: O(1)

src/solution/s0033_search_in_rotated_sorted_array.rs

@@ -37,6 +37,9 @@ pub struct Solution {}
 Consider the given array as ring, each time we split the ring and judge which part is the target belong to, then it's ordinary binary search.
 */
 
+// problem: https://leetcode.com/problems/search-in-rotated-sorted-array/
+// discuss: https://leetcode.com/problems/search-in-rotated-sorted-array/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 impl Solution {

src/solution/s0034_find_first_and_last_position_of_element_in_sorted_array.rs

@@ -22,6 +22,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/
+// discuss: https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 // TODO

src/solution/s0035_search_insert_position.rs

@@ -36,6 +36,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/search-insert-position/
+// discuss: https://leetcode.com/problems/search-insert-position/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 // TODO

src/solution/s0036_valid_sudoku.rs

@@ -64,6 +64,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/valid-sudoku/
+// discuss: https://leetcode.com/problems/valid-sudoku/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 // just brute force

src/solution/s0037_sudoku_solver.rs

@@ -30,6 +30,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/sudoku-solver/
+// discuss: https://leetcode.com/problems/sudoku-solver/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 // TODO

src/solution/s0038_count_and_say.rs

@@ -37,6 +37,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/count-and-say/
+// discuss: https://leetcode.com/problems/count-and-say/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 use std::char::from_digit;

src/solution/s0039_combination_sum.rs

@@ -38,6 +38,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/combination-sum/
+// discuss: https://leetcode.com/problems/combination-sum/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 impl Solution {

src/solution/s0040_combination_sum_ii.rs

@@ -39,6 +39,9 @@
  */
 pub struct Solution {}
 
+// problem: https://leetcode.com/problems/combination-sum-ii/
+// discuss: https://leetcode.com/problems/combination-sum-ii/discuss/?currentPage=1&orderBy=most_votes&query=
+
 // submission codes start here
 
 impl Solution {