Updated markdown files

Author: Zanger67/leetcode

README.md

@@ -1,4 +1,4 @@
-# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (681 solved)
+# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (682 solved)
 
 <!-- This readme was generated using [WikiLeet](<https://github.com/Zanger67/WikiLeet>) -->
 
@@ -187,7 +187,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
 |  351 | [Android Unlock Patterns](<https://leetcode.com/problems/android-unlock-patterns>)                                                                                                         | Medium  | Weekly Premium            | [solution](<markdowns/_351. Android Unlock Patterns.md>)                                                      | py                                          |
 |  353 | [Design Snake Game](<https://leetcode.com/problems/design-snake-game>)                                                                                                                     | Medium  | Weekly Premium            | [solution](<markdowns/_353. Design Snake Game.md>)                                                            | py                                          |
 |  362 | [Design Hit Counter](<https://leetcode.com/problems/design-hit-counter>)                                                                                                                   | Medium  |                           | [solution](<markdowns/_362. Design Hit Counter.md>)                                                           | py                                          |
-|  364 | [Nested List Weight Sum II](<https://leetcode.com/problems/nested-list-weight-sum-ii>)                                                                                                     | Medium  |                           | [solution](<markdowns/_364. Nested List Weight Sum II.md>)                                                    | java, py                                    |
+|  364 | [Nested List Weight Sum II](<https://leetcode.com/problems/nested-list-weight-sum-ii>)                                                                                                     | Medium  | Weekly Premium            | [solution](<markdowns/_364. Nested List Weight Sum II.md>)                                                    | java, py                                    |
 |  366 | [Find Leaves of Binary Tree](<https://leetcode.com/problems/find-leaves-of-binary-tree>)                                                                                                   | Medium  |                           | [solution](<markdowns/_366. Find Leaves of Binary Tree.md>)                                                   | py                                          |
 |  369 | [Plus One Linked List](<https://leetcode.com/problems/plus-one-linked-list>)                                                                                                               | Medium  |                           | [solution](<markdowns/_369. Plus One Linked List.md>)                                                         | c                                           |
 |  374 | [Guess Number Higher or Lower](<https://leetcode.com/problems/guess-number-higher-or-lower>)                                                                                               | Easy    |                           | [solution](<markdowns/_374. Guess Number Higher or Lower.md>)                                                 | java, py                                    |
@@ -342,7 +342,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
 | 1004 | [Max Consecutive Ones III](<https://leetcode.com/problems/max-consecutive-ones-iii>)                                                                                                       | Medium  |                           | [solution](<markdowns/_1004. Max Consecutive Ones III.md>)                                                    | py                                          |
 | 1006 | [Clumsy Factorial](<https://leetcode.com/problems/clumsy-factorial>)                                                                                                                       | Medium  |                           | [solution](<markdowns/_1006. Clumsy Factorial.md>)                                                            | c, py                                       |
 | 1008 | [Construct Binary Search Tree from Preorder Traversal](<https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal>)                                               | Medium  |                           | [solution](<markdowns/_1008. Construct Binary Search Tree from Preorder Traversal.md>)                        | c, cpp, java                                |
-| 1018 | [Binary Prefix Divisible By 5](<https://leetcode.com/problems/binary-prefix-divisible-by-5>)                                                                                               | Easy    |                           | [solution](<markdowns/_1018. Binary Prefix Divisible By 5.md>)                                                | py                                          |
+| 1018 | [Binary Prefix Divisible By 5](<https://leetcode.com/problems/binary-prefix-divisible-by-5>)                                                                                               | Easy    | Daily                     | [solution](<markdowns/_1018. Binary Prefix Divisible By 5.md>)                                                | py                                          |
 | 1019 | [Next Greater Node In Linked List](<https://leetcode.com/problems/next-greater-node-in-linked-list>)                                                                                       | Medium  |                           | [solution](<markdowns/_1019. Next Greater Node In Linked List.md>)                                            | py                                          |
 | 1020 | [Number of Enclaves](<https://leetcode.com/problems/number-of-enclaves>)                                                                                                                   | Medium  |                           | [solution](<markdowns/_1020. Number of Enclaves.md>)                                                          | py                                          |
 | 1026 | [Maximum Difference Between Node and Ancestor](<https://leetcode.com/problems/maximum-difference-between-node-and-ancestor>)                                                               | Medium  |                           | [solution](<markdowns/_1026. Maximum Difference Between Node and Ancestor.md>)                                | py                                          |
@@ -689,7 +689,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
 | 3185 | Weekly Contest 402 - q2 - [Count Pairs That Form a Complete Day II](<https://leetcode.com/problems/count-pairs-that-form-a-complete-day-ii>)                                               | Medium  | Contest                   | [solution](<markdowns/_3185. Count Pairs That Form a Complete Day II.md>)                                     | py                                          |
 | 3186 | Weekly Contest 402 - q3 - [Maximum Total Damage With Spell Casting](<https://leetcode.com/problems/maximum-total-damage-with-spell-casting>)                                               | Medium  | Contest, Daily            | [solution](<markdowns/_3186. Maximum Total Damage With Spell Casting.md>)                                     | py                                          |
 | 3189 | [Minimum Moves to Get a Peaceful Board](<https://leetcode.com/problems/minimum-moves-to-get-a-peaceful-board>)                                                                             | Medium  | Weekly Premium            | [solution](<markdowns/_3189. Minimum Moves to Get a Peaceful Board.md>)                                       | py                                          |
-| 3190 | [Find Minimum Operations to Make All Elements Divisible by Three](<https://leetcode.com/problems/find-minimum-operations-to-make-all-elements-divisible-by-three>)                         | Easy    |                           | [solution](<markdowns/_3190. Find Minimum Operations to Make All Elements Divisible by Three.md>)             | java                                        |
+| 3190 | [Find Minimum Operations to Make All Elements Divisible by Three](<https://leetcode.com/problems/find-minimum-operations-to-make-all-elements-divisible-by-three>)                         | Easy    | Daily                     | [solution](<markdowns/_3190. Find Minimum Operations to Make All Elements Divisible by Three.md>)             | java                                        |
 | 3191 | [Minimum Operations to Make Binary Array Elements Equal to One I](<https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-i>)                         | Medium  | Daily                     | [solution](<markdowns/_3191. Minimum Operations to Make Binary Array Elements Equal to One I.md>)             | java                                        |
 | 3192 | [Minimum Operations to Make Binary Array Elements Equal to One II](<https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-ii>)                       | Medium  |                           | [solution](<markdowns/_3192. Minimum Operations to Make Binary Array Elements Equal to One II.md>)            | java                                        |
 | 3194 | Weekly Contest 403 - q1 - [Minimum Average of Smallest and Largest Elements](<https://leetcode.com/problems/minimum-average-of-smallest-and-largest-elements>)                             | Easy    | Contest                   | [solution](<markdowns/_3194. Minimum Average of Smallest and Largest Elements.md>)                            | py                                          |
@@ -721,6 +721,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
 | 3460 | [Longest Common Prefix After at Most One Removal](<https://leetcode.com/problems/longest-common-prefix-after-at-most-one-removal>)                                                         | Medium  |                           | [solution](<markdowns/_3460. Longest Common Prefix After at Most One Removal.md>)                             | py                                          |
 | 3461 | [Check If Digits Are Equal in String After Operations I](<https://leetcode.com/problems/check-if-digits-are-equal-in-string-after-operations-i>)                                           | Easy    | Daily                     | [solution](<markdowns/_3461. Check If Digits Are Equal in String After Operations I.md>)                      | py                                          |
 | 3463 | [Check If Digits Are Equal in String After Operations II](<https://leetcode.com/problems/check-if-digits-are-equal-in-string-after-operations-ii>)                                         | Hard    |                           | [solution](<markdowns/_3463. Check If Digits Are Equal in String After Operations II.md>)                     | py                                          |
+| 3512 | [Minimum Operations to Make Array Sum Divisible by K](<https://leetcode.com/problems/minimum-operations-to-make-array-sum-divisible-by-k>)                                                 | Easy    | Daily                     | [solution](<markdowns/_3512. Minimum Operations to Make Array Sum Divisible by K.md>)                         | py                                          |
 | 3516 | [Find Closest Person](<https://leetcode.com/problems/find-closest-person>)                                                                                                                 | Easy    | Daily                     | [solution](<markdowns/_3516. Find Closest Person.md>)                                                         | go, py                                      |
 | 3541 | [Find Most Frequent Vowel and Consonant](<https://leetcode.com/problems/find-most-frequent-vowel-and-consonant>)                                                                           | Easy    | Daily                     | [solution](<markdowns/_3541. Find Most Frequent Vowel and Consonant.md>)                                      | py                                          |