###### tags: `Weekly Contest` # Weekly Contest 419 ## [3318. Find X-Sum of All K-Long Subarrays I](https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-i/) (<font color=#00B8A3>Easy</font>) ### Solution #### 時間複雜度: ***O(n)*** #### 空間複雜度: ***O(1)*** 程式碼: ```c++= ``` ## [3319. K-th Largest Perfect Subtree Size in Binary Tree](https://leetcode.com/problems/k-th-largest-perfect-subtree-size-in-binary-tree/) (<font color=#FFC011>Medium</font>) ### Solution #### 時間複雜度: #### 空間複雜度: 程式碼: ```c++= ``` ## [3320. Count The Number of Winning Sequences](https://leetcode.com/problems/count-the-number-of-winning-sequences/) (<font color=#FF375F>Hard</font>) ### Solution #### 時間複雜度: #### 空間複雜度: 程式碼: ```c++= ``` ## [3321. Find X-Sum of All K-Long Subarrays II](https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-ii/) (<font color=#FF375F>Hard</font>) ### Solution #### 時間複雜度: #### 空間複雜度: 程式碼: ```c++= ```
×
Sign in
Email
Password
Forgot password
or
By clicking below, you agree to our
terms of service
.
Sign in via Facebook
Sign in via Twitter
Sign in via GitHub
Sign in via Dropbox
Sign in with Wallet
Wallet (
)
Connect another wallet
New to HackMD?
Sign up