tags: Weekly Contest

Weekly Contest 419

3318. Find X-Sum of All K-Long Subarrays I (Easy)

Solution

時間複雜度: O(n)

空間複雜度: O(1)

程式碼:

3319. K-th Largest Perfect Subtree Size in Binary Tree (Medium)

Solution

時間複雜度:

空間複雜度:

程式碼:

3320. Count The Number of Winning Sequences (Hard)

Solution

時間複雜度:

空間複雜度:

程式碼:

3321. Find X-Sum of All K-Long Subarrays II (Hard)

Solution

時間複雜度:

空間複雜度:

程式碼: