File tree
911 files changed
+81888
-34895
lines changed- images
- solution
- 0000-0099
- 0002.Add Two Numbers
- 0005.Longest Palindromic Substring
- 0006.Zigzag Conversion
- 0008.String to Integer (atoi)
- 0009.Palindrome Number
- 0010.Regular Expression Matching
- 0011.Container With Most Water
- 0012.Integer to Roman
- 0013.Roman to Integer
- 0014.Longest Common Prefix
- 0015.3Sum
- 0016.3Sum Closest
- 0017.Letter Combinations of a Phone Number
- 0023.Merge k Sorted Lists
- 0049.Group Anagrams
- 0066.Plus One
- 0100-0199
- 0134.Gas Station
- 0135.Candy
- 0147.Insertion Sort List
- 0200-0299
- 0228.Summary Ranges
- 0250.Count Univalue Subtrees
- 0262.Trips and Users
- 0269.Alien Dictionary
- 0281.Zigzag Iterator
- 0282.Expression Add Operators
- 0300-0399/0328.Odd Even Linked List
- 0400-0499
- 0405.Convert a Number to Hexadecimal
- 0412.Fizz Buzz
- 0418.Sentence Screen Fitting
- 0440.K-th Smallest in Lexicographical Order
- 0500-0599
- 0504.Base 7
- 0506.Relative Ranks
- 0520.Detect Capital
- 0550.Game Play Analysis IV
- 0594.Longest Harmonious Subsequence
- 0596.Classes With at Least 5 Students
- 0600-0699
- 0630.Course Schedule III
- 0684.Redundant Connection
- 0689.Maximum Sum of 3 Non-Overlapping Subarrays
- 0700-0799
- 0704.Binary Search
- 0720.Longest Word in Dictionary
- 0797.All Paths From Source to Target
- 0800-0899
- 0853.Car Fleet
- 0871.Minimum Number of Refueling Stops
- 0873.Length of Longest Fibonacci Subsequence
- 0883.Projection Area of 3D Shapes
- 0900-0999
- 0909.Snakes and Ladders
- 0912.Sort an Array
- 0923.3Sum With Multiplicity
- 0973.K Closest Points to Origin
- 0975.Odd Even Jump
- 1000-1099
- 1016.Binary String With Substrings Representing 1 To N
- 1046.Last Stone Weight
- 1061.Lexicographically Smallest Equivalent String
- 1062.Longest Repeating Substring
- 1065.Index Pairs of a String
- 1070.Product Sales Analysis III
- 1100-1199
- 1152.Analyze User Website Visit Pattern
- 1153.String Transforms Into Another String
- 1164.Product Price at a Given Date
- 1200-1299
- 1233.Remove Sub-Folders from the Filesystem
- 1236.Web Crawler
- 1290.Convert Binary Number in a Linked List to Integer
- 1298.Maximum Candies You Can Get from Boxes
- 1300-1399
- 1334.Find the City With the Smallest Number of Neighbors at a Threshold Distance
- 1340.Jump Game V
- 1353.Maximum Number of Events That Can Be Attended
- 1354.Construct Target Array With Multiple Sums
- 1375.Number of Times Binary String Is Prefix-Aligned
- 1394.Find Lucky Integer in an Array
- 1400-1499
- 1412.Find the Quiet Students in All Exams
- 1432.Max Difference You Can Get From Changing an Integer
- 1441.Build an Array With Stack Operations
- 1498.Number of Subsequences That Satisfy the Given Sum Condition
- 1500-1599
- 1517.Find Users With Valid E-Mails
- 1563.Stone Game V
- 1600-1699/1645.Hopper Company Queries II
- 1700-1799
- 1707.Maximum XOR With an Element From Array
- 1751.Maximum Number of Events That Can Be Attended II
- 1761.Minimum Degree of a Connected Trio in a Graph
- 1782.Count Pairs Of Nodes
- 1800-1899
- 1802.Maximum Value at a Given Index in a Bounded Array
- 1849.Splitting a String Into Descending Consecutive Values
- 1857.Largest Color Value in a Directed Graph
- 1858.Longest Word With All Prefixes
- 1865.Finding Pairs With a Certain Sum
- 1888.Minimum Number of Flips to Make the Binary String Alternating
- 1900-1999
- 1900.The Earliest and Latest Rounds Where Players Compete
- 1962.Remove Stones to Minimize the Total
- 2000-2099
- 2014.Longest Subsequence Repeated k Times
- 2040.Kth Smallest Product of Two Sorted Arrays
- 2081.Sum of k-Mirror Numbers
- 2099.Find Subsequence of Length K With the Largest Sum
- 2100-2199
- 2143.Choose Numbers From Two Arrays in Range
- 2163.Minimum Difference in Sums After Removal of Elements
- 2200-2299
- 2200.Find All K-Distant Indices in an Array
- 2294.Partition Array Such That Maximum Difference Is K
- 2300-2399
- 2311.Longest Binary Subsequence Less Than or Equal to K
- 2322.Minimum Score After Removals on a Tree
- 2359.Find Closest Node to Given Two Nodes
- 2398.Maximum Number of Robots Within Budget
- 2400-2499
- 2410.Maximum Matching of Players With Trainers
- 2418.Sort the People
- 2424.Longest Uploaded Prefix
- 2434.Using a Robot to Print the Lexicographically Smallest String
- 2445.Number of Nodes With Value One
- 2500-2599
- 2505.Bitwise OR of All Subsequence Sums
- 2519.Count the Number of K-Big Indices
- 2560.House Robber IV
- 2566.Maximum Difference by Remapping a Digit
- 2588.Count the Number of Beautiful Subarrays
- 2593.Find Score of an Array After Marking All Elements
- 2600-2699
- 2611.Mice and Cheese
- 2614.Prime In Diagonal
- 2616.Minimize the Maximum Difference of Pairs
- 2677.Chunk Array
- 2800-2899
- 2856.Minimum Array Length After Pair Removals
- 2894.Divisible and Non-divisible Sums Difference
- 2900-2999
- 2922.Market Analysis III
- 2929.Distribute Candies Among Children II
- 2948.Make Lexicographically Smallest Array by Swapping Elements
- 2966.Divide Array Into Arrays With Max Difference
- 2967.Minimum Cost to Make Array Equalindromic
- 3000-3099/3085.Minimum Deletions to Make String K-Special
- 3100-3199
- 3136.Valid Word
- 3167.Better Compression of String
- 3169.Count Days Without Meetings
- 3170.Lexicographically Minimum String After Removing Stars
- 3200-3299
- 3201.Find the Maximum Length of Valid Subsequence I
- 3202.Find the Maximum Length of Valid Subsequence II
- 3203.Find Minimum Diameter After Merging Two Trees
- 3238.Find the Number of Winning Players
- 3300-3399
- 3304.Find the K-th Character in String Game I
- 3307.Find the K-th Character in String Game II
- 3330.Find the Original Typed String I
- 3333.Find the Original Typed String II
- 3357.Minimize the Maximum Adjacent Element Difference
- 3372.Maximize the Number of Target Nodes After Connecting Trees I
- 3373.Maximize the Number of Target Nodes After Connecting Trees II
- 3390.Longest Team Pass Streak
- 3400-3499
- 3403.Find the Lexicographically Largest String From the Box I
- 3405.Count the Number of Arrays with K Matching Adjacent Elements
- 3406.Find the Lexicographically Largest String From the Box II
- 3423.Maximum Difference Between Adjacent Elements in a Circular Array
- 3424.Minimum Cost to Make Arrays Identical
- 3439.Reschedule Meetings for Maximum Free Time I
- 3440.Reschedule Meetings for Maximum Free Time II
- 3442.Maximum Difference Between Even and Odd Frequency I
- 3443.Maximum Manhattan Distance After K Changes
- 3445.Maximum Difference Between Even and Odd Frequency II
- 3488.Closest Equal Element Queries
- 3500-3599
- 3506.Find Time Required to Eliminate Bacterial Strains II
- 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
- 3527.Find the Most Common Response
- 3528.Unit Conversion I
- 3529.Count Cells in Overlapping Horizontal and Vertical Substrings
- 3530.Maximum Profit from Valid Topological Order in DAG
- 3531.Count Covered Buildings
- 3532.Path Existence Queries in a Graph I
- 3533.Concatenated Divisibility
- 3534.Path Existence Queries in a Graph II
- 3536.Maximum Product of Two Digits
- 3537.Fill a Special Grid
- 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
- 3544.Subtree Inversion Sum
- 3545.Minimum Deletions for At Most K Distinct Characters
- 3546.Equal Sum Grid Partition I
- 3547.Maximum Sum of Edge Values in a Graph
- 3548.Equal Sum Grid Partition II
- 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
- 3553.Minimum Weighted Subgraph With the Required Paths II
- 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
- 3559.Number of Ways to Assign Edge Weights II
- 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
- 3564.Seasonal Sales Analysis
- 3565.Sequential Grid Path Cover
- images
- 3566.Partition Array into Two Equal Product Subsets
- 3567.Minimum Absolute Difference in Sliding Submatrix
- 3568.Minimum Moves to Clean the Classroom
- 3569.Maximize Count of Distinct Primes After Split
- 3570.Find Books with No Available Copies
- 3571.Find the Shortest Superstring II
- 3572.Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values
- 3573.Best Time to Buy and Sell Stock V
- 3574.Maximize Subarray GCD Score
- 3575.Maximum Good Subtree Score
- images
- 3576.Transform Array to All Equal Elements
- 3577.Count the Number of Computer Unlocking Permutations
- 3578.Count Partitions With Max-Min Difference at Most K
- 3579.Minimum Steps to Convert String with Operations
- 3580.Find Consistently Improving Employees
- 3581.Count Odd Letters from Number
- 3582.Generate Tag for Video Caption
- 3583.Count Special Triplets
- 3584.Maximum Product of First and Last Elements of a Subsequence
- 3585.Find Weighted Median Node in Tree
- images
- 3586.Find COVID Recovery Patients
- 3587.Minimum Adjacent Swaps to Alternate Parity
- 3588.Find Maximum Area of a Triangle
- 3589.Count Prime-Gap Balanced Subarrays
- 3590.Kth Smallest Path XOR Sum
- images
- 3591.Check if Any Element Has Prime Frequency
- 3592.Inverse Coin Change
- 3593.Minimum Increments to Equalize Leaf Paths
- images
- 3594.Minimum Time to Transport All Individuals
- 3595.Once Twice
- 3596.Minimum Cost Path with Alternating Directions I
- 3597.Partition String
- 3598.Longest Common Prefix Between Adjacent Strings After Removals
- 3599.Partition Array to Minimize XOR
- 3600-3699
- 3600.Maximize Spanning Tree Stability with Upgrades
- 3601.Find Drivers with Improved Fuel Efficiency
- 3602.Hexadecimal and Hexatrigesimal Conversion
- 3603.Minimum Cost Path with Alternating Directions II
- 3604.Minimum Time to Reach Destination in Directed Graph
- images
- 3605.Minimum Stability Factor of Array
- 3606.Coupon Code Validator
- 3607.Power Grid Maintenance
- images
- 3608.Minimum Time for K Connected Components
- images
- 3609.Minimum Moves to Reach Target in Grid
- 3610.Minimum Number of Primes to Sum to Target
- 3611.Find Overbooked Employees
- 3612.Process String with Special Operations I
- 3613.Minimize Maximum Component Cost
- images
- 3614.Process String with Special Operations II
- 3615.Longest Palindromic Path in Graph
- images
- 3616.Number of Student Replacements
- 3617.Find Students with Study Spiral Pattern
Some content is hidden
Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.
911 files changed
+81888
-34895
lines changedLines changed: 8 additions & 25 deletions
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
21 | 21 |
| |
22 | 22 |
| |
23 | 23 |
| |
24 |
| - | |
| 24 | + | |
25 | 25 |
| |
26 | 26 |
| |
27 | 27 |
| |
| |||
190 | 190 |
| |
191 | 191 |
| |
192 | 192 |
| |
193 |
| - | |
| 193 | + | |
194 | 194 |
| |
195 | 195 |
| |
196 |
| - | |
197 |
| - | |
198 |
| - | |
199 |
| - | |
200 |
| - | |
201 |
| - | |
202 |
| - | |
203 |
| - | |
204 |
| - | |
205 |
| - | |
| 196 | + | |
206 | 197 |
| |
207 | 198 |
| |
208 | 199 |
| |
| |||
224 | 215 |
| |
225 | 216 |
| |
226 | 217 |
| |
227 |
| - | |
228 |
| - | |
229 |
| - | |
230 |
| - | |
231 |
| - | |
232 |
| - | |
233 |
| - | |
234 |
| - | |
235 |
| - | |
236 |
| - | |
237 | 218 |
| |
238 | 219 |
| |
239 | 220 |
| |
240 | 221 |
| |
241 |
| - | |
| 222 | + | |
242 | 223 |
| |
243 | 224 |
| |
244 | 225 |
| |
245 |
| - | |
246 |
| - | |
| 226 | + | |
| 227 | + | |
| 228 | + | |
| 229 | + | |
247 | 230 |
| |
248 | 231 |
| |
249 | 232 |
| |
|
Lines changed: 6 additions & 20 deletions
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
185 | 185 |
| |
186 | 186 |
| |
187 | 187 |
| |
188 |
| - | |
189 |
| - | |
190 |
| - | |
191 |
| - | |
192 |
| - | |
193 |
| - | |
194 |
| - | |
195 |
| - | |
196 |
| - | |
197 |
| - | |
| 188 | + | |
198 | 189 |
| |
199 | 190 |
| |
200 | 191 |
| |
| |||
216 | 207 |
| |
217 | 208 |
| |
218 | 209 |
| |
219 |
| - | |
220 |
| - | |
221 |
| - | |
222 |
| - | |
223 |
| - | |
224 |
| - | |
225 |
| - | |
226 |
| - | |
227 |
| - | |
228 |
| - | |
229 | 210 |
| |
230 | 211 |
| |
231 | 212 |
| |
232 | 213 |
| |
| 214 | + | |
| 215 | + | |
| 216 | + | |
| 217 | + | |
| 218 | + | |
233 | 219 |
| |
234 | 220 |
| |
235 | 221 |
| |
|
Lines changed: 1 addition & 0 deletions
Loading
Lines changed: 1 addition & 0 deletions
Loading
0 commit comments