~/leetcode$ls--sort=solved
77 solutions shown
No solutions match the current search and filters.
- 3550> Smallest Index With Digit Sum Equal to IndexEasy
- 1658> Minimum Operations to Reduce X to ZeroMedium
- 3525> Find X Value of Array IIHard
- 3524> Find X Value of Array IMedium
- 3498> Reverse Degree of a StringEasy
- 1401> Circle and Rectangle OverlappingMedium
- 1520> Maximum Number of Non-Overlapping SubstringsHard
- 1477> Find Two Non-overlapping Sub-arrays Each With Target SumMedium
- _150> Evaluate-Reverse-Polish-NotationMedium
- _155> Min-StackMedium
- __20> Valid-ParenthesesEasy
- _239> Sliding Window MaximumHard
- __76> Minimum-Window-SubstringHard
- _567> Permutation-In-StringMedium
- _424> Longest-Repeating-Character-ReplacementMedium
- ___3> Longest-Substring-Without-Repeating-CharactersMedium
- _121> Best-Time-To-Buy-And-Sell-StockEasy
- __42> Trapping-Rain-WaterHard
- __11> Container-With-Most-WaterMedium
- __15> 3-SumMedium
- _167> Two-Sum-II-Input-Array-Is-SortedMedium
- _125> Valid PalindromeEasy
- _128> Longest-Consecutive-SequenceMedium
- __36> Valid-SudokuMedium
- _238> Product-Of-Array-Except-SelfMedium
- _347> Top-K-Frequent-ElementsMedium
- __49> Group-AnagramsMedium
- ___1> Two-SumEasy
- _242> Valid-AnagramEasy
- _217> Contains-DuplicateEasy
- 3343> Count-Number-Of-Balanced-PermutationsHard
- 3342> Find-Minimum-Time-To-Reach-Last-Room-IIMedium
- 3341> Find-Minimum-Time-To-Reach-Last-Room-IMedium
- 1920> Build-Array-From-PermutationEasy
- _790> Domino-And-Tromino-TilingMedium
- 1128> Number-Of-Equivalent-Domino-PairsEasy
- 1007> Minimum-Domino-Rotations-For-Equal-RowMedium
- _838> Push-DominoesMedium
- 2071> Maximum-Number-Of-Tasks-You-Can-AssignHard
- 1295> Find-Numbers-With-Even-Number-Of-DigitsEasy
- 2962> Count-Subarrays-Where-Max-Element-Appears-At-Least-K-TimesMedium
- 2302> Count-Subarrays-With-Score-Less-Than-KHard
- 3392> Count-Subarrays-Of-Length-Three-With-A-ConditionEasy
- 2444> Count-Subarrays-With-Fixed-BoundsHard
- 2845> Count-Of-Interesting-SubarraysMedium
- 2799> Count-Complete-Subarrays-In-An-ArrayMedium
- 1399> Count-Largest-GroupEasy
- 2338> Count-The-Number-Of-Ideal-ArraysHard
- 2145> Count-The-Hidden-SequencesMedium
- _781> Rabbits-In-ForestMedium
- 2563> Count-The-Number-Of-Fair-PairsMedium
- __38> Count-And-SayMedium
- 2176> Count-Equal-And-Divisible-Pairs-In-An-ArrayEasy
- 2537> Count-The-Number-Of-Good-SubarraysMedium
- 2179> Count-Good-Triplets-In-An-ArrayHard
- 1534> Count-Good-TripletsEasy
- 1922> Count-Good-NumbersMedium
- 3272> Find-The-Count-Of-Good-IntegersHard
- 2843> Count-Symmetric-IntegersEasy
- 2999> Count-The-Number-Of-Powerful-IntegersHard
- 3375> Minimum-Operations-To-Make-Array-Values-Equal-To-KEasy
- 3396> Minimum-Number-Of-Operations-To-Make-Elements-In-Array-DistinctEasy
- _416> Partition-Equal-Subset-SumMedium
- _368> Largest-Divisible-SubsetMedium
- 1863> Sum-Of-All-Subset-Xor-TotalsEasy
- 1123> Lowest-Common-Ancestor-Of-Deepest-LeavesMedium
- 2874> Maximum-Value-Of-An-Ordered-Triplet-IIMedium
- 2873> Maximum-Value-Of-An-Ordered-Triplet-IEasy
- 2140> Solving-Questions-With-BrainpowerMedium
- 2551> Put-Marbles-In-BagsHard
- _763> Partition-LabelsMedium
- 2818> Apply-Operations-To-Maximize-ScoreHard
- 2503> Maximum-Number-Of-Points-From-Grid-QueriesHard
- 2780> Minimum-Index-Of-A-Valid-SplitMedium
- 2033> Minimum-Operations-To-Make-A-Uni-Value-GridMedium
- 3394> Check-If-Grid-Can-Be-Cut-Into-SectionsMedium
- 3169> Count-Days-Without-MeetingsMedium