Skip to content

Commit f4bb604

Browse files
Zanger67/leetcodeZanger67/leetcode
authored andcommitted
Updated markdown files
1 parent 90c4e71 commit f4bb604

File tree

592 files changed

+709
-620
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

592 files changed

+709
-620
lines changed

README.md

Lines changed: 5 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (617 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (618 solved)
22

33
<!-- This readme was generated using [WikiLeet](<https://github.com/Zanger67/WikiLeet>) -->
44

@@ -333,6 +333,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
333333
| 1046 | [Last Stone Weight](<https://leetcode.com/problems/last-stone-weight>) | Easy | N150 | [solution](<markdowns/_1046. Last Stone Weight.md>) | py |
334334
| 1051 | [Height Checker](<https://leetcode.com/problems/height-checker>) | Easy | Daily | [solution](<markdowns/_1051. Height Checker.md>) | c, py |
335335
| 1052 | [Grumpy Bookstore Owner](<https://leetcode.com/problems/grumpy-bookstore-owner>) | Medium | | [solution](<markdowns/_1052. Grumpy Bookstore Owner.md>) | py |
336+
| 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 |
336337
| 1062 | [Longest Repeating Substring](<https://leetcode.com/problems/longest-repeating-substring>) | Medium | Weekly Premium | [solution](<markdowns/_1062. Longest Repeating Substring.md>) | py |
337338
| 1068 | [Product Sales Analysis I](<https://leetcode.com/problems/product-sales-analysis-i>) | Easy | | [solution](<markdowns/_1068. Product Sales Analysis I.md>) | sql |
338339
| 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,
515516
| 2191 | [Sort the Jumbled Numbers](<https://leetcode.com/problems/sort-the-jumbled-numbers>) | Medium | Daily | [solution](<markdowns/_2191. Sort the Jumbled Numbers.md>) | py |
516517
| 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 |
517518
| 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 |
519520
| 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 |
520521
| 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 |
521522
| 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,
623624
| 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 |
624625
| 3163 | [String Compression III](<https://leetcode.com/problems/string-compression-iii>) | Medium | Daily | [solution](<markdowns/_3163. String Compression III.md>) | py |
625626
| 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 |
627628
| 3174 | Biweekly Contest 132 - q1 - [Clear Digits](<https://leetcode.com/problems/clear-digits>) | Easy | Contest, Daily | [solution](<markdowns/_3174. Clear Digits.md>) | py |
628629
| 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 |
629630
| 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,
634635
| 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 |
635636
| 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 |
636637
| 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 |
638639
| 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 |
639640
| 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 |
640641
| 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

Comments
 (0)