Directories ¶ Show internal Expand all Path Synopsis 0001-Two-Sum 0002-Add-Two-Numbers 0003-Longest-Substring-Without-Repeating-Characters 0004-Median-of-Two-Sorted-Arrays 0009-Palindrome-Number 0012-Integer-to-Roman 0013-Roman-to-Integer 0027-Remove-Element 0032-Longest-Valid-Parentheses 0061-Rotate-List 0075-Sort-Colors 0101-Symmetric-Tree 0107-Binary-Tree-Level-Order-Traversal-II 0111-Minimum-Depth-of-Binary-Tree 0112-Path-Sum 0113-Path-Sum-II 0121-Best-Time-to-Buy-and-Sell-Stock 0124-Binary-Tree-Maximum-Path-Sum 0125-Valid-Palindrome 0224-Basic-Calculator 0515-Find-Largest-Value-in-Each-Tree-Row 0684-Redundant-Connection 0769-Max-Chunks-To-Make-Sorted 0802-Find-Eventual-Safe-States 0827-Making-A-Large-Island 0916-Word-Subsets 0965-Univalued-Binary-Tree 1014-Best-Sightseeing-Pair 1267-Count-Servers-that-Communicate 1346-Check-If-N-and-Its-Double-Exist 1352-Product-of-the-Last-K-Numbers 1368-Minimum-Cost-to-Make-at-Least-One-Valid-Path-in-a-Grid 1400-Construct-K-Palindrome-Strings 1408-String-Matching-in-an-Array 1422-Maximum-Score-After-Splitting-a-String 1455-Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence 1462-Course-Schedule-IV 1475-Final-Prices-With-a-Special-Discount-in-a-Shop 1574-Shortest-Subarray-to-be-Removed-to-Make-Array-Sorted 1652-Defuse-the-Bomb 1726-Tuple-with-Same-Product 1752-Check-if-Array-Is-Sorted-and-Rotated 1760-Minimum-Limit-of-Balls-in-a-Bag 1765-Map-of-Highest-Peak 1769-Minimum-Number-of-Operations-to-Move-All-Balls-to-Each-Box 1790-Check-if-One-String-Swap-Can-Make-Strings-Equal 1792-Maximum-Average-Pass-Ratio 1800-Maximum-Ascending-Subarray-Sum 1910-Remove-All-Occurrences-of-a-Substring 1930-Unique-Length-3-Palindromic-Subsequences 2017-Grid-Game 2064-Minimized-Maximum-of-Products-Distributed-to-Any-Store 2070-Most-Beautiful-Item-for-Each-Query 2109-Adding-Spaces-to-a-String 2116-Check-if-a-Parentheses-String-Can-Be-Valid 2182-Construct-String-With-Repeat-Limit 2185-Counting-Words-With-a-Given-Prefix 2270-Number-of-Ways-to-Split-Array 2337-Move-Pieces-to-Obtain-a-String 2342-Max-Sum-of-a-Pair-With-Equal-Sum-of-Digits 2349-Design-a-Number-Container-System 2364-Count-Number-of-Bad-Pairs 2381-Shifting-Letters-II 2415-Reverse-Odd-Levels-of-Binary-Tree 2425-Bitwise-XOR-of-All-Pairings 2429-Minimize-XOR 2458-Height-of-Binary-Tree-After-Subtree-Removal-Queries 2471-Minimum-Number-of-Operations-to-Sort-a-Binary-Tree-by-Level 2554-Maximum-Number-of-Integers-to-Choose-From-a-Range-I 2558-Take-Gifts-From-the-Richest-Pile 2559-Count-Vowel-Strings-in-Ranges 2593-Find-Score-of-an-Array-After-Marking-All-Elements 2601-Prime-Subtraction-Operation 2657-Find-the-Prefix-Common-Array-of-Two-Arrays 2658-Maximum-Number-of-Fish-in-a-Grid 2661-First-Completely-Painted-Row-or-Column 2683-Neighboring-Bitwise-XOR 2779-Maximum-Beauty-of-an-Array-After-Applying-Operation 2825-Make-String-a-Subsequence-Using-Cyclic-Increments 2872-Maximum-Number-of-K-Divisible-Components 2948-Make-Lexicographically-Smallest-Array-by-Swapping-Elements 2981-Find-Longest-Special-Substring-That-Occurs-Thrice-I 3042-Count-Prefix-and-Suffix-Pairs-I 3066-Minimum-Operations-to-Exceed-Threshold-Value-II 3097-Shortest-Subarray-With-OR-at-Least-K-II 3105-Longest-Strictly-Increasing-or-Strictly-Decreasing-Subarray 3151-Special-Array-I 3152-Special-Array-II 3160-Find-the-Number-of-Distinct-Colors-Among-the-Balls 3174-Clear-Digits 3223-Minimum-Length-of-String-After-Operations 3254-Find-the-Power-of-K-Size-Subarrays-I 3264-Final-Array-State-After-K-Multiplication-Operations-I Click to show internal directories. Click to hide internal directories.