leetcode

Leetcode problem solutions
git clone https://git.sinitax.com/sinitax/leetcode
Log | Files | Refs | sfeed.txt

Cargo.toml (1323B)

      1[package]
      2name = "leetcode"
      3version = "0.1.0"
      4edition = "2021"
      5
      6[[bin]]
      7name = "4"
      8path = "src/bin/0004-median-of-two-sorted-arrays.rs"
      9
     10[[bin]]
     11name = "2491"
     12path = "src/bin/2491-divide-players-into-teams-of-equal-skill.rs"
     13
     14[[bin]]
     15name = "2070"
     16path = "src/bin/2070-most-beautiful-item-for-each-query.rs"
     17
     18[[bin]]
     19name = "2516"
     20path = "src/bin/2516-take-k-of-each-character-from-left-and-right.rs"
     21
     22[[bin]]
     23name = "2463"
     24path = "src/bin/2463-minimum-total-distance-traveled.rs"
     25
     26[[bin]]
     27name = "2461"
     28path = "src/bin/2461-maximum-sum-of-distinct-subarrays-with-length-k.rs"
     29
     30[[bin]]
     31name = "1671"
     32path = "src/bin/1671-minimum-number-of-removals-to-make-mountain-array.rs"
     33
     34[[bin]]
     35name = "2601"
     36path = "src/bin/2601-prime-subtraction-operation.rs"
     37
     38[[bin]]
     39name = "19"
     40path = "src/bin/0019-remove-nth-node-from-end-of-list.rs"
     41
     42[[bin]]
     43name = "3254"
     44path = "src/bin/3254-find-the-power-of-k-size-subarrays-i.rs"
     45
     46[[bin]]
     47name = "1"
     48path = "src/bin/0001-two-sum.rs"
     49
     50[[bin]]
     51name = "2563"
     52path = "src/bin/2563-count-the-number-of-fair-pairs.rs"
     53
     54[[bin]]
     55name = "1574"
     56path = "src/bin/1574-shortest-subarray-to-be-removed-to-make-array-sorted.rs"
     57
     58[[bin]]
     59name = "386"
     60path = "src/bin/0386-lexicographical-numbers.rs"
     61
     62[[bin]]
     63name = "2064"
     64path = "src/bin/2064-minimized-maximum-of-products-distributed-to-any-store.rs"
     65