分類：Leetcode | Hsing Yu = = We are the dreamers. We make it happen 'cause we can see it.

Easy ( 65 )

09-18

1337. The K Weakest Rows in a Matrix

Hard ( 17 )

09-17

847. Shortest Path Visiting All Nodes

Medium ( 106 )

09-15

1584. Min Cost to Connect All Points

09-11

1282. Group the People Given the Group Size They Belong To

Hard ( 17 )

08-27

Medium ( 106 )

08-17

Hard ( 17 )

08-16

239. Sliding Window Maximum

Medium ( 106 )

08-15

86. Partition List

08-14

215. Kth Largest Element in an Array

08-13

2369. Check if There is a Valid Partition For The Array