Skip to content

Commit 2065d69

Browse files
committed
update readme
1 parent cf02a7e commit 2065d69

File tree

2 files changed

+2
-7
lines changed

2 files changed

+2
-7
lines changed

.github/Question List.txt

Lines changed: 1 addition & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1 @@
1-
1405-longest-happy-string python medium
2-
0759-employee-free-time python hard
3-
2877-create-a-dataframe-from-list python easy
4-
2878-get-the-size-of-a-dataframe python easy
5-
3177-find-the-maximum-length-of-a-good-subsequence-ii python medium
6-
0670-maximum-swap python medium
7-
0516-longest-palindromic-subsequence python medium
1+
2044-count-number-of-maximum-bitwise-or-subsets python medium

README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -731,6 +731,7 @@ The solutions are organized as follows:
731731
| 2028 | [Find Missing Observations](https://leetcode.com/problems/find-missing-observations/) | [Python](./2028-find-missing-observations/2028-find-missing-observations.py) | [Medium](./2028-find-missing-observations/README.md) |
732732
| 2037 | [Minimum Number of Moves to Seat Everyone](https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone/) | [Python](./2037-minimum-number-of-moves-to-seat-everyone/2037-minimum-number-of-moves-to-seat-everyone.py) | [Easy](./2037-minimum-number-of-moves-to-seat-everyone/README.md) |
733733
| 2038 | [Remove Colored Pieces if Both Neighbors are the Same Color](https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/) | [Python](./2038-remove-colored-pieces-if-both-neighbors-are-the-same-color/2038-remove-colored-pieces-if-both-neighbors-are-the-same-color.py) | [Medium](./2038-remove-colored-pieces-if-both-neighbors-are-the-same-color/README.md) |
734+
| 2044 | [Count Number of Maximum Bitwise OR Subsets](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets) | [Python](./2044-count-number-of-maximum-bitwise-or-subsets/2044-count-number-of-maximum-bitwise-or-subsets.py) | [Medium](./2044-count-number-of-maximum-bitwise-or-subsets/README.md) |
734735
| 2045 | [Second Minimum Time to Reach Destination](https://leetcode.com/problems/second-minimum-time-to-reach-destination/) | [Python](./2045-second-minimum-time-to-reach-destination/2045-second-minimum-time-to-reach-destination.py) | [Hard](./2045-second-minimum-time-to-reach-destination/README.md) |
735736
| 2050 | [Number of Different Integers in a String](https://leetcode.com/problems/number-of-different-integers-in-a-string/) | [Python](./2050-number-of-different-integers-in-a-string/2050-number-of-different-integers-in-a-string.py) | [Easy](./2050-number-of-different-integers-in-a-string/README.md) |
736737
| 2053 | [Kth Distinct String in an Array](https://leetcode.com/problems/kth-distinct-string-in-an-array/) | [Python](./2053-kth-distinct-string-in-an-array/2053-kth-distinct-string-in-an-array.py) | [Easy](./2053-kth-distinct-string-in-an-array/README.md) |

0 commit comments

Comments
 (0)