You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
| 1055 |[Shortest Way to Form String](<https://leetcode.com/problems/shortest-way-to-form-string>)| Medium | Weekly Premium |[solution](<markdowns/_1055. Shortest Way to Form String.md>)| py |
| 1071 |[Greatest Common Divisor of Strings](<https://leetcode.com/problems/greatest-common-divisor-of-strings>)| Easy ||[solution](<markdowns/_1071. Greatest Common Divisor of Strings.md>)| py |
@@ -515,7 +516,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
515
516
| 2191 |[Sort the Jumbled Numbers](<https://leetcode.com/problems/sort-the-jumbled-numbers>)| Medium | Daily |[solution](<markdowns/_2191. Sort the Jumbled Numbers.md>)| py |
516
517
| 2192 |[All Ancestors of a Node in a Directed Acyclic Graph](<https://leetcode.com/problems/all-ancestors-of-a-node-in-a-directed-acyclic-graph>)| Medium | Daily |[solution](<markdowns/_2192. All Ancestors of a Node in a Directed Acyclic Graph.md>)| java, py |
517
518
| 2196 |[Create Binary Tree From Descriptions](<https://leetcode.com/problems/create-binary-tree-from-descriptions>)| Medium | Daily |[solution](<markdowns/_2196. Create Binary Tree From Descriptions.md>)| py |
518
-
| 2206 |[Divide Array Into Equal Pairs](<https://leetcode.com/problems/divide-array-into-equal-pairs>)| Easy ||[solution](<markdowns/_2206. Divide Array Into Equal Pairs.md>)| c, py |
519
+
| 2206 |[Divide Array Into Equal Pairs](<https://leetcode.com/problems/divide-array-into-equal-pairs>)| Easy |Daily|[solution](<markdowns/_2206. Divide Array Into Equal Pairs.md>)| c, py |
519
520
| 2211 |[Count Collisions on a Road](<https://leetcode.com/problems/count-collisions-on-a-road>)| Medium ||[solution](<markdowns/_2211. Count Collisions on a Road.md>)| py |
520
521
| 2221 |[Find Triangular Sum of an Array](<https://leetcode.com/problems/find-triangular-sum-of-an-array>)| Medium ||[solution](<markdowns/_2221. Find Triangular Sum of an Array.md>)| c, java |
521
522
| 2225 |[Find Players With Zero or One Losses](<https://leetcode.com/problems/find-players-with-zero-or-one-losses>)| Medium ||[solution](<markdowns/_2225. Find Players With Zero or One Losses.md>)| java |
@@ -623,7 +624,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
623
624
| 3160 |[Find the Number of Distinct Colors Among the Balls](<https://leetcode.com/problems/find-the-number-of-distinct-colors-among-the-balls>)| Medium | Daily |[solution](<markdowns/_3160. Find the Number of Distinct Colors Among the Balls.md>)| py |
| 3168 | Weekly Contest 400 - q1 - [Minimum Number of Chairs in a Waiting Room](<https://leetcode.com/problems/minimum-number-of-chairs-in-a-waiting-room>)| Easy | Contest |[solution](<markdowns/_3168. Minimum Number of Chairs in a Waiting Room.md>)| py |
626
-
| 3169 | Weekly Contest 400 - q2 - [Count Days Without Meetings](<https://leetcode.com/problems/count-days-without-meetings>)| Medium | Contest|[solution](<markdowns/_3169. Count Days Without Meetings.md>)| py |
627
+
| 3169 | Weekly Contest 400 - q2 - [Count Days Without Meetings](<https://leetcode.com/problems/count-days-without-meetings>)| Medium | Contest, Daily|[solution](<markdowns/_3169. Count Days Without Meetings.md>)| py |
| 3175 | Biweekly Contest 132 - q2 - [Find The First Player to win K Games in a Row](<https://leetcode.com/problems/find-the-first-player-to-win-k-games-in-a-row>)| Medium | Contest |[solution](<markdowns/_3175. Find The First Player to win K Games in a Row.md>)| py |
629
630
| 3178 | Weekly Contest 401 - q1 - [Find the Child Who Has the Ball After K Seconds](<https://leetcode.com/problems/find-the-child-who-has-the-ball-after-k-seconds>)| Easy | Contest |[solution](<markdowns/_3178. Find the Child Who Has the Ball After K Seconds.md>)| py |
@@ -634,7 +635,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
634
635
| 3186 | Weekly Contest 402 - q3 - [Maximum Total Damage With Spell Casting](<https://leetcode.com/problems/maximum-total-damage-with-spell-casting>)| Medium | Contest |[solution](<markdowns/_3186. Maximum Total Damage With Spell Casting.md>)| py |
635
636
| 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 |
636
637
| 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 |
637
-
| 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 ||[solution](<markdowns/_3191. Minimum Operations to Make Binary Array Elements Equal to One I.md>)| java |
638
+
| 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 |
638
639
| 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 |
639
640
| 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 |
640
641
| 3195 | Weekly Contest 403 - q2 - [Find the Minimum Area to Cover All Ones I](<https://leetcode.com/problems/find-the-minimum-area-to-cover-all-ones-i>)| Medium | Contest |[solution](<markdowns/_3195. Find the Minimum Area to Cover All Ones I.md>)| py |
0 commit comments