Skip to content

Commit fc6d640

Browse files
committed
update readme
1 parent ed68698 commit fc6d640

File tree

2 files changed

+5
-1
lines changed

2 files changed

+5
-1
lines changed

.github/Question List.txt

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,5 @@
11
2044-count-number-of-maximum-bitwise-or-subsets python medium
22
1545-find-kth-bit-in-nth-binary-string python medium
3-
1092-shortest-common-supersequence python hard
3+
1092-shortest-common-supersequence python hard
4+
3324-find-the-sequence-of-strings-appeared-on-the-screen python medium
5+
3325-count-substrings-with-k-frequency-characters-i python medium

README.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -928,6 +928,8 @@ The solutions are organized as follows:
928928
| 3315 | [Construct the Minimum Bitwise Array II](https://leetcode.com/problems/construct-the-minimum-bitwise-array-ii/) | [Python](./3315-construct-the-minimum-bitwise-array-ii/3315-construct-the-minimum-bitwise-array-ii.py) | [Medium](./3315-construct-the-minimum-bitwise-array-ii/README.md) |
929929
| 3318 | [Find X Sum of All K Long Subarrays I](https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-i/) | [Python](./3318-find-x-sum-of-all-k-long-subarrays-i/3318-find-x-sum-of-all-k-long-subarrays-i.py) | [Easy](./3318-find-x-sum-of-all-k-long-subarrays-i/README.md) |
930930
| 3319 | [K-th Largest Perfect Subtree Size in Binary Tree](https://leetcode.com/problems/k-th-largest-perfect-subtree-size-in-binary-tree/) | [Python](./3319-k-th-largest-perfect-subtree-size-in-binary-tree/3319-k-th-largest-perfect-subtree-size-in-binary-tree.py) | [Medium](./3319-k-th-largest-perfect-subtree-size-in-binary-tree/README.md) |
931+
| 3324 | [Find the Sequence of Strings Appeared on the Screen](https://leetcode.com/problems/find-the-sequence-of-strings-appeared-on-the-screen) | [Python](./3324-find-the-sequence-of-strings-appeared-on-the-screen/3324-find-the-sequence-of-strings-appeared-on-the-screen.py) | [Medium](./3324-find-the-sequence-of-strings-appeared-on-the-screen/README.md) |
932+
| 3325 | [Count Substrings with K Frequency Characters I](https://leetcode.com/problems/count-substrings-with-k-frequency-characters-i) | [Python](./3325-count-substrings-with-k-frequency-characters-i/3325-count-substrings-with-k-frequency-characters-i.py) | [Medium](./3325-count-substrings-with-k-frequency-characters-i/README.md) |
931933

932934
## How to Use
933935

0 commit comments

Comments
 (0)