Just Coding, with Jie - VideoAndMovie

https://jz0815.github.io/
Just begin the blogging. Will add a category to write leetcode solutions

3373. Maximize the Number of Target Nodes After Connecting Trees II

18:52

3373. Maximize the Number of Target Nodes After Connecting Trees II

3372. Maximize the Number of Target Nodes After Connecting Trees I

16:26

3372. Maximize the Number of Target Nodes After Connecting Trees I

1579. Remove Max Number of Edges to Keep Graph Fully Traversable

21:16

1579. Remove Max Number of Edges to Keep Graph Fully Traversable

2131. Longest Palindrome by Concatenating Two Letter Words

9:53

2131. Longest Palindrome by Concatenating Two Letter Words

2031. Count Subarrays With More Ones Than Zeros

36:41

2031. Count Subarrays With More Ones Than Zeros

2484. Count Palindromic Subsequences

23:35

2484. Count Palindromic Subsequences

3362. Zero Array Transformation III

28:46

3362. Zero Array Transformation III

446. Arithmetic Slices II - Subsequence

16:14

446. Arithmetic Slices II - Subsequence

413. Arithmetic Slices

8:42

413. Arithmetic Slices

473. Matchsticks to Square

12:23

473. Matchsticks to Square

698. Partition to K Equal Sum Subsets

19:59

698. Partition to K Equal Sum Subsets

3144. Minimum Substring Partition of Equal Character Frequency

13:49

3144. Minimum Substring Partition of Equal Character Frequency

1584. Min Cost to Connect All Points

31:26

1584. Min Cost to Connect All Points

316. Remove Duplicate Letters

16:11

316. Remove Duplicate Letters

75. Sort Colors

10:53

75. Sort Colors

2901. Longest Unequal Adjacent Groups Subsequence II

15:34

2901. Longest Unequal Adjacent Groups Subsequence II

1419. Minimum Number of Frogs Croaking

11:29

1419. Minimum Number of Frogs Croaking

3335. Total Characters in String After Transformations I

10:25

3335. Total Characters in String After Transformations I

790. Domino and Tromino Tiling

14:16

790. Domino and Tromino Tiling

399. Evaluate Division (union find)

29:52

399. Evaluate Division (union find)

399. Evaluate Division (dfs + memo)

23:06

399. Evaluate Division (dfs + memo)

399. Evaluate Division (floyd warshall)

21:13

399. Evaluate Division (floyd warshall)

964. Least Operators to Express Number

22:26

964. Least Operators to Express Number

2918. Minimum Equal Sum of Two Arrays After Replacing Zeros

8:51

2918. Minimum Equal Sum of Two Arrays After Replacing Zeros

971. Flip Binary Tree To Match Preorder Traversal

19:16

971. Flip Binary Tree To Match Preorder Traversal

1530. Number of Good Leaf Nodes Pairs

13:49

1530. Number of Good Leaf Nodes Pairs

1110. Delete Nodes And Return Forest

14:10

1110. Delete Nodes And Return Forest

2015. Average Height of Buildings in Each Segment

19:12

2015. Average Height of Buildings in Each Segment

149. Max Points on a Line

35:40

149. Max Points on a Line

1810. Minimum Path Cost in a Hidden Grid

35:35

1810. Minimum Path Cost in a Hidden Grid