updating all READMEs

Author: github-actions[bot]

.dev/logs.json

@@ -564,7 +564,7 @@
   "119": {
     "len": 2,
     "sols": {
-      "pascals_triangle_ii.rs": "e1c93c5deb2fada33b078cba160101cf06b78dfc3b0145ae572d34bd8aee3657"
+      "pascals_triangle_ii.rs": "8814e159d72f58244d84e552a73267cf72681042364cac5b63ad3cf452603ed4"
     }
   },
   "120": {
@@ -1949,8 +1949,10 @@
     "sols": {}
   },
   "434": {
-    "len": 0,
-    "sols": {}
+    "len": 2,
+    "sols": {
+      "num_of_segments_in_a_string.rs": "73b72f788def1874bc63bbd5004ff06d7d634d16c0481bae0019c1ab960744fd"
+    }
   },
   "435": {
     "len": 0,
@@ -1979,8 +1981,10 @@
     "sols": {}
   },
   "441": {
-    "len": 0,
-    "sols": {}
+    "len": 2,
+    "sols": {
+      "arrange_coins.rs": "7511e59eca47d35b9bf3a19f97ce94061eb30b79b49433c247756a857e0c80a5"
+    }
   },
   "442": {
     "len": 2,
@@ -2011,8 +2015,10 @@
     "sols": {}
   },
   "448": {
-    "len": 0,
-    "sols": {}
+    "len": 2,
+    "sols": {
+      "find_all_nums_disappeared_in_an_array.rs": "b2979d0dcfaeeee5e770a5b4021bb832d018b72fa9e561f696984c862d23f317"
+    }
   },
   "449": {
     "len": 0,
@@ -2064,7 +2070,9 @@
   },
   "461": {
     "len": 2,
-    "sols": {}
+    "sols": {
+      "hamming_distance.rs": "234590f9ef9d50ee923fa50696e9e7bff2e26b5a520039ffab8737eaa31f63e1"
+    }
   },
   "462": {
     "len": 0,
@@ -2123,8 +2131,10 @@
     "sols": {}
   },
   "476": {
-    "len": 0,
-    "sols": {}
+    "len": 2,
+    "sols": {
+      "num_complement.rs": "73cc4ddb9888bd00977018f66d8692edadcff3e0da522819255e4e7908a59555"
+    }
   },
   "477": {
     "len": 0,
@@ -2147,8 +2157,10 @@
     "sols": {}
   },
   "482": {
-    "len": 0,
-    "sols": {}
+    "len": 2,
+    "sols": {
+      "license_key_formatting.rs": "117e6eb67ac6f2f51950188bc4704e05dcae48698e0f537ee02fd2e22cffc2eb"
+    }
   },
   "483": {
     "len": 0,
@@ -2159,8 +2171,10 @@
     "sols": {}
   },
   "485": {
-    "len": 0,
-    "sols": {}
+    "len": 2,
+    "sols": {
+      "max_consecutive_ones.rs": "dba7a2bb4d4f64e4790c5c3ca375a5618c32c015d33381b0dc5a2027c0e3e8d4"
+    }
   },
   "486": {
     "len": 0,
@@ -2187,8 +2201,10 @@
     "sols": {}
   },
   "492": {
-    "len": 0,
-    "sols": {}
+    "len": 2,
+    "sols": {
+      "contruct_the_rectangle.rs": "ed34544ff2d7ef33c8e3d47300022b17c2a8961ad481e019e6ec4f02b8024c64"
+    }
   },
   "493": {
     "len": 0,
@@ -2237,8 +2253,10 @@
     "sols": {}
   },
   "504": {
-    "len": 0,
-    "sols": {}
+    "len": 2,
+    "sols": {
+      "base_7.rs": "2262f7dad68c75b223d441adfe03c58428540ca18c576443e8ddf163adfc6ba4"
+    }
   },
   "505": {
     "len": 0,
@@ -2251,8 +2269,10 @@
     }
   },
   "507": {
-    "len": 0,
-    "sols": {}
+    "len": 2,
+    "sols": {
+      "perfect_number.rs": "0d2a1b8a0cda72b57e7218480a046ae0cae8808e54a259e873a92d36a1f9776d"
+    }
   },
   "508": {
     "len": 0,
@@ -2846,8 +2866,10 @@
     "sols": {}
   },
   "652": {
-    "len": 0,
-    "sols": {}
+    "len": 2,
+    "sols": {
+      "find_duplicate_subtrees.go": "82b2412584e7d8a6976a877856d9342ce8503644991df3aa885f032c059a082a"
+    }
   },
   "653": {
     "len": 2,

README.md

@@ -95,7 +95,7 @@
 [**_Rejection Sampling_**][rejection sampling]  • 
 [**_Biconnected Component_**][biconnected component]
 
-### **Total Problems Solved: _139_**
+### **Total Problems Solved: _150_**
 
 ---
 

TOPICWISE.md

@@ -103,7 +103,7 @@ It might take some time to reflect changes from the repository.
 [**_Rejection Sampling_**][rejection sampling]  • 
 [**_Biconnected Component_**][biconnected component]
 
-### **Total Problems Solved: _139_**
+### **Total Problems Solved: _150_**
 
 ## Contributors
 

docs/index.md

@@ -50,7 +50,7 @@ impl Solution {
         // loop through the vector, starting at 1
         for i in 1..row_index {
             // loop through the vector, starting at i + 1 and going backwards
-            for j in (1..i + 1).rev() {
+            for j in (1..=i).rev() {
                 // add the value at the current index to the value at the previous index
                 row[j as usize] += row[(j - 1) as usize];
             }

src/0101-0200/119 - Pascals Triangle II/README.md

@@ -0,0 +1,68 @@
+# 434. Number of Segments in a String [![share]](https://leetcode.com/problems/number-of-segments-in-a-string/)
+
+![][easy]
+
+## Problem Statement
+
+<p>Given a string <code>s</code>, return <em>the number of segments in the string</em>.</p>
+<p>A <strong>segment</strong> is defined to be a contiguous sequence of <strong>non-space characters</strong>.</p>
+<p> </p>
+<p><strong class="example">Example 1:</strong></p>
+
+```
+Input: s = "Hello, my name is John"
+Output: 5
+Explanation: The five segments are ["Hello,", "my", "name", "is", "John"]
+```
+
+<p><strong class="example">Example 2:</strong></p>
+
+```
+Input: s = "Hello"
+Output: 1
+```
+
+<p> </p>
+<p><strong>Constraints:</strong></p>
+<ul>
+<li><code>0 &lt;= s.length &lt;= 300</code></li>
+<li><code>s</code> consists of lowercase and uppercase English letters, digits, or one of the following characters <code>"!@#$%^&amp;*()_+-=',.:"</code>.</li>
+<li>The only space character in <code>s</code> is <code>' '</code>.</li>
+</ul>
+
+## Solutions
+
+### [_Rust_](num_of_segments_in_a_string.rs)
+
+```rs [Rust]
+impl Solution {
+    pub fn count_segments(s: String) -> i32 {
+        let (mut count, mut is_space) = (0, true);
+
+        for c in s.chars() {
+            if c == ' ' {
+                is_space = true;
+            } else if is_space {
+                is_space = false;
+                count += 1;
+            }
+        }
+
+        count
+    }
+}
+
+```
+
+### [_..._]()
+
+```
+
+```
+
+<!----------------------------------{ link }--------------------------------->
+
+[share]: https://graph.org/file/3ea5234dda646b71c574a.png
+[easy]: https://img.shields.io/badge/Difficulty-Easy-bright.svg
+[medium]: https://img.shields.io/badge/Difficulty-Medium-yellow.svg
+[hard]: https://img.shields.io/badge/Difficulty-Hard-red.svg

src/0401-0500/434 - Number of Segments in a String/README.md

@@ -0,0 +1,65 @@
+# 441. Arranging Coins [![share]](https://leetcode.com/problems/arranging-coins/)
+
+![][easy]
+
+## Problem Statement
+
+<p>You have <code>n</code> coins and you want to build a staircase with these coins. The staircase consists of <code>k</code> rows where the <code>i<sup>th</sup></code> row has exactly <code>i</code> coins. The last row of the staircase <strong>may be</strong> incomplete.</p>
+<p>Given the integer <code>n</code>, return <em>the number of <strong>complete rows</strong> of the staircase you will build</em>.</p>
+<p> </p>
+<p><strong class="example">Example 1:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2021/04/09/arrangecoins1-grid.jpg" style="width: 253px; height: 253px;"/>
+
+```
+Input: n = 5
+Output: 2
+Explanation: Because the 3rd row is incomplete, we return 2.
+```
+
+<p><strong class="example">Example 2:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2021/04/09/arrangecoins2-grid.jpg" style="width: 333px; height: 333px;"/>
+
+```
+Input: n = 8
+Output: 3
+Explanation: Because the 4th row is incomplete, we return 3.
+```
+
+<p> </p>
+<p><strong>Constraints:</strong></p>
+<ul>
+<li><code>1 &lt;= n &lt;= 2<sup>31</sup> - 1</code></li>
+</ul>
+
+## Solutions
+
+### [_Rust_](arrange_coins.rs)
+
+```rs [Rust]
+impl Solution {
+    pub fn arrange_coins(n: i32) -> i32 {
+        let (mut n, mut i) = (n, 1);
+
+        while n >= i {
+            n -= i;
+            i += 1;
+        }
+
+        i - 1
+    }
+}
+
+```
+
+### [_..._]()
+
+```
+
+```
+
+<!----------------------------------{ link }--------------------------------->
+
+[share]: https://graph.org/file/3ea5234dda646b71c574a.png
+[easy]: https://img.shields.io/badge/Difficulty-Easy-bright.svg
+[medium]: https://img.shields.io/badge/Difficulty-Medium-yellow.svg
+[hard]: https://img.shields.io/badge/Difficulty-Hard-red.svg

src/0401-0500/441 - Arranging Coins/README.md

@@ -0,0 +1,83 @@
+# 448. Find All Numbers Disappeared in an Array [![share]](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/)
+
+![][easy]
+
+## Problem Statement
+
+<p>Given an array <code>nums</code> of <code>n</code> integers where <code>nums[i]</code> is in the range <code>[1, n]</code>, return <em>an array of all the integers in the range</em> <code>[1, n]</code> <em>that do not appear in</em> <code>nums</code>.</p>
+<p> </p>
+<p><strong class="example">Example 1:</strong></p>
+
+```
+Input: nums = [4,3,2,7,8,2,3,1]
+Output: [5,6]
+```
+
+<p><strong class="example">Example 2:</strong></p>
+
+```
+Input: nums = [1,1]
+Output: [2]
+```
+
+<p> </p>
+<p><strong>Constraints:</strong></p>
+<ul>
+<li><code>n == nums.length</code></li>
+<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
+<li><code>1 &lt;= nums[i] &lt;= n</code></li>
+</ul>
+<p> </p>
+<p><strong>Follow up:</strong> Could you do it without extra space and in <code>O(n)</code> runtime? You may assume the returned list does not count as extra space.</p>
+
+<details>
+<summary>
+
+#### _Click to open Hints_
+
+</summary>
+
+- This is a really easy problem if you decide to use additional memory. For those trying to write an initial solution using additional memory, think <b>counters!</b>
+- However, the trick really is to not use any additional space than what is already available to use. Sometimes, multiple passes over the input array help find the solution. However, there's an interesting piece of information in this problem that makes it easy to re-use the input array itself for the solution.
+- The problem specifies that the numbers in the array will be in the range [1, n] where n is the number of elements in the array. Can we use this information and modify the array in-place somehow to find what we need?
+
+</details>
+
+## Solutions
+
+### [_Rust_](find_all_nums_disappeared_in_an_array.rs)
+
+```rs [Rust]
+impl Solution {
+    pub fn find_disappeared_numbers(nums: Vec<i32>) -> Vec<i32> {
+        let mut res = Vec::new();
+        let mut map = std::collections::HashMap::new();
+
+        for i in 0..nums.len() {
+            map.insert(nums[i], i);
+        }
+
+        for i in 1..=nums.len() {
+            if !map.contains_key(&(i as i32)) {
+                res.push(i as i32);
+            }
+        }
+
+        res
+    }
+}
+
+```
+
+### [_..._]()
+
+```
+
+```
+
+<!----------------------------------{ link }--------------------------------->
+
+[share]: https://graph.org/file/3ea5234dda646b71c574a.png
+[easy]: https://img.shields.io/badge/Difficulty-Easy-bright.svg
+[medium]: https://img.shields.io/badge/Difficulty-Medium-yellow.svg
+[hard]: https://img.shields.io/badge/Difficulty-Hard-red.svg