Skip to content

Commit

Permalink
Updated markdown files
Browse files Browse the repository at this point in the history
  • Loading branch information
Zanger67/leetcode authored and Zanger67/leetcode committed Jul 27, 2024
1 parent 37107ae commit 931e48a
Show file tree
Hide file tree
Showing 46 changed files with 2,879 additions and 2,860 deletions.
2 changes: 1 addition & 1 deletion .readme_updater
934 changes: 468 additions & 466 deletions README.md

Large diffs are not rendered by default.

110 changes: 55 additions & 55 deletions markdowns/Daily_Questions.md

Large diffs are not rendered by default.

30 changes: 15 additions & 15 deletions markdowns/Easy.md

Large diffs are not rendered by default.

14 changes: 7 additions & 7 deletions markdowns/Hard.md
Original file line number Diff line number Diff line change
Expand Up @@ -15,21 +15,21 @@
| 239 | [Sliding Window Maximum](<https://leetcode.com/problems/sliding-window-maximum>) | Hard | N150 | [solution](<_239. Sliding Window Maximum.md>) | py | Jun 04, 2024 |
| 272 | [Closest Binary Search Tree Value II](<https://leetcode.com/problems/closest-binary-search-tree-value-ii>) | Hard | | [solution](<_272. Closest Binary Search Tree Value II.md>) | py | Jul 01, 2024 |
| 273 | [Integer to English Words](<https://leetcode.com/problems/integer-to-english-words>) | Hard | | [solution](<_273. Integer to English Words.md>) | py | Jun 11, 2024 |
| 330 | [Patching Array](<https://leetcode.com/problems/patching-array>) | Hard | | [solution](<_330. Patching Array.md>) | py | Jun 16, 2024 |
| 330 | [Patching Array](<https://leetcode.com/problems/patching-array>) | Hard | Daily | [solution](<_330. Patching Array.md>) | py | Jun 16, 2024 |
| 381 | [Insert Delete GetRandom O(1) - Duplicates allowed](<https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed>) | Hard | | [solution](<_381. Insert Delete GetRandom O(1) - Duplicates allowed.md>) | java | Jul 06, 2024 |
| 431 | [Encode N-ary Tree to Binary Tree](<https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree>) | Hard | | [solution](<_431. Encode N-ary Tree to Binary Tree.md>) | java, py | Jun 28, 2024 |
| 502 | [IPO](<https://leetcode.com/problems/ipo>) | Hard | | [solution](<_502. IPO.md>) | py | Jun 15, 2024 |
| 726 | [Number of Atoms](<https://leetcode.com/problems/number-of-atoms>) | Hard | | [solution](<_726. Number of Atoms.md>) | py | Jul 14, 2024 |
| 502 | [IPO](<https://leetcode.com/problems/ipo>) | Hard | Daily | [solution](<_502. IPO.md>) | py | Jun 15, 2024 |
| 726 | [Number of Atoms](<https://leetcode.com/problems/number-of-atoms>) | Hard | Daily | [solution](<_726. Number of Atoms.md>) | py | Jul 14, 2024 |
| 895 | [Maximum Frequency Stack](<https://leetcode.com/problems/maximum-frequency-stack>) | Hard | | [solution](<_895. Maximum Frequency Stack.md>) | java, py | Jul 11, 2024 |
| 987 | [Vertical Order Traversal of a Binary Tree](<https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree>) | Hard | | [solution](<_987. Vertical Order Traversal of a Binary Tree.md>) | py | Jun 12, 2024 |
| 995 | [Minimum Number of K Consecutive Bit Flips](<https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips>) | Hard | | [solution](<_995. Minimum Number of K Consecutive Bit Flips.md>) | c, py | Jun 24, 2024 |
| 995 | [Minimum Number of K Consecutive Bit Flips](<https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips>) | Hard | Daily | [solution](<_995. Minimum Number of K Consecutive Bit Flips.md>) | c, py | Jun 24, 2024 |
| 1028 | [Recover a Tree From Preorder Traversal](<https://leetcode.com/problems/recover-a-tree-from-preorder-traversal>) | Hard | | [solution](<_1028. Recover a Tree From Preorder Traversal.md>) | py | Jul 01, 2024 |
| 1255 | [Maximum Score Words Formed by Letters](<https://leetcode.com/problems/maximum-score-words-formed-by-letters>) | Hard | | [solution](<_1255. Maximum Score Words Formed by Letters.md>) | py | Jun 15, 2024 |
| 1284 | [Minimum Number of Flips to Convert Binary Matrix to Zero Matrix](<https://leetcode.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix>) | Hard | | [solution](<_1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix.md>) | py | Jun 09, 2024 |
| 1579 | [Remove Max Number of Edges to Keep Graph Fully Traversable](<https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable>) | Hard | | [solution](<_1579. Remove Max Number of Edges to Keep Graph Fully Traversable.md>) | py | Jun 30, 2024 |
| 1579 | [Remove Max Number of Edges to Keep Graph Fully Traversable](<https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable>) | Hard | Daily | [solution](<_1579. Remove Max Number of Edges to Keep Graph Fully Traversable.md>) | py | Jun 30, 2024 |
| 2258 | [Escape the Spreading Fire](<https://leetcode.com/problems/escape-the-spreading-fire>) | Hard | | [solution](<_2258. Escape the Spreading Fire.md>) | py | Jun 15, 2024 |
| 2392 | [Build a Matrix With Conditions](<https://leetcode.com/problems/build-a-matrix-with-conditions>) | Hard | | [solution](<_2392. Build a Matrix With Conditions.md>) | py | Jul 21, 2024 |
| 2751 | [Robot Collisions](<https://leetcode.com/problems/robot-collisions>) | Hard | | [solution](<_2751. Robot Collisions.md>) | py | Jul 13, 2024 |
| 2392 | [Build a Matrix With Conditions](<https://leetcode.com/problems/build-a-matrix-with-conditions>) | Hard | Daily | [solution](<_2392. Build a Matrix With Conditions.md>) | py | Jul 21, 2024 |
| 2751 | [Robot Collisions](<https://leetcode.com/problems/robot-collisions>) | Hard | Daily | [solution](<_2751. Robot Collisions.md>) | py | Jul 13, 2024 |
| 2954 | [Count the Number of Infection Sequences](<https://leetcode.com/problems/count-the-number-of-infection-sequences>) | Hard | | [solution](<_2954. Count the Number of Infection Sequences.md>) | py | Jun 26, 2024 |
| 3045 | [Count Prefix and Suffix Pairs II](<https://leetcode.com/problems/count-prefix-and-suffix-pairs-ii>) | Hard | | [solution](<_3045. Count Prefix and Suffix Pairs II.md>) | py | Jun 29, 2024 |
| 3213 | Weekly Contest 405 - q4 - [Construct String with Minimum Cost](<https://leetcode.com/problems/construct-string-with-minimum-cost>) | Hard | Contest | [solution](<_3213. Construct String with Minimum Cost.md>) | py | Jul 07, 2024 |
Expand Down
Loading

0 comments on commit 931e48a

Please sign in to comment.