File tree
542 files changed
+57811
-35141
lines changed- .github/workflows
- images
- solution
- 0000-0099
- 0001.Two Sum
- 0002.Add Two Numbers
- 0003.Longest Substring Without Repeating Characters
- 0004.Median of Two Sorted Arrays
- 0100-0199
- 0115.Distinct Subsequences
- 0177.Nth Highest Salary
- 0195.Tenth Line
- 0200-0299
- 0245.Shortest Word Distance III
- 0275.H-Index II
- 0300-0399/0317.Shortest Distance from All Buildings
- 0500-0599
- 0581.Shortest Unsorted Continuous Subarray
- 0599.Minimum Index Sum of Two Lists
- 0600-0699
- 0636.Exclusive Time of Functions
- 0689.Maximum Sum of 3 Non-Overlapping Subarrays
- 0700-0799
- 0759.Employee Free Time
- 0781.Rabbits in Forest
- 0790.Domino and Tromino Tiling
- 0799.Champagne Tower
- 0800-0899
- 0802.Find Eventual Safe States
- 0819.Most Common Word
- 0838.Push Dominoes
- 0900-0999/0949.Largest Time for Given Digits
- 1000-1099
- 1007.Minimum Domino Rotations For Equal Row
- 1040.Moving Stones Until Consecutive II
- 1070.Product Sales Analysis III
- 1100-1199
- 1108.Defanging an IP Address
- 1111.Maximum Nesting Depth of Two Valid Parentheses Strings
- 1128.Number of Equivalent Domino Pairs
- 1138.Alphabet Board Path
- 1139.Largest 1-Bordered Square
- 1148.Article Views I
- 1160.Find Words That Can Be Formed by Characters
- 1184.Distance Between Bus Stops
- 1200-1299
- 1238.Circular Permutation in Binary Representation
- 1256.Encode Number
- 1257.Smallest Common Region
- 1295.Find Numbers with Even Number of Digits
- 1300-1399
- 1301.Number of Paths with Max Score
- 1318.Minimum Flips to Make a OR b Equal to c
- 1324.Print Words Vertically
- 1399.Count Largest Group
- 1400-1499
- 1404.Number of Steps to Reduce a Number in Binary Representation to One
- 1418.Display Table of Food Orders in a Restaurant
- 1448.Count Good Nodes in Binary Tree
- 1470.Shuffle the Array
- 1477.Find Two Non-overlapping Sub-arrays Each With Target Sum
- 1481.Least Number of Unique Integers after K Removals
- 1487.Making File Names Unique
- 1500-1599
- 1508.Range Sum of Sorted Subarray Sums
- 1523.Count Odd Numbers in an Interval Range
- 1534.Count Good Triplets
- 1600-1699
- 1617.Count Subtrees With Max Distance Between Cities
- 1618.Maximum Font to Fit a Sentence in a Screen
- 1634.Add Two Polynomials Represented as Linked Lists
- 1649.Create Sorted Array through Instructions
- 1660.Correct a Binary Tree
- 1700-1799
- 1725.Number Of Rectangles That Can Form The Largest Square
- 1746.Maximum Subarray Sum After One Operation
- 1768.Merge Strings Alternately
- 1778.Shortest Path in a Hidden Grid
- 1788.Maximize the Beauty of the Garden
- 1800-1899
- 1801.Number of Orders in the Backlog
- 1803.Count Pairs With XOR in a Range
- 1808.Maximize Number of Nice Divisors
- 1810.Minimum Path Cost in a Hidden Grid
- 1825.Finding MK Average
- 1827.Minimum Operations to Make the Array Increasing
- 1836.Remove Duplicates From an Unsorted Linked List
- 1857.Largest Color Value in a Directed Graph
- 1872.Stone Game VIII
- 1874.Minimize Product Sum of Two Arrays
- 1877.Minimize Maximum Pair Sum in Array
- 1900-1999
- 1911.Maximum Alternating Subsequence Sum
- 1913.Maximum Product Difference Between Two Pairs
- 1914.Cyclically Rotating a Grid
- 1915.Number of Wonderful Substrings
- 1916.Count Ways to Build Rooms in an Ant Colony
- 1962.Remove Stones to Minimize the Total
- 2000-2099
- 2009.Minimum Number of Operations to Make Array Continuous
- 2071.Maximum Number of Tasks You Can Assign
- 2100-2199/2131.Longest Palindrome by Concatenating Two Letter Words
- 2200-2299/2215.Find the Difference of Two Arrays
- 2300-2399
- 2300.Successful Pairs of Spells and Potions
- 2338.Count the Number of Ideal Arrays
- 2357.Make Array Zero by Subtracting Equal Amounts
- 2358.Maximum Number of Groups Entering a Competition
- 2359.Find Closest Node to Given Two Nodes
- 2400-2499/2444.Count Subarrays With Fixed Bounds
- 2600-2699
- 2621.Sleep
- 2672.Number of Adjacent Elements With the Same Color
- 2700-2799/2799.Count Complete Subarrays in an Array
- 2800-2899/2845.Count of Interesting Subarrays
- 2900-2999
- 2900.Longest Unequal Adjacent Groups Subsequence I
- 2901.Longest Unequal Adjacent Groups Subsequence II
- 2942.Find Words Containing Character
- 3300-3399
- 3335.Total Characters in String After Transformations I
- 3337.Total Characters in String After Transformations II
- 3341.Find Minimum Time to Reach Last Room I
- 3342.Find Minimum Time to Reach Last Room II
- 3356.Zero Array Transformation II
- 3362.Zero Array Transformation III
- 3392.Count Subarrays of Length Three With a Condition
- 3400-3499
- 3401.Find Circular Gift Exchange Chains
- 3452.Sum of Good Numbers
- 3477.Fruits Into Baskets II
- 3478.Choose K Elements With Maximum Sum
- 3479.Fruits Into Baskets III
- 3480.Maximize Subarrays After Removing One Conflicting Pair
- 3483.Unique 3-Digit Even Numbers
- 3484.Design Spreadsheet
- 3485.Longest Common Prefix of K Strings After Removal
- 3486.Longest Special Path II
- 3487.Maximum Unique Subarray Sum After Deletion
- 3488.Closest Equal Element Queries
- 3489.Zero Array Transformation IV
- 3490.Count Beautiful Numbers
- 3492.Maximum Containers on a Ship
- 3493.Properties Graph
- 3494.Find the Minimum Amount of Time to Brew Potions
- 3495.Minimum Operations to Make Array Elements Zero
- 3497.Analyze Subscription Conversion
- 3498.Reverse Degree of a String
- 3499.Maximize Active Section with Trade I
- 3500-3599
- 3500.Minimum Cost to Divide Array Into Subarrays
- 3501.Maximize Active Section with Trade II
- 3502.Minimum Cost to Reach Every Position
- 3503.Longest Palindrome After Substring Concatenation I
- 3504.Longest Palindrome After Substring Concatenation II
- 3505.Minimum Operations to Make Elements Within K Subarrays Equal
- 3507.Minimum Pair Removal to Sort Array I
- 3508.Implement Router
- 3509.Maximum Product of Subsequences With an Alternating Sum Equal to K
- 3510.Minimum Pair Removal to Sort Array II
- 3512.Minimum Operations to Make Array Sum Divisible by K
- 3513.Number of Unique XOR Triplets I
- 3514.Number of Unique XOR Triplets II
- 3515.Shortest Path in a Weighted Tree
- 3516.Find Closest Person
- 3517.Smallest Palindromic Rearrangement I
- 3518.Smallest Palindromic Rearrangement II
- 3519.Count Numbers with Non-Decreasing Digits
- 3520.Minimum Threshold for Inversion Pairs Count
- 3522.Calculate Score After Performing Instructions
- 3523.Make Array Non-decreasing
- 3524.Find X Value of Array I
- 3525.Find X Value of Array II
- 3526.Range XOR Queries with Subarray Reversals
- 3527.Find the Most Common Response
- 3528.Unit Conversion I
- images
- 3529.Count Cells in Overlapping Horizontal and Vertical Substrings
- images
- 3530.Maximum Profit from Valid Topological Order in DAG
- images
- 3531.Count Covered Buildings
- images
- 3532.Path Existence Queries in a Graph I
- images
- 3533.Concatenated Divisibility
- 3534.Path Existence Queries in a Graph II
- images
- 3535.Unit Conversion II
- images
- 3536.Maximum Product of Two Digits
- 3537.Fill a Special Grid
- images
- 3538.Merge Operations for Minimum Travel Time
- 3539.Find Sum of Array Product of Magical Sequences
- 3540.Minimum Time to Visit All Houses
- 3541.Find Most Frequent Vowel and Consonant
- 3542.Minimum Operations to Convert All Elements to Zero
- 3543.Maximum Weighted K-Edge Path
- images
- 3544.Subtree Inversion Sum
- images
- 3545.Minimum Deletions for At Most K Distinct Characters
- 3546.Equal Sum Grid Partition I
- images
- 3547.Maximum Sum of Edge Values in a Graph
- images
- 3548.Equal Sum Grid Partition II
- images
- 3549.Multiply Two Polynomials
- 3550.Smallest Index With Digit Sum Equal to Index
- 3551.Minimum Swaps to Sort by Digit Sum
- 3552.Grid Teleportation Traversal
- images
- 3553.Minimum Weighted Subgraph With the Required Paths II
- 3554.Find Category Recommendation Pairs
- 3555.Smallest Subarray to Sort in Every Sliding Window
- 3556.Sum of Largest Prime Substrings
- 3557.Find Maximum Number of Non Intersecting Substrings
- 3558.Number of Ways to Assign Edge Weights I
- images
- 3559.Number of Ways to Assign Edge Weights II
- images
- 3560.Find Minimum Log Transportation Cost
- 3561.Resulting String After Adjacent Removals
- 3562.Maximum Profit from Trading Stocks with Discounts
- images
- 3563.Lexicographically Smallest String After Adjacent Removals
Some content is hidden
Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.
542 files changed
+57811
-35141
lines changedLines changed: 82 additions & 49 deletions
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 | 3 |
| |
| 4 | + | |
4 | 5 |
| |
5 | 6 |
| |
6 | 7 |
| |
| |||
12 | 13 |
| |
13 | 14 |
| |
14 | 15 |
| |
15 |
| - | |
16 |
| - | |
17 |
| - | |
18 |
| - | |
19 |
| - | |
20 |
| - | |
21 |
| - | |
22 | 16 |
| |
23 | 17 |
| |
24 |
| - | |
| 18 | + | |
25 | 19 |
| |
26 | 20 |
| |
27 | 21 |
| |
28 |
| - | |
| 22 | + | |
29 | 23 |
| |
30 |
| - | |
31 | 24 |
| |
32 |
| - | |
33 |
| - | |
| 25 | + | |
| 26 | + | |
| 27 | + | |
| 28 | + | |
| 29 | + | |
| 30 | + | |
| 31 | + | |
34 | 32 |
| |
35 | 33 |
| |
36 | 34 |
| |
37 |
| - | |
38 |
| - | |
| 35 | + | |
| 36 | + | |
| 37 | + | |
| 38 | + | |
| 39 | + | |
| 40 | + | |
39 | 41 |
| |
40 | 42 |
| |
| 43 | + | |
41 | 44 |
| |
42 | 45 |
| |
43 |
| - | |
44 |
| - | |
| 46 | + | |
| 47 | + | |
45 | 48 |
| |
46 |
| - | |
| 49 | + | |
| 50 | + | |
47 | 51 |
| |
48 | 52 |
| |
49 | 53 |
| |
50 |
| - | |
| 54 | + | |
| 55 | + | |
| 56 | + | |
| 57 | + | |
| 58 | + | |
| 59 | + | |
| 60 | + | |
51 | 61 |
| |
52 |
| - | |
| 62 | + | |
| 63 | + | |
53 | 64 |
| |
54 |
| - | |
55 | 65 |
| |
| 66 | + | |
56 | 67 |
| |
57 | 68 |
| |
58 |
| - | |
| 69 | + | |
59 | 70 |
| |
60 | 71 |
| |
61 | 72 |
| |
62 | 73 |
| |
63 | 74 |
| |
64 |
| - | |
| 75 | + | |
| 76 | + | |
| 77 | + | |
| 78 | + | |
65 | 79 |
| |
66 |
| - | |
| 80 | + | |
| 81 | + | |
67 | 82 |
| |
68 | 83 |
| |
69 | 84 |
| |
70 | 85 |
| |
71 |
| - | |
72 |
| - | |
| 86 | + | |
| 87 | + | |
| 88 | + | |
| 89 | + | |
| 90 | + | |
| 91 | + | |
| 92 | + | |
| 93 | + | |
| 94 | + | |
| 95 | + | |
| 96 | + | |
| 97 | + | |
| 98 | + | |
| 99 | + | |
| 100 | + | |
| 101 | + | |
| 102 | + | |
| 103 | + | |
| 104 | + | |
| 105 | + | |
| 106 | + | |
| 107 | + | |
| 108 | + | |
| 109 | + | |
| 110 | + | |
| 111 | + | |
| 112 | + | |
| 113 | + | |
| 114 | + | |
73 | 115 |
| |
74 |
| - | |
75 |
| - | |
76 |
| - | |
77 |
| - | |
78 |
| - | |
79 |
| - | |
80 |
| - | |
81 |
| - | |
82 |
| - | |
83 |
| - | |
84 |
| - | |
85 |
| - | |
86 |
| - | |
87 |
| - | |
88 |
| - | |
89 |
| - | |
90 |
| - | |
91 |
| - | |
92 |
| - | |
93 |
| - | |
94 |
| - | |
95 |
| - | |
96 |
| - | |
97 |
| - | |
| 116 | + | |
| 117 | + | |
| 118 | + | |
| 119 | + | |
| 120 | + | |
| 121 | + | |
| 122 | + | |
| 123 | + | |
| 124 | + | |
| 125 | + | |
| 126 | + | |
| 127 | + | |
| 128 | + | |
| 129 | + | |
| 130 | + |
Lines changed: 25 additions & 0 deletions
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
| 1 | + | |
| 2 | + | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
| 6 | + | |
| 7 | + | |
| 8 | + | |
| 9 | + | |
| 10 | + | |
| 11 | + | |
| 12 | + | |
| 13 | + | |
| 14 | + | |
| 15 | + | |
| 16 | + | |
| 17 | + | |
| 18 | + | |
| 19 | + | |
| 20 | + | |
| 21 | + | |
| 22 | + | |
| 23 | + | |
| 24 | + | |
| 25 | + |
Lines changed: 4 additions & 1 deletion
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
3 | 3 |
| |
4 | 4 |
| |
5 | 5 |
| |
6 |
| - | |
7 | 6 |
| |
8 | 7 |
| |
9 | 8 |
| |
10 | 9 |
| |
11 | 10 |
| |
12 | 11 |
| |
| 12 | + | |
| 13 | + | |
| 14 | + | |
| 15 | + |
Lines changed: 2 additions & 1 deletion
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
9 | 9 |
| |
10 | 10 |
| |
11 | 11 |
| |
12 |
| - | |
| 12 | + | |
| 13 | + | |
13 | 14 |
| |
14 | 15 |
| |
15 | 16 |
| |
|
Lines changed: 2 additions & 1 deletion
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
9 | 9 |
| |
10 | 10 |
| |
11 | 11 |
| |
12 |
| - | |
| 12 | + | |
| 13 | + | |
13 | 14 |
| |
14 | 15 |
| |
15 | 16 |
| |
|
0 commit comments