update readme

Author: hogan-tech

.github/Question List.txt

@@ -8,4 +8,6 @@
 2125-number-of-laser-beams-in-a-bank python medium
 2870-minimum-number-of-operations-to-make-array-empty python medium
 0300-longest-increasing-subsequence python medium
-0446-arithmetic-slices-ii-subsequence python hard
+0446-arithmetic-slices-ii-subsequence python hard
+0938-range-sum-of-bst python easy
+1428-leftmost-column-with-at-least-a-one python medium

README.md

@@ -247,6 +247,7 @@ The solutions are organized as follows:
 | 0905 | [Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity/)                                                                                         | [Python](./0905-sort-array-by-parity/0905-sort-array-by-parity.py)                                                                                                                                                                           | [Easy](./0905-sort-array-by-parity/README.md)                                             |
 | 0920 | [Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists/)                                                                               | [Python](./0920-number-of-music-playlists/0920-number-of-music-playlists.py)                                                                                                                                                                 | [Hard](./0920-number-of-music-playlists/README.md)                                        |
 | 0935 | [Knight Dialer](https://leetcode.com/problems/knight-dialer/)                                                                                                       | [Python](./0935-knight-dialer/0935-knight-dialer.py)                                                                                                                                                                                         | [Medium](./0935-knight-dialer/README.md)                                                  |
+| 0938 | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst/)                                                                                                 | [Python](./0938-range-sum-of-bst/0938-range-sum-of-bst.py)                                                                                                                                                                                   | [Easy](./0938-range-sum-of-bst/README.md)                                                 |
 | 0973 | [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/)                                                                             | [Python](./0973-k-closest-points-to-origin/0973-k-closest-points-to-origin.py)                                                                                                                                                               | [Medium](./0973-k-closest-points-to-origin/README.md)                                     |
 | 0977 | [Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/)                                                                               | [C++](./0977-squares-of-a-sorted-array/0977-squares-of-a-sorted-array.cpp)                                                                                                                                                                   | [Easy](./0977-squares-of-a-sorted-array/README.md)                                        |
 | 0981 | [Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store/)                                                                             | [Python](./0981-time-based-key-value-store/0981-time-based-key-value-store.py)                                                                                                                                                               | [Medium](./0981-time-based-key-value-store/README.md)                                     |
@@ -287,6 +288,7 @@ The solutions are organized as follows:
 | 1422 | [Maximum Score After Splitting a String](https://leetcode.com/problems/maximum-score-after-splitting-a-string/)                                                     | [Python](./1422-maximum-score-after-splitting-a-string/1422-maximum-score-after-splitting-a-string.py)                                                                                                                                       | [Easy](./1422-maximum-score-after-splitting-a-string/README.md)                           |
 | 1424 | [Diagonal Traverse II](https://leetcode.com/problems/diagonal-traverse-ii/)                                                                                         | [Python](./1424-diagonal-traverse-ii/1424-diagonal-traverse-ii.py)                                                                                                                                                                           | [Medium](./1424-diagonal-traverse-ii/README.md)                                           |
 | 1425 | [Constrained Subsequence Sum](https://leetcode.com/problems/constrained-subsequence-sum/)                                                                           | [Python](./1425-constrained-subsequence-sum/1425-constrained-subsequence-sum.py)                                                                                                                                                             | [Hard](./1425-constrained-subsequence-sum/README.md)                                      |
+| 1428 | [Leftmost Column with at Least a One](https://leetcode.com/problems/leftmost-column-with-at-least-a-one/)                                                           | [Python](./1428-leftmost-column-with-at-least-a-one/1428-leftmost-column-with-at-least-a-one.py)                                                                                                                                             | [Medium](./1428-leftmost-column-with-at-least-a-one/README.md)                            |
 | 1436 | [Destination City](https://leetcode.com/problems/destination-city/)                                                                                                 | [Python](./1436-destination-city/1436-destination-city.py)                                                                                                                                                                                   | [Easy](./1436-destination-city/README.md)                                                 |
 | 1441 | [Build an Array With Stack Operations](https://leetcode.com/problems/build-an-array-with-stack-operations/)                                                         | [Python](./1441-build-an-array-with-stack-operations/1441-build-an-array-with-stack-operations.py)                                                                                                                                           | [Easy](./1441-build-an-array-with-stack-operations/README.md)                             |
 | 1458 | [Max Dot Product of Two Subsequences](https://leetcode.com/problems/max-dot-product-of-two-subsequences/)                                                           | [Python](./1458-max-dot-product-of-two-subsequences/1458-max-dot-product-of-two-subsequences.py)                                                                                                                                             | [Hard](./1458-max-dot-product-of-two-subsequences/README.md)                              |