├── .gitignore ├── BFS ├── 1036.Escape-a-Large-Maze │ ├── 1036.Escape-a-Large-Maze.cpp │ └── Readme.md ├── 1066.Campus-Bikes-II │ ├── 1066.Campus-Bikes-II_v1.cpp │ ├── 1066.Campus-Bikes-II_v2.cpp │ └── Readme.md ├── 1136.Parallel-Courses │ ├── 1136.Parallel-Courses.cpp │ └── Readme.md ├── 1203.Sort-Items-by-Groups-Respecting-Dependencies │ ├── 1203.Sort-Items-by-Groups-Respecting-Dependencies.cpp │ └── Readme.md ├── 1245.Tree-Diameter │ ├── 1245.Tree-Diameter.cpp │ └── Readme.md ├── 126.Word-Ladder-II │ ├── 126.Word-Ladder-II.cpp │ └── Readme.md ├── 1263.Minimum-Moves-to-Move-a-Box-to-Their-Target-Location │ ├── 1263.Minimum-Moves-to-Move-a-Box-to-Their-Target-Location.cpp │ └── Readme.md ├── 127.Word-Ladder │ ├── 127.Word-Ladder.cpp │ └── Readme.md ├── 1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination │ ├── 1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination.cpp │ └── Readme.md ├── 1298.Maximum-Candies-You-Can-Get-from-Boxes │ ├── 1298.Maximum-Candies-You-Can-Get-from-Boxes.cpp │ └── Readme.md ├── 1311.Get-Watched-Videos-by-Your-Friends │ ├── 1311.Get-Watched-Videos-by-Your-Friends.cpp │ └── Readme.md ├── 1345.Jump-Game-IV │ ├── 1345.Jump-Game-IV.cpp │ └── Readme.md ├── 1368.Minimum-Cost-to-Make-at-Least-One-Valid-Path-in-a-Grid │ ├── 1368.Minimum-Cost-to-Make-at-Least-One-Valid-Path-in-a-Grid_BFS.cpp │ ├── 1368.Minimum-Cost-to-Make-at-Least-One-Valid-Path-in-a-Grid_Dijkstra.cpp │ └── Readme.md ├── 1462.Course-Schedule-IV │ ├── 1462.Course-Schedule-IV.cpp │ └── Readme.md ├── 1559.Detect-Cycles-in-2D-Grid │ ├── 1559.Detect-Cycles-in-2D-Grid.cpp │ └── Readme.md ├── 1568.Minimum-Number-of-Days-to-Disconnect-Island │ ├── 1568.Minimum-Number-of-Days-to-Disconnect-Island.cpp │ └── Readme.md ├── 1591.Strange-Printer-II │ ├── 1591.Strange-Printer-II_bfs.cpp │ ├── 1591.Strange-Printer-II_dfs.cpp │ └── Readme.md ├── 1617.Count-Subtrees-With-Max-Distance-Between-Cities │ ├── 1617.Count-Subtrees-With-Max-Distance-Between-Cities.cpp │ └── Readme.md ├── 1654.Minimum-Jumps-to-Reach-Home │ ├── 1654.Minimum-Jumps-to-Reach-Home.cpp │ └── Readme.md ├── 1728.Cat-and-Mouse-II │ ├── 1728.Cat-and-Mouse-II.cpp │ └── Readme.md ├── 1786.Number-of-Restricted-Paths-From-First-to-Last-Node │ ├── 1786.Number-of-Restricted-Paths-From-First-to-Last-Node.cpp │ └── Readme.md ├── 1810.Minimum-Path-Cost-in-a-Hidden-Grid │ ├── 1810.Minimum-Path-Cost-in-a-Hidden-Grid.cpp │ └── Readme.md ├── 1857.Largest-Color-Value-in-a-Directed-Graph │ ├── 1857.Largest-Color-Value-in-a-Directed-Graph.cpp │ └── Readme.md ├── 1879.Minimum-XOR-Sum-of-Two-Arrays │ ├── 1879.Minimum-XOR-Sum-of-Two-Arrays_v1.cpp │ ├── 1879.Minimum-XOR-Sum-of-Two-Arrays_v2.cpp │ ├── 1879.Minimum-XOR-Sum-of-Two-Arrays_v3.cpp │ └── Readme.md ├── 1905.Count-Sub-Islands │ ├── 1905.Count-Sub-Islands.cpp │ └── Readme.md ├── 1928.Minimum-Cost-to-Reach-Destination-in-Time │ ├── 1928.Minimum-Cost-to-Reach-Destination-in-Time.cpp │ └── Readme.md ├── 1976.Number-of-Ways-to-Arrive-at-Destination │ ├── 1976.Number-of-Ways-to-Arrive-at-Destination.cpp │ └── Readme.md ├── 2045.Second-Minimum-Time-to-Reach-Destination │ ├── 2045.Second-Minimum-Time-to-Reach-Destination.cpp │ └── Readme.md ├── 2050.Parallel-Courses-III │ ├── 2050.Parallel-Courses-III.cpp │ └── Readme.md ├── 207.Course-Schedule │ ├── 207.Course-Schedule_BFS.cpp │ ├── 207.Course-Schedule_DFS.cpp │ └── Readme.md ├── 2093.Minimum-Cost-to-Reach-City-With-Discounts │ ├── 2093.Minimum-Cost-to-Reach-City-With-Discounts.cpp │ └── Readme.md ├── 210.Course-Schedule-II │ ├── 210.Course-Schedule-II.cpp │ └── Readme.md ├── 2101.Detonate-the-Maximum-Bombs │ ├── 2101.Detonate-the-Maximum-Bombs.cpp │ └── Readme.md ├── 2115.Find-All-Possible-Recipes-from-Given-Supplies │ ├── 2115.Find-All-Possible-Recipes-from-Given-Supplies.cpp │ └── Readme.md ├── 2127.Maximum-Employees-to-Be-Invited-to-a-Meeting │ ├── 2127.Maximum-Employees-to-Be-Invited-to-a-Meeting.cpp │ └── Readme.md ├── 2192.All-Ancestors-of-a-Node-in-a-Directed-Acyclic-Graph │ ├── 2192.All-Ancestors-of-a-Node-in-a-Directed-Acyclic-Graph.cpp │ └── Readme.md ├── 2203.Minimum-Weighted-Subgraph-With-the-Required-Paths │ ├── 2203.Minimum-Weighted-Subgraph-With-the-Required-Paths.cpp │ └── Readme.md ├── 2204.Distance-to-a-Cycle-in-Undirected-Graph │ ├── 2204.Distance-to-a-Cycle-in-Undirected-Graph.cpp │ └── Readme.md ├── 2258.Escape-the-Spreading-Fire │ ├── 2258.Escape-the-Spreading-Fire_v1.cpp │ ├── 2258.Escape-the-Spreading-Fire_v2.cpp │ ├── 2258.Escape-the-Spreading-Fire_v3.cpp │ ├── 2258.Escape-the-Spreading-Fire_v4.cpp │ └── Readme.md ├── 2290.Minimum-Obstacle-Removal-to-Reach-Corner │ ├── 2290.Minimum-Obstacle-Removal-to-Reach-Corner.cpp │ └── Readme.md ├── 2392.Build-a-Matrix-With-Conditions │ ├── 2392.Build-a-Matrix-With-Conditions.cpp │ └── Readme.md ├── 2440.Create-Components-With-Same-Value │ ├── 2440.Create-Components-With-Same-Value.cpp │ └── Readme.md ├── 2473.Minimum-Cost-to-Buy-Apples │ ├── 2473.Minimum-Cost-to-Buy-Apples.cpp │ └── Readme.md ├── 2493.Divide-Nodes-Into-the-Maximum-Number-of-Groups │ ├── 2493.Divide-Nodes-Into-the-Maximum-Number-of-Groups.cpp │ └── Readme.md ├── 2503.Maximum-Number-of-Points-From-Grid-Queries │ ├── 2503.Maximum-Number-of-Points-From-Grid-Queries.cpp │ └── Readme.md ├── 2577.Minimum-Time-to-Visit-a-Cell-In-a-Grid │ ├── 2577.Minimum-Time-to-Visit-a-Cell-In-a-Grid.cpp │ └── Readme.md ├── 2662.Minimum-Cost-of-a-Path-With-Special-Roads │ ├── 2662.Minimum-Cost-of-a-Path-With-Special-Roads_v1.cpp │ ├── 2662.Minimum-Cost-of-a-Path-With-Special-Roads_v2.cpp │ └── Readme.md ├── 269.Alien-Dictionary │ ├── 269.Alien-Dictionary.cpp │ └── Readme.md ├── 2714.Find-Shortest-Path-with-K-Hops │ ├── 2714.Find-Shortest-Path-with-K-Hops.cpp │ └── Readme.md ├── 2812.Find-the-Safest-Path-in-a-Grid │ ├── 2812.Find-the-Safest-Path-in-a-Grid.cpp │ └── Readme.md ├── 310.Minimum-Height-Trees │ ├── 310.Minimum-Height-Trees.cpp │ ├── 310.Minimum-Height-Trees.py │ └── Readme.md ├── 3552.Grid-Teleportation-Traversal │ ├── 3552.Grid-Teleportation-Traversal.cpp │ └── Readme.md ├── 3568.Minimum-Moves-to-Clean-the-Classroom │ ├── 3568.Minimum-Moves-to-Clean-the-Classroom.cpp │ └── Readme.md ├── 3594.Minimum-Time-to-Transport-All-Individuals │ ├── 3594.Minimum-Time-to-Transport-All-Individuals.cpp │ └── Readme.md ├── 3604.Minimum-Time-to-Reach-Destination-in-Directed-Graph │ ├── 3604.Minimum-Time-to-Reach-Destination-in-Directed-Graph.cpp │ └── Readme.md ├── 3629.Minimum-Jumps-to-Reach-End-via-Prime-Teleportation │ ├── 3629.Minimum-Jumps-to-Reach-End-via-Prime-Teleportation.cpp │ └── Readme.md ├── 3690.Split-and-Merge-Array-Transformation │ ├── 3690.Split-and-Merge-Array-Transformation.cpp │ └── Readme.md ├── 407.Trapping-Rain-Water-II │ ├── 407.Trapping-Rain-Water-II.cpp │ └── README.md ├── 444.Sequence-Reconstruction │ ├── 444.Sequence-Reconstruction.cpp │ └── Readme.md ├── 490.The-Maze │ ├── 490.The-Maze.cpp │ └── Readme.md ├── 499.The-Maze-III │ ├── 499.The-Maze-III.cpp │ └── Readme.md ├── 505.The-Maze-II │ ├── 505.The-Maze-II.cpp │ └── Readme.md ├── 529.Minesweeper │ ├── 529.Minesweeper.cpp │ └── Readme.md ├── 637.Average-of-Levels-in-Binary-Tree │ ├── 637.Average-of-Levels-in-Binary-Tree.cpp │ └── Readme.md ├── 675.Cut-Off-Trees-for-Golf-Event │ ├── 675.Cut-Off-Trees-for-Golf-Event.cpp │ └── Readme.md ├── 694.Number-of-Distinct-Islands │ ├── 694.Number-of-Distinct-Islands.cpp │ └── Readme.md ├── 743.Network-Delay-Time │ ├── 743.Network-Delay-Time_BFS.cpp │ ├── 743.Network-Delay-Time_Dijkstra_ElogE.cpp │ ├── 743.Network-Delay-Time_Dijkstra_N2.cpp │ ├── 743.Network-Delay-Time_Floyd.cpp │ └── Readme.md ├── 778.Swim-in-Rising-Water │ ├── 778.Swim-in-Rising-Water.cpp │ └── Readme.md ├── 785.Is-Graph-Bipartite │ ├── 785.Is-Graph-Bipartite.cpp │ ├── 785.Is-Graph-Bipartite_UnionFind.cpp │ └── Readme.md ├── 802.Find-Eventual-Safe-States │ ├── 802.Find-Eventual-Safe-States_BFS.cpp │ ├── 802.Find-Eventual-Safe-States_DFS.cpp │ └── Readme.md ├── 815.Bus-Routes │ ├── 815.Bus-Routes.py │ ├── 815.Bus-Routes_v1.cpp │ ├── 815.Bus-Routes_v2.cpp │ ├── 815.Bus-Routes_v3.cpp │ └── Readme.md ├── 838.Push-Dominoes │ ├── 838.Push-Dominoes.cpp │ └── Readme.md ├── 847.Shortest-Path-Visiting-All-Nodes │ ├── 847.Shortest-Path-Visiting-All-Nodes.cpp │ ├── 847.Shortest-Path-Visiting-All-Nodes.py │ └── Readme.md ├── 854.K-Similar-Strings │ └── 854.K-Similar-Strings.cpp ├── 864.Shortest-Path-to-Get-All-Keys │ ├── 864.Shortest-Path-to-Get-All-Keys.cpp │ └── Readme.md ├── 882.Reachable-Nodes-In-Subdivided-Graph │ ├── 882.Reachable-Nodes-In-Subdivided-Graph_v1.cpp │ ├── 882.Reachable-Nodes-In-Subdivided-Graph_v2.cpp │ └── Readme.md ├── 913.Cat-and-Mouse │ ├── 913.Cat-and-Mouse.cpp │ ├── 913.Cat-and-Mouse.py │ └── Readme.md └── 928.Minimize-Malware-Spread-II │ ├── 928.Minimize-Malware-Spread-II.cpp │ └── Readme.md ├── Binary_Search ├── 004.Median-of-Two-Sorted-Arrays │ ├── 4-Median-of-Two-Sorted-Arrays.cpp │ ├── 4-Median-of-Two-Sorted-Arrays_PQ.cpp │ └── Readme.md ├── 029.Divide-Two-Integers │ ├── 029.Divide Two Integers.cpp │ └── Readme.md ├── 033.Search-in-Rotated-Sorted-Array │ ├── 033.Search-in-Rotated-Sorted-Array_v3.cpp │ ├── 33.Search in Rotated Sorted Array.cpp │ ├── 33.Search in Rotated Sorted Array_s2.cpp │ └── Readme.md ├── 034.Search-for-a-Range │ ├── 034.Search-for-a-Range_v2.cpp │ ├── 34.Search for a Range.cpp │ └── Readme.md ├── 081.Search-in-Rotated-Sorted-Array-II │ ├── 081.Search-in-Rotated-Sorted-Array-II_v2.cpp │ ├── 81.Search-in-Rotated-Sorted-Array-II.cpp │ └── Readme.md ├── 1011.Capacity-To-Ship-Packages-Within-D-Days │ ├── 1011.Capacity-To-Ship-Packages-Within-D-Days.cpp │ └── Readme.md ├── 1060.Missing-Element-in-Sorted-Array │ ├── 1060.Missing-Element-in-Sorted-Array.cpp │ └── Readme.md ├── 1102.Path-With-Maximum-Minimum-Value │ ├── 1102.Path-With-Maximum-Minimum-Value_v1.cpp │ ├── 1102.Path-With-Maximum-Minimum-Value_v2.cpp │ └── Readme.md ├── 1157.Online-Majority-Element-In-Subarray │ ├── 1157.Online-Majority-Element-In-Subarray.cpp │ ├── 1157.Online-Majority-Element-In-Subarray_SegTree.cpp │ └── Readme.md ├── 1201.Ugly-Number-III │ ├── 1201.Ugly-Number-III.cpp │ └── Readme.md ├── 1231.Divide-Chocolate │ ├── 1231.Divide-Chocolate.cpp │ └── Readme.md ├── 1237.Find-Positive-Integer-Solution-for-a-Given-Equation │ ├── 1237.Find-Positive-Integer-Solution-for-a-Given-Equation.cpp │ └── Readme.md ├── 1283.Find-the-Smallest-Divisor-Given-a-Threshold │ ├── 1283.Find-the-Smallest-Divisor-Given-a-Threshold.cpp │ └── Readme.md ├── 1292.Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Threshold │ ├── 1292.Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Threshold.cpp │ └── Readme.md ├── 1300.Sum-of-Mutated-Array-Closest-to-Target │ ├── 1300.Sum-of-Mutated-Array-Closest-to-Target.cpp │ └── Readme.md ├── 1482.Minimum-Number-of-Days-to-Make-m-Bouquets │ ├── 1482.Minimum-Number-of-Days-to-Make-m-Bouquets.cpp │ └── Readme.md ├── 1483.Kth-Ancestor-of-a-Tree-Node │ ├── 1483.Kth-Ancestor-of-a-Tree-Node.cpp │ └── Readme.md ├── 1508.Range-Sum-of-Sorted-Subarray-Sums │ ├── 1508.Range-Sum-of-Sorted-Subarray-Sums.cpp │ └── Readme.md ├── 153.Find-Minimum-in-Rotated-Sorted-Array │ ├── 153.Find-Minimum-in-Rotated-Sorted-Array.cpp │ └── Readme.md ├── 1533.Find-the-Index-of-the-Large-Integer │ ├── 1533.Find-the-Index-of-the-Large-Integer.cpp │ └── Readme.md ├── 1539.Kth-Missing-Positive-Number │ ├── 1539.Kth-Missing-Positive-Number_v1.cpp │ ├── 1539.Kth-Missing-Positive-Number_v2.cpp │ ├── 1539.Kth-Missing-Positive-Number_v3.cpp │ └── Readme.md ├── 154.Find-Minimum-in-Rotated-Sorted-Array-II │ ├── 154.Find-Minimum-in-Rotated-Sorted-Array-II.cpp │ ├── 154.Find-Minimum-in-Rotated-Sorted-Array-II_v2.cpp │ └── Readme.md ├── 1552.Magnetic-Force-Between-Two-Balls │ ├── 1552.Magnetic-Force-Between-Two-Balls.cpp │ └── Readme.md ├── 1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X │ ├── 1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X_v1.cpp │ ├── 1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X_v2.cpp │ └── Readme.md ├── 162.Find-Peak-Element │ ├── 162.Find Peak Element.cpp │ └── Readme.md ├── 1648.Sell-Diminishing-Valued-Colored-Balls │ ├── 1648.Sell-Diminishing-Valued-Colored-Balls_v1.cpp │ ├── 1648.Sell-Diminishing-Valued-Colored-Balls_v2.cpp │ └── Readme.md ├── 1712.Ways-to-Split-Array-Into-Three-Subarrays │ ├── 1712.Ways-to-Split-Array-Into-Three-Subarrays.cpp │ ├── 1712.Ways-to-Split-Array-Into-Three-Subarrays_v2.cpp │ └── Readme.md ├── 1802.Maximum-Value-at-a-Given-Index-in-a-Bounded-Array │ ├── 1802.Maximum-Value-at-a-Given-Index-in-a-Bounded-Array.cpp │ └── Readme.md ├── 1870.Minimum-Speed-to-Arrive-on-Time │ ├── 1870.Minimum-Speed-to-Arrive-on-Time.cpp │ └── Readme.md ├── 1889.Minimum-Space-Wasted-From-Packaging │ ├── 1889.Minimum-Space-Wasted-From-Packaging.cpp │ └── Readme.md ├── 1891.Cutting-Ribbons │ ├── 1891.Cutting-Ribbons.cpp │ └── Readme.md ├── 1898.Maximum-Number-of-Removable-Characters │ ├── 1898.Maximum-Number-of-Removable-Characters.cpp │ └── Readme.md ├── 1901.Find-a-Peak-Element-II │ ├── 1901.Find-a-Peak-Element-II.cpp │ └── Readme.md ├── 1918.Kth-Smallest-Subarray-Sum │ ├── 1918.Kth-Smallest-Subarray-Sum.cpp │ └── Readme.md ├── 1922.Count-Good-Numbers │ ├── 1922.Count-Good-Numbers.cpp │ └── Readme.md ├── 2040.Kth-Smallest-Product-of-Two-Sorted-Arrays │ ├── 2040.Kth-Smallest-Product-of-Two-Sorted-Arrays_v1.cpp │ ├── 2040.Kth-Smallest-Product-of-Two-Sorted-Arrays_v2.cpp │ └── Readme.md ├── 2064.Minimized-Maximum-of-Products-Distributed-to-Any-Store │ ├── 2064.Minimized-Maximum-of-Products-Distributed-to-Any-Store.cpp │ └── Readme.md ├── 2071.Maximum-Number-of-Tasks-You-Can-Assign │ ├── 2071.Maximum-Number-of-Tasks-You-Can-Assign.cpp │ └── Readme.md ├── 2137.Pour-Water-Between-Buckets-to-Make-Water-Levels-Equal │ ├── 2137.Pour-Water-Between-Buckets-to-Make-Water-Levels-Equal.cpp │ └── Readme.md ├── 2141.Maximum-Running-Time-of-N-Computers │ ├── 2141.Maximum-Running-Time-of-N-Computers.cpp │ └── Readme.md ├── 215.Kth-Largest-Element-in-an-Array │ ├── 215.Kth-Largest-Element-in-an-Array_v1.cpp │ ├── 215.Kth-Largest-Element-in-an-Array_v2.cpp │ └── Readme.md ├── 2226.Maximum-Candies-Allocated-to-K-Children │ ├── 2226.Maximum-Candies-Allocated-to-K-Children.cpp │ └── Readme.md ├── 2387.Median-of-a-Row-Wise-Sorted-Matrix │ ├── 2387.Median-of-a-Row-Wise-Sorted-Matrix.cpp │ └── Readme.md ├── 2439.Minimize-Maximum-of-Array │ ├── 2439.Minimize-Maximum-of-Array_v1.cpp │ ├── 2439.Minimize-Maximum-of-Array_v2.cpp │ └── Readme.md ├── 2513.Minimize-the-Maximum-of-Two-Arrays │ ├── 2513.Minimize-the-Maximum-of-Two-Arrays.cpp │ └── Readme.md ├── 2517.Maximum-Tastiness-of-Candy-Basket │ ├── 2517.Maximum-Tastiness-of-Candy-Basket.cpp │ └── Readme.md ├── 2528.Maximize-the-Minimum-Powered-City │ ├── 2528.Maximize-the-Minimum-Powered-City.cpp │ └── Readme.md ├── 2557.Maximum-Number-of-Integers-to-Choose-From-a-Range-II │ ├── 2557.Maximum-Number-of-Integers-to-Choose-From-a-Range-II.cpp │ └── Readme.md ├── 2560.House-Robber-IV │ ├── 2560.House-Robber-IV.cpp │ └── Readme.md ├── 2563.Count-the-Number-of-Fair-Pairs │ ├── 2563.Count-the-Number-of-Fair-Pairs.cpp │ └── Readme.md ├── 2594.Minimum-Time-to-Repair-Cars │ ├── 2594.Minimum-Time-to-Repair-Cars.cpp │ └── Readme.md ├── 2604.Minimum-Time-to-Eat-All-Grains │ ├── 2604.Minimum-Time-to-Eat-All-Grains.cpp │ └── Readme.md ├── 2616.Minimize-the-Maximum-Difference-of-Pairs │ ├── 2616.Minimize-the-Maximum-Difference-of-Pairs.cpp │ └── Readme.md ├── 2702.Minimum-Operations-to-Make-Numbers-Non-positive │ ├── 2702.Minimum-Operations-to-Make-Numbers-Non-positive.cpp │ └── Readme.md ├── 275.H-Index-II │ ├── 275.H-Index II.cpp │ ├── 275.H-Index-II_v2.cpp │ └── Readme.md ├── 2819.Minimum-Relative-Loss-After-Buying-Chocolates │ ├── 2819.Minimum-Relative-Loss-After-Buying-Chocolates.cpp │ └── Readme.md ├── 2836.Maximize-Value-of-Function-in-a-Ball-Passing-Game │ ├── 2836.Maximize-Value-of-Function-in-a-Ball-Passing-Game.cpp │ └── Readme.md ├── 2846.Minimum-Edge-Weight-Equilibrium-Queries-in-a-Tree │ ├── 2846.Minimum-Edge-Weight-Equilibrium-Queries-in-a-Tree_v1.cpp │ ├── 2846.Minimum-Edge-Weight-Equilibrium-Queries-in-a-Tree_v2.cpp │ └── Readme.md ├── 2861.Maximum-Number-of-Alloys │ ├── 2861.Maximum-Number-of-Alloys.cpp │ └── Readme.md ├── 287.Find-the-Duplicate-Number │ ├── 287.Find-the-Duplicate-Number_v1.cpp │ ├── 287.Find-the-Duplicate-Number_v2.cpp │ ├── 287.Find-the-Duplicate-Number_v3.cpp │ └── Readme.md ├── 2972.Count-the-Number-of-Incremovable-Subarrays-II │ ├── 2972.Count-the-Number-of-Incremovable-Subarrays-II.cpp │ └── Readme.md ├── 302.Smallest-Rectangle-Enclosing-Black-Pixels │ ├── 302.Smallest Rectangle Enclosing Black Pixels.cpp │ └── Readme.md ├── 3048.Earliest-Second-to-Mark-Indices-I │ ├── 3048.Earliest-Second-to-Mark-Indices-I.cpp │ └── Readme.md ├── 3049.Earliest-Second-to-Mark-Indices-II │ ├── 3049.Earliest-Second-to-Mark-Indices-II.cpp │ └── Readme.md ├── 3097.Shortest-Subarray-With-OR-at-Least-K-II │ ├── 3097.Shortest-Subarray-With-OR-at-Least-K-II.cpp │ └── Readme.md ├── 3399.Smallest-Substring-With-Identical-Characters-II │ ├── 3399.Smallest-Substring-With-Identical-Characters-II.cpp │ └── Readme.md ├── 3449.Maximize-the-Minimum-Game-Score │ ├── 3449.Maximize-the-Minimum-Game-Score.cpp │ └── Readme.md ├── 3464.Maximize-the-Distance-Between-Points-on-a-Square │ ├── 3464.Maximize-the-Distance-Between-Points-on-a-Square.cpp │ └── Readme.md ├── 3534.Path-Existence-Queries-in-a-Graph-II │ ├── 3534.Path-Existence-Queries-in-a-Graph-II.cpp │ └── Readme.md ├── 3553.Minimum-Weighted-Subgraph-With-the-Required-Paths-II │ ├── 3553.Minimum-Weighted-Subgraph-With-the-Required-Paths-II.cpp │ └── Readme.md ├── 3559.Number-of-Ways-to-Assign-Edge-Weights-II │ ├── 3559.Number-of-Ways-to-Assign-Edge-Weights-II.cpp │ └── Readme.md ├── 3585.Find-Weighted-Median-Node-in-Tree │ ├── 3585.Find-Weighted-Median-Node-in-Tree.cpp │ └── Readme.md ├── 3639.Minimum-Time-to-Activate-String │ ├── 3639.Minimum-Time-to-Activate-String.cpp │ └── Readme.md ├── 3677.Count-Binary-Palindromic-Numbers │ ├── 3677.Count-Binary-Palindromic-Numbers.cpp │ └── Readme.md ├── 3691.Maximum-Total-Subarray-Value-II │ ├── 3691.Maximum-Total-Subarray-Value-II_v1.cpp │ └── Readme.md ├── 373.Find-K-Pairs-with-Smallest-Sums │ ├── 373.Find-K-Pairs-with-Smallest-Sums.cpp │ ├── 373.Find-K-Pairs-with-Smallest-Sums_v2.cpp │ └── Readme.md ├── 378.Kth-Smallest-Element-in-a-Sorted-Matrix │ ├── 378.Kth Smallest Element in a Sorted Matrix.cpp │ ├── 378.Kth-Smallest-Element-in-a-Sorted-Matrix_v2.cpp │ └── Readme.md ├── 475.Heaters │ ├── 475.Heaters.cpp │ └── Readme.md ├── 483.Smallest-Good-Base │ ├── 483.Smallest Good Base.cpp │ └── Readme.md ├── 658.Find-K-Closest-Elements │ ├── 658.Find-K-Closest-Elements.cpp │ └── Readme.md ├── 668.Kth-Smallest-Number-in-Multiplication-Table │ ├── 668.Kth-Smallest-Number-in-Multiplication-Table.cpp │ └── Readme.md ├── 719.Find-K-th-Smallest-Pair-Distance │ ├── 719.Find-K-th-Smallest-Pair-Distance.cpp │ └── Readme.md ├── 786.K-th Smallest-Prime-Fraction │ ├── 786.K-th Smallest-Prime-Fraction.cpp │ └── Readme.md └── 793.Preimage-Size-of-Factorial-Zeroes-Function │ ├── 793.Preimage-Size-of-Factorial-Zeroes-Function.cpp │ └── Readme.md ├── Bit_Manipulation ├── 1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters │ ├── 1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.cpp │ └── Readme.md ├── 1284.Minimum-Number-of-Flips-to-Convert-Binary-Matrix-to-Zero-Matrix │ ├── 1284.Minimum-Number-of-Flips-to-Convert-Binary-Matrix-to-Zero-Matrix_v1.cpp │ ├── 1284.Minimum-Number-of-Flips-to-Convert-Binary-Matrix-to-Zero-Matrix_v2.cpp │ └── Readme.md ├── 1310.XOR-Queries-of-a-Subarray │ ├── 1310.XOR-Queries-of-a-Subarray,cpp │ └── Readme.md ├── 136.Single-Number │ ├── 136.Single Number.cpp │ └── Readme.md ├── 137.Single-Number-II │ ├── 137.Single-Number-II_v1.cpp │ ├── 137.Single-Number-II_v2.cpp │ └── Readme.md ├── 1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR │ ├── 1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.cpp │ └── Readme.md ├── 1452.People-Whose-List-of-Favorite-Companies-Is-Not-a-Subset-of-Another-List │ ├── 1452.People-Whose-List-of-Favorite-Companies-Is-Not-a-Subset-of-Another-List_v1.cpp │ ├── 1452.People-Whose-List-of-Favorite-Companies-Is-Not-a-Subset-of-Another-List_v2.cpp │ └── Readme.md ├── 1506.Find-Root-of-N-Ary-Tree │ ├── 1506.Find-Root-of-N-Ary-Tree_v1.cpp │ ├── 1506.Find-Root-of-N-Ary-Tree_v2.cpp │ └── Readme.md ├── 1521.Find-a-Value-of-a-Mysterious-Function-Closest-to-Target │ ├── 1521.Find-a-Value-of-a-Mysterious-Function-Closest-to-Target.cpp │ └── Readme.md ├── 1601.Maximum-Number-of-Achievable-Transfer-Requests │ ├── 1601.Maximum-Number-of-Achievable-Transfer-Requests_v1.cpp │ ├── 1601.Maximum-Number-of-Achievable-Transfer-Requests_v2.cpp │ ├── 1601.Maximum-Number-of-Achievable-Transfer-Requests_v3.cpp │ └── Readme.md ├── 1734.Decode-XORed-Permutation │ ├── 1734.Decode-XORed-Permutation.cpp │ └── Readme.md ├── 1738.Find-Kth-Largest-XOR-Coordinate-Value │ ├── 1738.Find-Kth-Largest-XOR-Coordinate-Value_v1.cpp │ ├── 1738.Find-Kth-Largest-XOR-Coordinate-Value_v2.cpp │ └── Readme.md ├── 1755.Closest-Subsequence-Sum │ ├── 1755.Closest-Subsequence-Sum.cpp │ └── Readme.md ├── 1774.Closest-Dessert-Cost │ ├── 1774.Closest-Dessert-Cost.cpp │ └── Readme.md ├── 1835.Find-XOR-Sum-of-All-Pairs-Bitwise-AND │ ├── 1835.Find-XOR-Sum-of-All-Pairs-Bitwise-AND.cpp │ └── Readme.md ├── 2002.Maximum-Product-of-the-Length-of-Two-Palindromic-Subsequences │ ├── 2002.Maximum-Product-of-the-Length-of-Two-Palindromic-Subsequences.cpp │ └── Readme.md ├── 2035.Partition-Array-Into-Two-Arrays-to-Minimize-Sum-Difference │ ├── 2035.Partition-Array-Into-Two-Arrays-to-Minimize-Sum-Difference.cpp │ └── Readme.md ├── 2151.Maximum-Good-People-Based-on-Statements │ ├── 2151.Maximum-Good-People-Based-on-Statements.cpp │ └── Readme.md ├── 2397.Maximum-Rows-Covered-by-Columns │ ├── 2397.Maximum-Rows-Covered-by-Columns.cpp │ └── Readme.md ├── 2505.Bitwise-OR-of-All-Subsequence-Sums │ ├── 2505.Bitwise-OR-of-All-Subsequence-Sums.cpp │ └── Readme.md ├── 2527.Find-Xor-Beauty-of-Array │ ├── 2527.Find-Xor-Beauty-of-Array.cpp │ └── Readme.md ├── 260.Single-Number-III │ ├── 260.Single-Number-III.cpp │ └── Readme.md ├── 2680.Maximum-OR │ ├── 2680.Maximum-OR.cpp │ └── Readme.md ├── 2802.Find-The-K-th-Lucky-Number │ ├── 2802.Find-The-K-th-Lucky-Number.cpp │ └── Readme.md ├── 2992.Number-of-Self-Divisible-Permutations │ ├── 2992.Number-of-Self-Divisible-Permutations.cpp │ └── Readme.md ├── 3116.Kth-Smallest-Amount-With-Single-Denomination-Combination │ ├── 3116.Kth-Smallest-Amount-With-Single-Denomination-Combination.cpp │ └── Readme.md ├── 3133.Minimum-Array-End │ ├── 3133.Minimum-Array-End.cpp │ └── Readme.md ├── 3171.Find-Subarray-With-Bitwise-AND-Closest-to-K │ ├── 3171.Find-Subarray-With-Bitwise-AND-Closest-to-K_v1.cpp │ ├── 3171.Find-Subarray-With-Bitwise-AND-Closest-to-K_v2.cpp │ └── Readme.md ├── 318.Maximum-Product-of-Word-Lengths │ ├── 318.Maximum-Product-of-Word-Lengths.cpp │ └── Readme.md ├── 3209.Number-of-Subarrays-With-AND-Value-of-K │ ├── 3209.Number-of-Subarrays-With-AND-Value-of-K_v1.cpp │ ├── 3209.Number-of-Subarrays-With-AND-Value-of-K_v2.cpp │ └── Readme.md ├── 342.Power-of-Four │ ├── 342.Power-of-Four.cpp │ └── Readme.md ├── 371.Sum-of-Two-Integers │ ├── 371.Sum-of-Two-Integers.cpp │ └── Readme.md ├── 898.Bitwise-ORs-of-Subarrays │ ├── 898.Bitwise-ORs-of-Subarrays.cpp │ └── Readme.md └── 957.Prison-Cells-After-N-Days │ ├── 957.Prison-Cells-After-N-Days.cpp │ └── Readme.md ├── CMakeLists.txt ├── DFS ├── 037.Sudoku-Solver │ ├── 037.Sudoku-Solver.cpp │ └── Readme.md ├── 040.Combination-Sum-II │ ├── 040.Combination-Sum-II.cpp │ └── Readme.md ├── 051.N-Queens │ ├── 051.N-Queens.cpp │ └── Readme.md ├── 090.Subsets-II │ ├── 090.Subsets-II.cpp │ └── Readme.md ├── 1192.Critical-Connections-in-a-Network │ ├── 1192.Critical-Connections-in-a-Network.cpp │ └── Readme.md ├── 1306.Jump-Game-III │ ├── 1306.Jump-Game-III.cpp │ └── Readme.md ├── 1307.Verbal-Arithmetic-Puzzle │ ├── 1307.Verbal-Arithmetic-Puzzle.cpp │ └── Readme.md ├── 1340.Jump-Game-V │ ├── 1340.Jump-Game-V_v1.cpp │ ├── 1340.Jump-Game-V_v2.cpp │ └── Readme.md ├── 1593.Split-a-String-Into-the-Max-Number-of-Unique-Substrings │ ├── 1593.Split-a-String-Into-the-Max-Number-of-Unique-Substrings.cpp │ └── Readme.md ├── 1718.Construct-the-Lexicographically-Largest-Valid-Sequence │ ├── 1718.Construct-the-Lexicographically-Largest-Valid-Sequence.cpp │ └── Readme.md ├── 1766.Tree-of-Coprimes │ ├── 1766.Tree-of-Coprimes.cpp │ └── Readme.md ├── 1778.Shortest-Path-in-a-Hidden-Grid │ ├── 1778.Shortest-Path-in-a-Hidden-Grid.cpp │ └── Readme.md ├── 1815.Maximum-Number-of-Groups-Getting-Fresh-Donuts │ ├── 1815.Maximum-Number-of-Groups-Getting-Fresh-Donuts_v1.cpp │ ├── 1815.Maximum-Number-of-Groups-Getting-Fresh-Donuts_v2.cpp │ └── Readme.md ├── 200.Number-of-Islands │ ├── 200.Number of Islands_BFS.cpp │ ├── 200.Number of Islands_DFS.cpp │ ├── 200.Number-of-Islands_UnionFind.cpp │ └── Readme.md ├── 2014.Longest-Subsequence-Repeated-k-Times │ ├── 2014.Longest-Subsequence-Repeated-k-Times.cpp │ └── Readme.md ├── 2056.Number-of-Valid-Move-Combinations-On-Chessboard │ ├── 2056.Number-of-Valid-Move-Combinations-On-Chessboard.cpp │ └── Readme.md ├── 2065.Maximum-Path-Quality-of-a-Graph │ ├── 2065.Maximum-Path-Quality-of-a-Graph.cpp │ └── Readme.md ├── 2305.Fair-Distribution-of-Cookies │ ├── 2305.Fair-Distribution-of-Cookies_v1.cpp │ ├── 2305.Fair-Distribution-of-Cookies_v2.cpp │ ├── 2305.Fair-Distribution-of-Cookies_v3.cpp │ └── Readme.md ├── 2328.Number-of-Increasing-Paths-in-a-Grid │ ├── 2328.Number-of-Increasing-Paths-in-a-Grid_v1.cpp │ ├── 2328.Number-of-Increasing-Paths-in-a-Grid_v2.cpp │ └── Readme.md ├── 2597.The-Number-of-Beautiful-Subsets │ ├── 2597.The-Number-of-Beautiful-Subsets.cpp │ ├── 2597.The-Number-of-Beautiful-Subsets_v2.cpp │ └── Readme.md ├── 2741.Special-Permutations │ ├── 2741.Special-Permutations.cpp │ └── Readme.md ├── 2746.Decremental-String-Concatenation │ ├── 2746.Decremental-String-Concatenation.cpp │ └── Readme.md ├── 282.Expression-Add-Operators │ ├── 282.Expression Add Operators.cpp │ └── Readme.md ├── 2842.Count-K-Subsequences-of-a-String-With-Maximum-Beauty │ ├── 2842.Count-K-Subsequences-of-a-String-With-Maximum-Beauty.cpp │ └── Readme.md ├── 2850.Minimum-Moves-to-Spread-Stones-Over-Grid │ ├── 2850.Minimum-Moves-to-Spread-Stones-Over-Grid.cpp │ └── Readme.md ├── 291.Word-Pattern-II │ ├── 291.Word-Pattern-II.cpp │ └── Readme.md ├── 301.Remove-Invalid-Parentheses │ ├── 301.Remove-Invalid-Parentheses.cpp │ └── Readme.md ├── 312.Burst-Balloons │ ├── 312.Burst-Balloons-DFS.py │ ├── 312.Burst-Balloons-DP.cpp │ ├── 312.Burst-Balloons-DP.py │ └── Readme.md ├── 3213.Construct-String-with-Minimum-Cost │ ├── 3213.Construct-String-with-Minimum-Cost.cpp │ └── Readme.md ├── 329.Longest-Increasing-Path-in-a-Matrix │ ├── 329.Longest-Increasing-Path-in-a-Matrix.cpp │ └── Readme.md ├── 332.Reconstruct-Itinerary │ ├── 332.Reconstruct-Itinerary.py │ ├── 332.Reconstruct-Itinerary_v1.cpp │ ├── 332.Reconstruct-Itinerary_v2.cpp │ └── Readme.md ├── 3459.Length-of-Longest-V-Shaped-Diagonal-Segment │ ├── 3459.Length-of-Longest-V-Shaped-Diagonal-Segment.cpp │ └── Readme.md ├── 351.Android-Unlock-Patterns │ ├── 351.Android-Unlock-Patterns.cpp │ └── Readme.md ├── 3593.Minimum-Increments-to-Equalize-Leaf-Paths │ ├── 3593.Minimum-Increments-to-Equalize-Leaf-Paths.cpp │ └── Readme.md ├── 3615.Longest-Palindromic-Path-in-Graph │ ├── 3615.Longest-Palindromic-Path-in-Graph.cpp │ └── Readme.md ├── 3669.Balanced-K-Factor-Decomposition │ ├── 3669.Balanced-K-Factor-Decomposition.cpp │ └── Readme.md ├── 399.Evaluate-Division │ ├── 399.Evaluate Division.cpp │ ├── 399.Evaluate-Division.py │ ├── 399.Evaluate-Division_v2.cpp │ └── Readme.md ├── 403.Frog-Jump │ ├── 403.Frog-Jump_v1.cpp │ ├── 403.Frog-Jump_v2.cpp │ └── Readme.md ├── 417.Pacific-Atlantic-Water-Flow │ ├── 417.Pacific-Atlantic-Water-Flow_BFS.cpp │ ├── 417.Pacific-Atlantic-Water-Flow_DFS.cpp │ └── Readme.md ├── 425.Word-Squares │ ├── 425.Word-Squares.cpp │ └── Readme.md ├── 473.Matchsticks-to-Square │ ├── 473.Matchsticks-to-Square.cpp │ ├── 473.Matchsticks-to-Square_v2.cpp │ └── Readme.md ├── 488.Zuma-Game │ ├── 488.Zuma-Game.cpp │ ├── 488.Zuma-Game.py │ ├── 488.Zuma-Game_v2.cpp │ └── Readme.md ├── 489.Robot-Room-Cleaner │ ├── 489.Robot-Room-Cleaner.cpp │ └── Readme.md ├── 491.Increasing-Subsequences │ ├── 491.Increasing Subsequences.cpp │ └── Readme.md ├── 546.Remove-Boxes │ ├── 546.Remove-Boxes.cpp │ └── Readme.md ├── 638.Shopping-Offers │ ├── 638.Shopping-Offers.cpp │ ├── 638.Shopping-Offers.py │ ├── 638.Shopping-Offers_v2.cpp │ ├── 638.Shopping-Offers_v3.cpp │ └── Readme.md ├── 698.Partition-to-K-Equal-Sum-Subsets │ ├── 698.Partition-to-K-Equal-Sum-Subsets_v1.cpp │ ├── 698.Partition-to-K-Equal-Sum-Subsets_v2.cpp │ └── Readme.md ├── 803.Bricks-Falling-When-Hit │ ├── 803.Bricks-Falling-When-Hit_DFS.cpp │ ├── 803.Bricks-Falling-When-Hit_UnionFind.cpp │ └── Readme.md ├── 959.Regions-Cut-By-Slashes │ ├── 959.Regions-Cut-By-Slashes.cpp │ ├── 959.Regions-Cut-By-Slashes_UF.cpp │ └── Readme.md └── 996.Number-of-Squareful-Arrays │ ├── 996.Number-of-Squareful-Arrays.cpp │ └── Readme.md ├── Deque ├── 1425.Constrained-Subsequence-Sum │ ├── 1425.Constrained-Subsequence-Sum_deque.cpp │ ├── 1425.Constrained-Subsequence-Sum_heap.cpp │ └── Readme.md ├── 1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit │ ├── 1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit_deque.cpp │ ├── 1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit_heap.cpp │ └── Readme.md ├── 1499.Max-Value-of-Equation │ ├── 1499.Max-Value-of-Equation.cpp │ └── Readme.md ├── 1562.Find-Latest-Group-of-Size-M │ ├── 1562.Find-Latest-Group-of-Size-M.cpp │ ├── 1562.Find-Latest-Group-of-Size-M_v2.cpp │ └── Readme.md ├── 1696.Jump-Game-VI │ ├── 1696.Jump-Game-VI.cpp │ └── Readme.md ├── 1776.Car-Fleet-II │ ├── 1776.Car-Fleet-II.cpp │ └── Readme.md ├── 239.Sliding-Window-Maximum │ ├── 239.Sliding-Window-Maximum_deque.cpp │ ├── 239.Sliding-Window-Maximum_heap.cpp │ └── Readme.md ├── 2398.Maximum-Number-of-Robots-Within-Budget │ ├── 2398.Maximum-Number-of-Robots-Within-Budget_v1.cpp │ ├── 2398.Maximum-Number-of-Robots-Within-Budget_v2.cpp │ ├── 2398.Maximum-Number-of-Robots-Within-Budget_v3.cpp │ └── Readme.md ├── 2762.Continuous-Subarrays │ ├── 2762.Continuous-Subarrays.cpp │ └── Readme.md ├── 2969.Minimum-Number-of-Coins-for-Fruits-II │ ├── 2969.Minimum-Number-of-Coins-for-Fruits-II.cpp │ └── Readme.md ├── 3578.Count-Partitions-With-Max-Min-Difference-at-Most-K │ ├── 3578.Count-Partitions-With-Max-Min-Difference-at-Most-K.cpp │ └── Readme.md └── 862.Shortest-Subarray-with-Sum-at-Least-K │ ├── 862.Shortest-Subarray-with-Sum-at-Least-K.cpp │ ├── 862.Shortest-Subarray-with-Sum-at-Least-K_v2.cpp │ └── Readme.md ├── Design ├── 1146.Snapshot-Array │ ├── 1146.Snapshot-Array.cpp │ └── Readme.md ├── 1172.Dinner-Plate-Stacks │ ├── 1172.Dinner-Plate-Stacks.cpp │ └── Readme.md ├── 1352.Product-of-the-Last-K-Numbers │ ├── 1352.Product-of-the-Last-K-Numbers.cpp │ └── Readme.md ├── 1381.Design-a-Stack-With-Increment-Operation │ ├── 1381.Design-a-Stack-With-Increment-Operation.cpp │ └── Readme.md ├── 1418.Display-Table-of-Food-Orders-in-a-Restaurant │ ├── 1418.Display-Table-of-Food-Orders-in-a-Restaurant.cpp │ └── Readme.md ├── 146.LRU-Cache │ ├── 146.LRU-Cache.cpp │ └── Readme.md ├── 1622.Fancy-Sequence │ ├── 1622.Fancy-Sequence.cpp │ └── Readme.md ├── 1801.Number-of-Orders-in-the-Backlog │ ├── 1801.Number-of-Orders-in-the-Backlog.cpp │ └── Readme.md ├── 2166.Design-Bitset │ ├── 2166.Design-Bitset.cpp │ └── Readme.md ├── 2227.Encrypt-and-Decrypt-Strings │ ├── 2227.Encrypt-and-Decrypt-Strings.cpp │ └── Readme.md ├── 2289.Steps-to-Make-Array-Non-decreasing │ ├── 2289.Steps-to-Make-Array-Non-decreasing_v1.cpp │ ├── 2289.Steps-to-Make-Array-Non-decreasing_v2.cpp │ ├── 2289.Steps-to-Make-Array-Non-decreasing_v3.cpp │ └── Readme.md ├── 2296.Design-a-Text-Editor │ ├── 2296.Design-a-Text-Editor_v1.cpp │ ├── 2296.Design-a-Text-Editor_v2.cpp │ └── Readme.md ├── 355.Design-Twitter │ ├── 355.Design-Twitter.cpp │ └── Readme.md ├── 380.Insert-Delete-GetRandom-O-1 │ ├── 380.Insert Delete GetRandom O(1).cpp │ └── Readme.md ├── 381.Insert-Delete-GetRandom-O1-Duplicates-allowed │ ├── 381.Insert-Delete-GetRandom-O1-Duplicates-allowed.cpp │ └── Readme.md ├── 432.All-O-one-Data-Structure │ ├── 432.All-O-one-Data-Structure.cpp │ └── Readme.md ├── 460.LFU-Cache │ ├── 460.LFU Cache.cpp │ ├── 460.LFU-Cache_v2.cpp │ └── Readme.md ├── 535.Encode-and-Decode-TinyURL │ ├── 535.Encode and Decode TinyURL.cpp │ └── Readme.md ├── 631.Design-Excel-Sum-Formula │ ├── 631.Design-Excel-Sum-Formula.cpp │ └── Readme.md ├── 642.Design-Search-Autocomplete-System │ ├── 642.Design-Search-Autocomplete-System.cpp │ └── Readme.md ├── 716.Max-Stack │ ├── 716.Max-Stack.cpp │ └── Readme.md └── 895.Maximum-Frequency-Stack │ ├── 895.Maximum-Frequency-Stack.cpp │ └── Readme.md ├── Divide_Conquer ├── 1649.Create-Sorted-Array-through-Instructions │ ├── 1649.Create-Sorted-Array-through-Instructions_BIT.cpp │ ├── 1649.Create-Sorted-Array-through-Instructions_DivideConque.cpp │ ├── 1649.Create-Sorted-Array-through-Instructions_SegmentTree.cpp │ ├── 1649.Create-Sorted-Array-through-Instructions_pbds.cpp │ └── Readme.md ├── 2426.Number-of-Pairs-Satisfying-Inequality │ ├── 2426.Number-of-Pairs-Satisfying-Inequality.cpp │ └── Readme.md ├── 315.Count-of-Smaller-Numbers-After-Self │ ├── 315.Count-of-Smaller-Numbers-After-Self-v2.cpp │ ├── 315.Count-of-Smaller-Numbers-After-Self.cpp │ └── Readme.md ├── 327.Count-of-Range-Sum │ ├── 327.Count-of-Range-Sum.cpp │ └── Readme.md └── 493.Reverse-Pairs │ ├── 493.Reverse-Pairs_v1.cpp │ ├── 493.Reverse-Pairs_v2.cpp │ └── Readme.md ├── Dynamic_Programming ├── 010.Regular-Expression-Matching │ ├── 10.Regular-Expression-Matching.cpp │ └── Readme.md ├── 044.Wildcard-Matching │ ├── 044.Wildcard-Matching.cpp │ └── Readme.md ├── 053.Maximum-Subarray │ ├── 053.Maximum-Subarray.cpp │ └── Readme.md ├── 072.Edit-Distance │ ├── 072.Edit-Distance.cpp │ └── Readme.md ├── 091.Decode-Ways │ ├── 091.Decode_Ways.cpp │ └── Readme.md ├── 096.Unique-Binary-Search-Trees │ ├── 096.Unique-Binary-Search-Trees.cpp │ └── Readme.md ├── 097.Interleaving-String │ ├── 097.Interleaving-String.cpp │ └── Readme.md ├── 1000.Minimum-Cost-to-Merge-Stones │ ├── 1000.Minimum-Cost-to-Merge-Stones.cpp │ └── Readme.md ├── 1027.Longest-Arithmetic-Sequence │ ├── 1027.Longest-Arithmetic-Sequence.cpp │ └── Readme.md ├── 1035.Uncrossed-Lines │ ├── 1035.Uncrossed-Lines.cpp │ └── Readme.md ├── 1039.Minimum-Score-Triangulation-of-Polygon │ ├── 1039.Minimum-Score-Triangulation-of-Polygon.cpp │ └── Readme.md ├── 1043.Partition-Array-for-Maximum-Sum │ ├── 1043.Partition-Array-for-Maximum-Sum.cpp │ └── Readme.md ├── 1049.Last-Stone-Weight-II │ ├── 1049.Last-Stone-Weight-II.cpp │ ├── 1049.Last-Stone-Weight-II_v2.cpp │ └── Readme.md ├── 1092.Shortest-Common-Supersequence │ ├── 1092.Shortest-Common-Supersequence_v1.cpp │ ├── 1092.Shortest-Common-Supersequence_v2.cpp │ └── Readme.md ├── 1105.Filling-Bookcase-Shelves │ ├── 1105.Filling-Bookcase-Shelves.cpp │ └── Readme.md ├── 1125.Smallest-Sufficient-Team │ ├── 1125.Smallest-Sufficient-Team.cpp │ └── Readme.md ├── 1130.Minimum-Cost-Tree-From-Leaf-Values │ ├── 1130.Minimum-Cost-Tree-From-Leaf-Values_DP.cpp │ ├── 1130.Minimum-Cost-Tree-From-Leaf-Values_stack.cpp │ └── Readme.md ├── 1143.Longest-Common-Subsequence │ ├── 1143.Longest-Common-Subsequence.cpp │ └── Readme.md ├── 115.Distinct-Subsequences │ ├── 115.Distinct-Subsequences.cpp │ ├── 115.Distinct-Subsequences.py │ └── Readme.md ├── 1186.Maximum-Subarray-Sum-with-One-Deletion │ ├── 1186.Maximum-Subarray-Sum-with-One-Deletion.cpp │ └── Readme.md ├── 1187.Make-Array-Strictly-Increasing │ ├── 1187.Make-Array-Strictly-Increasing.cpp │ └── Readme.md ├── 120.Triangle │ ├── 120.Triangle.cpp │ └── Readme.md ├── 1216.Valid-Palindrome-III │ ├── 1216.Valid-Palindrome-III.cpp │ └── Readme.md ├── 1223.Dice-Roll-Simulation │ ├── 1223.Dice-Roll-Simulation.cpp │ └── Readme.md ├── 123.Best-Time-to-Buy-and-Sell-Stock-III │ ├── 123.Best-Time-to-Buy-and-Sell-Stock-III.py │ └── Readme.md ├── 1246.Palindrome-Removal │ ├── 1246.Palindrome-Removal.cpp │ └── Readme.md ├── 1259.Handshakes-That-Don't-Cross │ ├── 1259.Handshakes-That-Don't-Cross.cpp │ └── Readme.md ├── 1262.Greatest-Sum-Divisible-by-Three │ ├── 1262.Greatest-Sum-Divisible-by-Three.cpp │ └── Readme.md ├── 1269.Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps │ ├── 1269.Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps.cpp │ └── Readme.md ├── 1277.Count-Square-Submatrices-with-All-Ones │ ├── 1277.Count-Square-Submatrices-with-All-Ones.cpp │ └── Readme.md ├── 1278.Palindrome-Partitioning-III │ ├── 1278.Palindrome-Partitioning-III.cpp │ └── Readme.md ├── 1289.Minimum-Falling-Path-Sum-II │ ├── 1289.Minimum-Falling-Path-Sum-II.cpp │ └── Readme.md ├── 1301.Number-of-Paths-with-Max-Score │ ├── 1301.Number-of-Paths-with-Max-Score.cpp │ └── Readme.md ├── 131.Palindrome-Partitioning │ ├── 131.Palindrome-Partitioning.cpp │ ├── 131.Palindrome-Partitioning.py │ └── Readme.md ├── 1312.Minimum-Insertion-Steps-to-Make-a-String-Palindrome │ ├── 1312.Minimum-Insertion-Steps-to-Make-a-String-Palindrome.cpp │ ├── 1312.Minimum-Insertion-Steps-to-Make-a-String-Palindrome_v2.cpp2 │ └── Readme.md ├── 1316.Distinct-Echo-Substrings │ ├── 1316.Distinct-Echo-Substrings.cpp │ └── Readme.md ├── 132.Palindrome-Partitioning-II │ ├── 132.Palindrome-Partitioning-II.cpp │ ├── 132.Palindrome-Partitioning-II.py │ └── Readme.md ├── 1320.Minimum-Distance-to-Type-a-Word-Using-Two-Fingers │ ├── 1320.Minimum-Distance-to-Type-a-Word-Using-Two-Fingers_v1.cpp │ ├── 1320.Minimum-Distance-to-Type-a-Word-Using-Two-Fingers_v2.cpp │ └── Readme.md ├── 1335.Minimum-Difficulty-of-a-Job-Schedule │ ├── 1335.Minimum-Difficulty-of-a-Job-Schedule.cpp │ └── Readme.md ├── 1349.Maximum-Students-Taking-Exam │ ├── 1349.Maximum-Students-Taking-Exam.cpp │ └── Readme.md ├── 1363.Largest-Multiple-of-Three │ ├── 1363.Largest-Multiple-of-Three_v1.cpp │ ├── 1363.Largest-Multiple-of-Three_v2.cpp │ └── Readme.md ├── 1388.Pizza-With-3n-Slices │ ├── 1388.Pizza-With-3n-Slices.cpp │ └── Readme.md ├── 1411.Number-of-Ways-to-Paint-N×3-Grid │ ├── 1411.Number-of-Ways-to-Paint-N×3-Grid_v1.cpp │ ├── 1411.Number-of-Ways-to-Paint-N×3-Grid_v2.cpp │ └── Readme.md ├── 1416.Restore-The-Array │ ├── 1416.Restore-The-Array.cpp │ └── Readme.md ├── 1419.Minimum-Number-of-Frogs-Croaking │ ├── 1419.Minimum-Number-of-Frogs-Croaking.cpp │ └── Readme.md ├── 1420.Build-Array-Where-You-Can-Find-The-Maximum-Exactly-K-Comparisons │ ├── 1420.Build-Array-Where-You-Can-Find-The-Maximum-Exactly-K-Comparisons.cpp │ └── Readme.md ├── 1434.Number-of-Ways-to-Wear-Different-Hats-to-Each-Other │ ├── 1434.Number-of-Ways-to-Wear-Different-Hats-to-Each-Other.cpp │ └── Readme.md ├── 1449.Form-Largest-Integer-With-Digits-That-Add-up-to-Target │ ├── 1449.Form-Largest-Integer-With-Digits-That-Add-up-to-Target.cpp │ └── Readme.md ├── 1458.Max-Dot-Product-of-Two-Subsequences │ ├── 1458.Max-Dot-Product-of-Two-Subsequences.cpp │ └── Readme.md ├── 1463.Cherry-Pickup-II │ ├── 1463.Cherry-Pickup-II.cpp │ └── Readme.md ├── 1473.Paint-House-III │ ├── 1473.Paint-House-III_v1.cpp │ ├── 1473.Paint-House-III_v2.cpp │ └── Readme.md ├── 1478.Allocate-Mailboxes │ ├── 1478.Allocate-Mailboxes.cpp │ └── Readme.md ├── 1494.Parallel-Courses-II │ ├── 1494.Parallel-Courses-II.cpp │ ├── 1494.Parallel-Courses-II_v2.cpp │ └── Readme.md ├── 152.Maximum-Product-Subarray │ ├── 152.Maximum-Product-Subarray_DP.cpp │ └── Readme.md ├── 1531.String-Compression-II │ ├── 1531.String-Compression-II.cpp │ └── Readme.md ├── 1546.Maximum-Number-of-Non-Overlapping-Subarrays-With-Sum-Equals-Target │ ├── 1546.Maximum-Number-of-Non-Overlapping-Subarrays-With-Sum-Equals-Target_v1.cpp │ ├── 1546.Maximum-Number-of-Non-Overlapping-Subarrays-With-Sum-Equals-Target_v2.cpp │ └── Readme.md ├── 1547.Minimum-Cost-to-Cut-a-Stick │ ├── 1547.Minimum-Cost-to-Cut-a-Stick.cpp │ └── Readme.md ├── 1548.The-Most-Similar-Path-in-a-Graph │ ├── 1548.The-Most-Similar-Path-in-a-Graph.cpp │ └── Readme.md ├── 1563.Stone-Game-V │ ├── 1563.Stone-Game-V_dp.cpp │ ├── 1563.Stone-Game-V_recursion.cpp │ └── Readme.md ├── 1575.Count-All-Possible-Routes │ ├── 1575.Count-All-Possible-Routes_v1.cpp │ ├── 1575.Count-All-Possible-Routes_v2.cpp │ ├── 1575.Count-All-Possible-Routes_v3.cpp │ └── Readme.md ├── 1594.Maximum-Non-Negative-Product-in-a-Matrix │ ├── 1594.Maximum-Non-Negative-Product-in-a-Matrix.cpp │ └── Readme.md ├── 1595.Minimum-Cost-to-Connect-Two-Groups-of-Points │ ├── 1595.Minimum-Cost-to-Connect-Two-Groups-of-Points.cpp │ └── Readme.md ├── 1621.Number-of-Sets-of-K-Non-Overlapping-Line-Segments │ ├── 1621.Number-of-Sets-of-K-Non-Overlapping-Line-Segments.cpp │ ├── 1621.Number-of-Sets-of-K-Non-Overlapping-Line-Segments_v2.cpp │ └── Readme.md ├── 1626.Best-Team-With-No-Conflicts │ ├── 1626.Best-Team-With-No-Conflicts.cpp │ └── Readme.md ├── 1638.Count-Substrings-That-Differ-by-One-Character │ ├── 1638.Count-Substrings-That-Differ-by-One-Character.cpp │ └── Readme.md ├── 1639.Number-of-Ways-to-Form-a-Target-String-Given-a-Dictionary │ ├── 1639.Number-of-Ways-to-Form-a-Target-String-Given-a-Dictionary.cpp │ └── Readme.md ├── 1655.Distribute-Repeating-Integers │ ├── 1655.Distribute-Repeating-Integers.cpp │ └── Readme.md ├── 1659.Maximize-Grid-Happiness │ ├── 1659.Maximize-Grid-Happiness.cpp │ └── Readme.md ├── 1681.Minimum-Incompatibility │ ├── 1681.Minimum-Incompatibility_v1.cpp │ ├── 1681.Minimum-Incompatibility_v2.cpp │ └── Readme.md ├── 1682.Longest-Palindromic-Subsequence-II │ ├── 1682.Longest-Palindromic-Subsequence-II_v1.cpp │ ├── 1682.Longest-Palindromic-Subsequence-II_v2.cpp │ └── Readme.md ├── 1690.Stone-Game-VII │ ├── 1690.Stone-Game-VII.cpp │ └── Readme.md ├── 1691.Maximum-Height-by-Stacking-Cuboids │ ├── 1691.Maximum-Height-by-Stacking-Cuboids_v1.cpp │ ├── 1691.Maximum-Height-by-Stacking-Cuboids_v2.cpp │ └── Readme.md ├── 1692.Count-Ways-to-Distribute-Candies │ ├── 1692.Count-Ways-to-Distribute-Candies.cpp │ └── Readme.md ├── 1723.Find-Minimum-Time-to-Finish-All-Jobs │ ├── 1723.Find-Minimum-Time-to-Finish-All-Jobs_v1.cpp │ ├── 1723.Find-Minimum-Time-to-Finish-All-Jobs_v2.cpp │ ├── 1723.Find-Minimum-Time-to-Finish-All-Jobs_v3.cpp │ └── Readme.md ├── 174.Dungeon-Game │ ├── 174.Dungeon-Game.cpp │ └── Readme.md ├── 1745.Palindrome-Partitioning-IV │ ├── 1745.Palindrome-Partitioning-IV.cpp │ └── Readme.md ├── 1746.Maximum-Subarray-Sum-After-One-Operation │ ├── 1746.Maximum-Subarray-Sum-After-One-Operation.cpp │ └── Readme.md ├── 1770.Maximum-Score-from-Performing-Multiplication-Operations │ ├── 1770.Maximum-Score-from-Performing-Multiplication-Operations.cpp │ └── Readme.md ├── 1771.Maximize-Palindrome-Length-From-Subsequences │ ├── 1771.Maximize-Palindrome-Length-From-Subsequences_v1.cpp │ ├── 1771.Maximize-Palindrome-Length-From-Subsequences_v2.cpp │ └── Readme.md ├── 1787.Make-the-XOR-of-All-Segments-Equal-to-Zero │ ├── 1787.Make-the-XOR-of-All-Segments-Equal-to-Zero.cpp │ └── Readme.md ├── 1799.Maximize-Score-After-N-Operations │ ├── 1799.Maximize-Score-After-N-Operations_v1.cpp │ ├── 1799.Maximize-Score-After-N-Operations_v2.cpp │ └── Readme.md ├── 1824.Minimum-Sideway-Jumps │ ├── 1824.Minimum-Sideway-Jumps.cpp │ └── Readme.md ├── 1839.Longest-Substring-Of-All-Vowels-in-Order │ ├── 1839.Longest-Substring-Of-All-Vowels-in-Order.cpp │ └── Readme.md ├── 1872.Stone-Game-VIII │ ├── 1872.Stone-Game-VIII.cpp │ └── Readme.md ├── 188.Best-Time-to-Buy-and-Sell-Stock-IV │ ├── 188.Best-Time-to-Buy-and-Sell-Stock-IV.cpp │ ├── 188.Best-Time-to-Buy-and-Sell-Stock-IV_v2.cpp │ └── Readme.md ├── 1883.Minimum-Skips-to-Arrive-at-Meeting-On-Time │ ├── 1883.Minimum-Skips-to-Arrive-at-Meeting-On-Time.cpp │ └── Readme.md ├── 1884.Egg-Drop-With-2-Eggs-and-N-Floors │ ├── 1884.Egg-Drop-With-2-Eggs-and-N-Floors.cpp │ └── Readme.md ├── 1900.The-Earliest-and-Latest-Rounds-Where-Players-Compete │ ├── 1900.The-Earliest-and-Latest-Rounds-Where-Players-Compete_dp.cpp │ ├── 1900.The-Earliest-and-Latest-Rounds-Where-Players-Compete_greedy.py │ └── Readme.md ├── 1909.Remove-One-Element-to-Make-the-Array-Strictly-Increasing │ ├── 1909.Remove-One-Element-to-Make-the-Array-Strictly-Increasing.cpp │ ├── 1909.Remove-One-Element-to-Make-the-Array-Strictly-Increasing_v2.cpp │ ├── 1909.Remove-One-Element-to-Make-the-Array-Strictly-Increasing_v3.cpp │ ├── 1909.Remove-One-Element-to-Make-the-Array-Strictly-Increasing_v4.cpp │ └── Readme.md ├── 1931.Painting-a-Grid-With-Three-Different-Colors │ ├── 1931.Painting-a-Grid-With-Three-Different-Colors.cpp │ └── Readme.md ├── 1937.Maximum-Number-of-Points-with-Cost │ ├── 1937.Maximum-Number-of-Points-with-Cost.cpp │ └── Readme.md ├── 1947.Maximum-Compatibility-Score-Sum │ ├── 1947.Maximum-Compatibility-Score-Sum_v1.cpp │ ├── 1947.Maximum-Compatibility-Score-Sum_v2.cpp │ └── Readme.md ├── 1955.Count-Number-of-Special-Subsequences │ ├── 1955.Count-Number-of-Special-Subsequences.cpp │ └── Readme.md ├── 1959.minimum-total-space-wasted-with-k-resizing-operations │ ├── 1959.minimum-total-space-wasted-with-k-resizing-operations.cpp │ └── Readme.md ├── 1977.Number-of-Ways-to-Separate-Numbers │ ├── 1977.Number-of-Ways-to-Separate-Numbers.cpp │ └── Readme.md ├── 198.House-Robber │ ├── 198.House-Robber.cpp │ └── Readme.md ├── 1981.Minimize-the-Difference-Between-Target-and-Chosen-Elements │ ├── 1981.Minimize-the-Difference-Between-Target-and-Chosen-Elements.cpp │ └── Readme.md ├── 1986.Minimum-Number-of-Work-Sessions-to-Finish-the-Tasks │ ├── 1986.Minimum-Number-of-Work-Sessions-to-Finish-the-Tasks.cpp │ └── Readme.md ├── 1987.Number-of-Unique-Good-Subsequences │ ├── 1987.Number-of-Unique-Good-Subsequences_v1.cpp │ ├── 1987.Number-of-Unique-Good-Subsequences_v2.cpp │ └── Readme.md ├── 1994.The-Number-of-Good-Subsets │ ├── 1994.The-Number-of-Good-Subsets_v1.cpp │ ├── 1994.The-Number-of-Good-Subsets_v2.cpp │ └── Readme.md ├── 2036.Maximum-Alternating-Subarray-Sum │ ├── 2036.Maximum-Alternating-Subarray-Sum.cpp │ └── Readme.md ├── 2044.Count-Number-of-Maximum-Bitwise-OR-Subsets │ ├── 2044.Count-Number-of-Maximum-Bitwise-OR-Subsets.cpp │ └── Readme.md ├── 2052.Minimum-Cost-to-Separate-Sentence-Into-Rows │ ├── 2052.Minimum-Cost-to-Separate-Sentence-Into-Rows.cpp │ └── Readme.md ├── 2088.Count-Fertile-Pyramids-in-a-Land │ ├── 2088.Count-Fertile-Pyramids-in-a-Land.cpp │ └── Readme.md ├── 213.House-Robber-II │ ├── 213.House-Robber-II.cpp │ ├── 213.House-Robber-II_v2.cpp │ └── Readme.md ├── 2140.Solving-Questions-With-Brainpower │ ├── 2140.Solving-Questions-With-Brainpower_v1.cpp │ ├── 2140.Solving-Questions-With-Brainpower_v2.cpp │ ├── 2140.Solving-Questions-With-Brainpower_v3.cpp │ └── Readme.md ├── 2143.Choose-Numbers-From-Two-Arrays-in-Range │ ├── 2143.Choose-Numbers-From-Two-Arrays-in-Range.cpp │ └── Readme.md ├── 2152.Minimum-Number-of-Lines-to-Cover-Points │ ├── 2152.Minimum-Number-of-Lines-to-Cover-Points.cpp │ └── Readme.md ├── 2172.Maximum-AND-Sum-of-Array │ ├── 2172.Maximum-AND-Sum-of-Array_v1.cpp │ ├── 2172.Maximum-AND-Sum-of-Array_v2.cpp │ └── Readme.md ├── 2184.Number-of-Ways-to-Build-Sturdy-Brick-Wall │ ├── 2184.Number-of-Ways-to-Build-Sturdy-Brick-Wall.cpp │ └── Readme.md ├── 2188.Minimum-Time-to-Finish-the-Race │ ├── 2188.Minimum-Time-to-Finish-the-Race.cpp │ └── Readme.md ├── 2189.Number-of-Ways-to-Build-House-of-Cards │ ├── 2189.Number-of-Ways-to-Build-House-of-Cards.cpp │ └── Readme.md ├── 2209.Minimum-White-Tiles-After-Covering-With-Carpets │ ├── 2209.Minimum-White-Tiles-After-Covering-With-Carpets.cpp │ └── Readme.md ├── 221.Maximal-Square │ ├── 221.Maximal-Square_brutal.cpp │ ├── 221.Maximal-Square_dp.cpp │ ├── 221.Maximal-Square_stack.cpp │ └── Readme.md ├── 2214.Minimum-Health-to-Beat-Game │ ├── 2214.Minimum-Health-to-Beat-Game.cpp │ └── Readme.md ├── 2218.Maximum-Value-of-K-Coins-From-Piles │ ├── 2218.Maximum-Value-of-K-Coins-From-Piles.cpp │ └── Readme.md ├── 2222.Number-of-Ways-to-Select-Buildings │ ├── 2222.Number-of-Ways-to-Select-Buildings.cpp │ └── Readme.md ├── 2247.Maximum-Cost-of-Trip-With-K-Highways │ ├── 2247.Maximum-Cost-of-Trip-With-K-Highways.cpp │ └── Readme.md ├── 2267.Check-if-There-Is-a-Valid-Parentheses-String-Path │ ├── 2267.Check-if-There-Is-a-Valid-Parentheses-String-Path.cpp │ ├── 2267.Check-if-There-Is-a-Valid-Parentheses-String-Path_v2.cpp │ └── Readme.md ├── 2272.Substring-With-Largest-Variance │ ├── 2272.Substring-With-Largest-Variance_v1.cpp │ ├── 2272.Substring-With-Largest-Variance_v2.cpp │ └── Readme.md ├── 2291.Maximum-Profit-From-Trading-Stocks │ ├── 2291.Maximum-Profit-From-Trading-Stocks.cpp │ └── Readme.md ├── 2312.Selling-Pieces-of-Wood │ ├── 2312.Selling-Pieces-of-Wood.cpp │ └── Readme.md ├── 2318.Number-of-Distinct-Roll-Sequences │ ├── 2318.Number-of-Distinct-Roll-Sequences.cpp │ └── Readme.md ├── 2320.Count-Number-of-Ways-to-Place-Houses │ ├── 2320.Count-Number-of-Ways-to-Place-Houses_v1.cpp │ ├── 2320.Count-Number-of-Ways-to-Place-Houses_v2.cpp │ ├── 2320.Count-Number-of-Ways-to-Place-Houses_v3.cpp │ └── Readme.md ├── 2321.Maximum-Score-Of-Spliced-Array │ ├── 2321.Maximum-Score-Of-Spliced-Array.cpp │ └── Readme.md ├── 2338.Count-the-Number-of-Ideal-Arrays │ ├── 2338.Count-the-Number-of-Ideal-Arrays.cpp │ └── Readme.md ├── 2361.Minimum-Costs-Using-the-Train-Line │ ├── 2361.Minimum-Costs-Using-the-Train-Line.cpp │ └── Readme.md ├── 2403.Minimum-Time-to-Kill-All-Monsters │ ├── 2403.Minimum-Time-to-Kill-All-Monsters.cpp │ └── Readme.md ├── 2430.Maximum-Deletions-on-a-String │ ├── 2430.Maximum-Deletions-on-a-String.cpp │ └── Readme.md ├── 2431.Maximize-Total-Tastiness-of-Purchased-Fruits │ ├── 2431.Maximize-Total-Tastiness-of-Purchased-Fruits.cpp │ └── Readme.md ├── 2435.Paths-in-Matrix-Whose-Sum-Is-Divisible-by-K │ ├── 2435.Paths-in-Matrix-Whose-Sum-Is-Divisible-by-K.cpp │ └── Readme.md ├── 2463.Minimum-Total-Distance-Traveled │ ├── 2463.Minimum-Total-Distance-Traveled.cpp │ └── Readme.md ├── 2464.Minimum-Subarrays-in-a-Valid-Split │ ├── 2464.Minimum-Subarrays-in-a-Valid-Split.cpp │ └── Readme.md ├── 2472.Maximum-Number-of-Non-overlapping-Palindrome-Substrings │ ├── 2472.Maximum-Number-of-Non-overlapping-Palindrome-Substrings.cpp │ └── Readme.md ├── 2478.Number-of-Beautiful-Partitions │ ├── 2478.Number-of-Beautiful-Partitions_v1.cpp │ ├── 2478.Number-of-Beautiful-Partitions_v2.cpp │ └── Readme.md ├── 2484.Count-Palindromic-Subsequences │ ├── 2484.Count-Palindromic-Subsequences.cpp │ └── Readme.md ├── 2518.Number-of-Great-Partitions │ ├── 2518.Number-of-Great-Partitions.cpp │ └── Readme.md ├── 2522.Partition-String-Into-Substrings-With-Values-at-Most-K │ ├── 2522.Partition-String-Into-Substrings-With-Values-at-Most-K.cpp │ └── Readme.md ├── 2547.Minimum-Cost-to-Split-an-Array │ ├── 2547.Minimum-Cost-to-Split-an-Array.cpp │ └── Readme.md ├── 2572.Count-the-Number-of-Square-Free-Subsets │ ├── 2572.Count-the-Number-of-Square-Free-Subsets.cpp │ └── Readme.md ├── 2585.Number-of-Ways-to-Earn-Points │ ├── 2585.Number-of-Ways-to-Earn-Points.cpp │ └── Readme.md ├── 2638.Count-the-Number-of-K-Free-Subsets │ ├── 2638.Count-the-Number-of-K-Free-Subsets.cpp │ └── Readme.md ├── 264.Ugly-Number-II │ ├── 264.Ugly-Number-II_dp.cpp │ ├── 264.Ugly-Number-II_pq.cpp │ └── Readme.md ├── 265.Paint-House-II │ ├── 265.Paint-House-II.cpp │ ├── 265.Paint-House-II_v2.cpp │ └── Readme.md ├── 2713.Maximum-Strictly-Inreasing-Cells-in-a-Matrix │ ├── 2713.Maximum-Strictly-Inreasing-Cells-in-a-Matrix.cpp │ └── Reamdme.md ├── 2742.Painting-the-Walls │ ├── 2742.Painting-the-Walls_v1.cpp │ ├── 2742.Painting-the-Walls_v2.cpp │ └── Readme.md ├── 276.Paint-Fence │ ├── 276.Paint-Fence.cpp │ └── Readme.md ├── 2786.Visit-Array-Positions-to-Maximize-Score │ ├── 2786.Visit-Array-Positions-to-Maximize-Score.cpp │ └── Readme.md ├── 2787.Ways-to-Express-an-Integer-as-Sum-of-Powers │ ├── 2787.Ways-to-Express-an-Integer-as-Sum-of-Powers_v1.cpp │ ├── 2787.Ways-to-Express-an-Integer-as-Sum-of-Powers_v2.cpp │ └── Readme.md ├── 2809.Minimum-Time-to-Make-Array-Sum-At-Most-x │ ├── 2809.Minimum-Time-to-Make-Array-Sum-At-Most-x.cpp │ └── Readme.md ├── 2826.Sorting-Three-Groups │ ├── 2826.Sorting-Three-Groups.cpp │ └── Readme.md ├── 2830.Maximize-the-Profit-as-the-Salesman │ ├── 2830.Maximize-the-Profit-as-the-Salesman.cpp │ └── Readme.md ├── 2851.String-Transformation │ ├── 2851.String-Transformation.cpp │ └── Readme.md ├── 2896.Apply-Operations-to-Make-Two-Strings-Equal │ ├── 2896.Apply-Operations-to-Make-Two-Strings-Equal_v1.cpp │ ├── 2896.Apply-Operations-to-Make-Two-Strings-Equal_v2.cpp │ └── Readme.md ├── 2902.Count-of-Sub-Multisets-With-Bounded-Sum │ ├── 2902.Count-of-Sub-Multisets-With-Bounded-Sum.cpp │ └── Readme.md ├── 2911.Minimum-Changes-to-Make-K-Semi-palindromes │ ├── 2911.Minimum-Changes-to-Make-K-Semi-palindromes.cpp │ └── Readme.md ├── 2979.Most-Expensive-Item-That-Can-Not-Be-Bought │ ├── 2979.Most-Expensive-Item-That-Can-Not-Be-Bought.cpp │ └── Readme.md ├── 3018.Maximum-Number-of-Removal-Queries-That-Can-Be-Processed-I │ ├── 3018.Maximum-Number-of-Removal-Queries-That-Can-Be-Processed-I.cpp │ └── Readme.md ├── 3041.Maximize-Consecutive-Elements-in-an-Array-After-Modification │ ├── 3041.Maximize-Consecutive-Elements-in-an-Array-After-Modification.cpp │ └── Readme.md ├── 3077.Maximum-Strength-of-K-Disjoint-Subarrays │ ├── 3077.Maximum-Strength-of-K-Disjoint-Subarrays.cpp │ └── Readme.md ├── 3082.Find-the-Sum-of-the-Power-of-All-Subsequences │ ├── 3082.Find-the-Sum-of-the-Power-of-All-Subsequences.cpp │ └── Readme.md ├── 309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown │ ├── 309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.py │ └── Readme.md ├── 3098.Find-the-Sum-of-Subsequence-Powers │ ├── 3098.Find-the-Sum-of-Subsequence-Powers.cpp │ └── Readme.md ├── 3122.Minimum-Number-of-Operations-to-Satisfy-Conditions │ ├── 3122.Minimum-Number-of-Operations-to-Satisfy-Conditions.cpp │ └── Readme.md ├── 313.Super-Ugly-Number │ ├── 313.Super-Ugly-Numbe_dp.cpp │ ├── 313.Super-Ugly-Numbe_pq.cpp │ ├── 313.Super-Ugly-Number_dp_pq.cpp │ └── Readme.md ├── 3130.Find-All-Possible-Stable-Binary-Arrays-II │ ├── 3130.Find-All-Possible-Stable-Binary-Arrays-II_v1.cpp │ ├── 3130.Find-All-Possible-Stable-Binary-Arrays-II_v2.cpp │ └── Readme.md ├── 3177.Find-the-Maximum-Length-of-a-Good-Subsequence-II │ ├── 3177.Find-the-Maximum-Length-of-a-Good-Subsequence-II_v1.cpp │ ├── 3177.Find-the-Maximum-Length-of-a-Good-Subsequence-II_v2.cpp │ └── Readme.md ├── 3186.Maximum-Total-Damage-With-Spell-Casting │ ├── 3186.Maximum-Total-Damage-With-Spell-Casting.cpp │ └── Readme.md ├── 3193.Count-the-Number-of-Inversions │ ├── 3193.Count-the-Number-of-Inversions.cpp │ └── Readme.md ├── 3196.Maximize-Total-Cost-of-Alternating-Subarrays │ ├── 3196.Maximize-Total-Cost-of-Alternating-Subarrays.cpp │ └── Readme.md ├── 3202.Find-the-Maximum-Length-of-Valid-Subsequence-II │ ├── 3202.Find-the-Maximum-Length-of-Valid-Subsequence-II.cpp │ └── Readme.md ├── 322.Coin-Change │ ├── 322.Coin Change.cpp │ └── Readme.md ├── 3389.Minimum-Operations-to-Make-Character-Frequencies-Equal │ ├── 3389.Minimum-Operations-to-Make-Character-Frequencies-Equal.cpp │ └── Readme.md ├── 3444.Minimum-Increments-for-Target-Multiples-in-an-Array │ ├── 3444.Minimum-Increments-for-Target-Multiples-in-an-Array.cpp │ └── Readme.md ├── 3489.Zero-Array-Transformation-IV │ ├── 3489.Zero-Array-Transformation-IV.cpp │ └── Readme.md ├── 3538.Merge-Operations-for-Minimum-Travel-Time │ ├── 3538.Merge-Operations-for-Minimum-Travel-Time.cpp │ └── Readme.md ├── 3579.Minimum-Steps-to-Convert-String-with-Operations │ ├── 3579.Minimum-Steps-to-Convert-String-with-Operations.cpp │ └── Readme.md ├── 3592.Inverse-Coin-Change │ ├── 3592.Inverse-Coin-Change.cpp │ └── Readme.md ├── 3654.Minimum-Sum-After-Divisible-Sum-Deletions │ ├── 3654.Minimum-Sum-After-Divisible-Sum-Deletions.cpp │ └── Readme.md ├── 3661.Maximum-Walls-Destroyed-by-Robots │ ├── 3661.Maximum-Walls-Destroyed-by-Robots.cpp │ └── Readme.md ├── 3665.Twisted-Mirror-Path-Count │ ├── 3665.Twisted-Mirror-Path-Count.cpp │ └── Readme.md ├── 368.Largest-Divisible-Subset │ ├── 368.Largest-Divisible-Subset.cpp │ └── Readme.md ├── 3685.Subsequence-Sum-After-Capping-Elements │ ├── 3685.Subsequence-Sum-After-Capping-Elements.cpp │ └── Readme.md ├── 3699.Number-of-ZigZag-Arrays-I │ ├── 3699.Number-of-ZigZag-Arrays-I.cpp │ └── Readme.md ├── 375.Guess-Number-Higher-or-Lower-II │ ├── 375.Guess-Number-Higher-or-Lower-II.cpp │ └── Readme.md ├── 376.Wiggle-Subsequence │ ├── 376.Wiggle-Subsequence_DP.cpp │ ├── 376.Wiggle-Subsequence_v1.cpp │ └── Readme.md ├── 377.Combination-Sum-IV │ ├── 377.Combination-Sum-IV.cpp │ ├── 377.Combination-Sum-IV.py │ └── Readme.md ├── 410.Split-Array-Largest-Sum │ ├── 410.Split Array Largest Sum_Binary.cpp │ ├── 410.Split Array Largest Sum_dp.cpp │ └── Readme.md ├── 416.Partition-Equal-Subset-Sum │ ├── 416.Partition-Equal-Subset-Sum.cpp │ ├── 416.Partition-Equal-Subset-Sum_dfs_v1.cpp │ ├── 416.Partition-Equal-Subset-Sum_dfs_v2.cpp │ ├── 416.Partition-Equal-Subset-Sum_dp_v2.cpp │ ├── 416.Partition-Equal-Subset-Sum_dp_v3.cpp │ └── Readme.md ├── 465.Optimal-Account-Balancing │ ├── 465.Optimal-Account-Balancing.cpp │ └── Readme.md ├── 471.Encode-String-with-Shortest-Length │ ├── 471.Encode-String-with-Shortest-Length.cpp │ └── Readme.md ├── 474.Ones-and-Zeroes │ ├── 474.Ones-and-Zeroes.cpp │ └── Readme.md ├── 487.Max-Consecutive-Ones-II │ ├── 487.Max-Consecutive-Ones-II.cpp │ └── Readme.md ├── 494.Target-Sum │ ├── 494.Target-Sum-DFS.py │ ├── 494.Target-Sum-DP.py │ ├── 494.Target-Sum_DP_v2.cpp │ ├── 494.Target-Sum_DP_v3.cpp │ └── Readme.md ├── 514.Freedom-Trail │ ├── 514.Freedom-Trail.cpp │ └── Readme.md ├── 516.Longest-Palindromic-Subsequence │ ├── 516.Longest-Palindromic-Subsequence.cpp │ ├── 516.Longest-Palindromic-Subsequence.py │ └── Readme.md ├── 518.Coin-Change-2 │ ├── 518.Coin-Change-2_v1.cpp │ ├── 518.Coin-Change-2_v2.cpp │ └── Readme.md ├── 552.Student-Attendance-Record-II │ ├── 552.Student-Attendance-Record-II.cpp │ └── Readme.md ├── 576.Out-of-Boundary-Paths │ ├── 576.Out-of-Boundary-Paths.cpp │ └── Readme.md ├── 583.Delete-Operation-for-Two-Strings │ ├── 583.Delete-Operation-for-Two-Strings.cpp │ ├── 583.Delete-Operation-for-Two-Strings_v2.cpp │ └── Readme.md ├── 600.Non-negative-Integers-without-Consecutive-Ones │ ├── 600.Non-negative-Integers-without-Consecutive-Ones.cpp │ └── Readme.md ├── 629.K-Inverse-Pairs-Array │ ├── 629.K Inverse Pairs Array.cpp │ └── Readme.md ├── 634.Find-the-Derangement-of-An-Array │ ├── 634.Find-the-Derangement-of-An-Array.cpp │ └── Readme.md ├── 639.Decode-Ways-II │ ├── 639.Decode-Ways-II.cpp │ └── Readme.md ├── 644.Maximum-Average-Subarray-II │ ├── 644.Maximum-Average-Subarray-II.cpp │ ├── 644.Maximum-Average-Subarray-II_v2.cpp │ └── Readme.md ├── 650.2-Keys-Keyboard │ ├── 650.2-Keys-Keyboard.cpp │ ├── 650.2-Keys-Keyboard_dp.cpp │ └── Readme.md ├── 651.4-Keys-Keyboard │ ├── 651.4-Keys-Keyboard.cpp │ └── Readme.md ├── 656.Coin-Path │ ├── 656.Coin-Path.cpp │ └── Readme.md ├── 664.Strange-Printer │ ├── 664.Strange-Printer.cpp │ └── Readme.md ├── 673.Number-of-Longest-Increasing-Subsequence │ ├── 673.Number-of-Longest-Increasing-Subsequence.cpp │ └── Readme.md ├── 691.Stickers-to-Spell-Word │ ├── 691.Stickers-to-Spell-Word.cpp │ └── Readme.md ├── 712.Minimum-ASCII-Delete-Sum-for-Two-Strings │ ├── 712.Minimum-ASCII-Delete-Sum-for-Two-Strings.cpp │ └── Readme.md ├── 714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee │ ├── 714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.py │ └── Readme.md ├── 718.Maximum-Length-of-Repeated-Subarray │ ├── 718.Maximum-Length-of-Repeated-Subarray.cpp │ └── Readme.md ├── 730.Count-Different-Palindromic-Subsequences │ ├── 730.Count-Different-Palindromic-Subsequences.cpp │ ├── 730.Count-Different-Palindromic-Subsequences_v2.cpp │ └── Readme.md ├── 740.Delete-and-Earn │ ├── 740.Delete-and-Earn.cpp │ ├── 740.Delete-and-Earn_v2.cpp │ └── Readme.md ├── 741.Cherry-Pickup │ ├── 741.Cherry-Pickup.cpp │ ├── 741.Cherry-Pickup.py │ └── Readme.md ├── 801.Minimum-Swaps-To-Make-Sequences-Increasing │ ├── 801.Minimum-Swaps-To-Make-Sequences-Increasing.cpp │ └── Readme.md ├── 805.Split-Array-With-Same-Average │ ├── 805.Split-Array-With-Same-Average_DFS.cpp │ ├── 805.Split-Array-With-Same-Average_DP1.cpp │ ├── 805.Split-Array-With-Same-Average_DP2.cpp │ └── Readme.md ├── 813.Largest-Sum-of-Averages │ ├── 813.Largest-Sum-of-Averages.cpp │ └── Readme.md ├── 818.Race-Car │ ├── 818.Race-Car.cpp │ ├── 818.Race-Car_BFS.cpp │ └── Readme.md ├── 823.Binary-Trees-With-Factors │ └── 823.Binary-Trees-With-Factors.cpp ├── 837.New-21-Game │ ├── 837.New-21-Game.cpp │ └── Readme.md ├── 879.Profitable-Schemes │ ├── 879.Profitable-Schemes.cpp │ └── Readme.md ├── 887.Super-Egg-Drop │ ├── 887.Super-Egg-Drop.py │ ├── 891.Super-Egg-Drop.cpp │ └── Readme.md ├── 903.Valid-Permutations-for-DI-Sequence │ ├── 903.Valid-Permutations-for-DI-Sequence.cpp │ └── Readme.md ├── 920.Number-of-Music-Playlists │ ├── 920.Number-of-Music-Playlists.cpp │ └── Readme.md ├── 931.Minimum-Falling-Path-Sum │ ├── 931.Minimum-Falling-Path-Sum.cpp │ └── Readme.md ├── 935.Knight-Dialer │ ├── 935.Knight-Dialer.cpp │ └── Readme.md ├── 940.Distinct-Subsequences-II │ ├── 940.Distinct-Subsequences-II.py │ ├── 940.Distinct-Subsequences-II_v1.cpp │ ├── 940.Distinct-Subsequences-II_v2.cpp │ └── Readme.md ├── 943.Find-the-Shortest-Superstring │ ├── 943.Find-the-Shortest-Superstring.cpp │ └── Readme.md ├── 956.Tallest-Billboard │ ├── 956.Tallest-Billboard.cpp │ └── Readme.md ├── 960.Delete-Columns-to-Make-Sorted-III │ ├── 960.Delete-Columns-to-Make-Sorted-III.cpp │ └── Readme.md └── 983.Minimum-Cost-For-Tickets │ ├── 983.Minimum-Cost-For-Tickets.cpp │ └── Readme.md ├── Graph ├── 1059.All-Paths-from-Source-Lead-to-Destination │ ├── 1059.All-Paths-from-Source-Lead-to-Destination.cpp │ └── Readme.md ├── 1334.Find-the-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance │ ├── 1334.Find-the-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance.cpp │ └── Readme.md ├── 1514.Path-with-Maximum-Probability │ ├── 1514.Path-with-Maximum-Probability_bfs.cpp │ ├── 1514.Path-with-Maximum-Probability_dijkstra.cpp │ └── Readme.md ├── 1719.Number-Of-Ways-To-Reconstruct-A-Tree │ ├── 1719.Number-Of-Ways-To-Reconstruct-A-Tree_v1.cpp │ ├── 1719.Number-Of-Ways-To-Reconstruct-A-Tree_v2.cpp │ └── Readme.md ├── 1761.Minimum-Degree-of-a-Connected-Trio-in-a-Graph │ ├── 1761.Minimum-Degree-of-a-Connected-Trio-in-a-Graph.cpp │ └── Readme.md ├── 1782.Count-Pairs-Of-Nodes │ ├── 1782.Count-Pairs-Of-Nodes.cpp │ └── Readme.md ├── 1820.Maximum-Number-of-Accepted-Invitations │ ├── 1820.Maximum-Number-of-Accepted-Invitations.cpp │ └── Readme.md ├── 2097.Valid-Arrangement-of-Pairs │ ├── 2097.Valid-Arrangement-of-Pairs.cpp │ └── Readme.md ├── 2123.Minimum-Operations-to-Remove-Adjacent-Ones-in-Matrix │ ├── 2123.Minimum-Operations-to-Remove-Adjacent-Ones-in-Matrix.cpp │ └── Readme.md ├── 2360.Longest-Cycle-in-a-Graph │ ├── 2360.Longest-Cycle-in-a-Graph.cpp │ └── Readme.md ├── 2508.Add-Edges-to-Make-Degrees-of-All-Nodes-Even │ ├── 2508.Add-Edges-to-Make-Degrees-of-All-Nodes-Even.cpp │ └── Readme.md ├── 2556.Disconnect-Path-in-a-Binary-Matrix-by-at-Most-One-Flip │ ├── 2556.Disconnect-Path-in-a-Binary-Matrix-by-at-Most-One-Flip.cpp │ └── Readme.md ├── 2603.Collect-Coins-in-a-Tree │ ├── 2603.Collect-Coins-in-a-Tree.cpp │ └── Readme.md ├── 2608.Shortest-Cycle-in-a-Graph │ ├── 2608.Shortest-Cycle-in-a-Graph.cpp │ └── Readme.md ├── 2642.Design-Graph-With-Shortest-Path-Calculator │ ├── 2642.Design-Graph-With-Shortest-Path-Calculator.cpp │ └── Readme.md ├── 2699.Modify-Graph-Edge-Weights │ ├── 2699.Modify-Graph-Edge-Weights.cpp │ └── Readme.md ├── 2791.Count-Paths-That-Can-Form-a-Palindrome-in-a-Tree │ ├── 2791.Count-Paths-That-Can-Form-a-Palindrome-in-a-Tree.cpp │ └── Readme.md ├── 2876.Count-Visited-Nodes-in-a-Directed-Graph │ ├── 2876.Count-Visited-Nodes-in-a-Directed-Graph.cpp │ └── Readme.md ├── 2959.Number-of-Possible-Sets-of-Closing-Branches │ ├── 2959.Number-of-Possible-Sets-of-Closing-Branches.cpp │ └── Readme.md ├── 2976.Minimum-Cost-to-Convert-String-I │ ├── 2976.Minimum-Cost-to-Convert-String-I.cpp │ └── Readme.md ├── 3017.Count-the-Number-of-Houses-at-a-Certain-Distance-II │ ├── 3017.Count-the-Number-of-Houses-at-a-Certain-Distance-II.cpp │ └── Readme.md ├── 3112.Minimum-Time-to-Visit-Disappearing-Nodes │ ├── 3112.Minimum-Time-to-Visit-Disappearing-Nodes.cpp │ └── Readme.md ├── 3123.Find-Edges-in-Shortest-Paths │ ├── 3123.Find-Edges-in-Shortest-Paths.cpp │ └── Readme.md ├── 3387.Maximize-Amount-After-Two-Days-of-Conversions │ ├── 3387.Maximize-Amount-After-Two-Days-of-Conversions.cpp │ └── Readme.md └── 787.Cheapest-Flights-Within-K-Stops │ ├── 787.Cheapest-Flights-Within-K-Stops.py │ ├── 787.Cheapest-Flights-Within-K-Stops_DP.cpp │ ├── 787.Cheapest-Flights-Within-K-Stops_Dijkstra.cpp │ └── Readme.md ├── Greedy ├── 031.Next-Permutation │ ├── 031.Next-Permutation.cpp │ └── Readme.md ├── 041.First-Missing-Positive │ ├── 041.First-Missing-Positive.cpp │ └── Readme.md ├── 045.Jump-Game-II │ ├── 045.Jump-Game-II.cpp │ └── Readme.md ├── 055.Jump-Game │ ├── 055.Jump-Game.cpp │ └── Readme.md ├── 1024.Video-Stitching │ ├── 1024.Video-Stitching.cpp │ └── Readme.md ├── 1040.Moving-Stones-Until-Consecutive-II │ ├── 1040.Moving-Stones-Until-Consecutive-II.cpp │ └── Readme.md ├── 1054.Distant-Barcodes │ ├── 1054.Distant-Barcodes_v1.cpp │ ├── 1054.Distant-Barcodes_v2.cpp │ └── Readme.md ├── 1055.Shortest-Way-to-Form-String │ ├── 1055.Shortest-Way-to-Form-String.cpp │ └── Readme.md ├── 1191.K-Concatenation-Maximum-Sum │ ├── 1191.K-Concatenation-Maximum-Sum.cpp │ └── Readme.md ├── 1235.Maximum-Profit-in-Job-Scheduling │ ├── 1235.Maximum-Profit-in-Job-Scheduling_v1.cpp │ ├── 1235.Maximum-Profit-in-Job-Scheduling_v2.cpp │ └── Readme.md ├── 1249.Minimum-Remove-to-Make-Valid-Parentheses │ ├── 1249.Minimum-Remove-to-Make-Valid-Parentheses.cpp │ └── Readme.md ├── 1253.Reconstruct-a-2-Row-Binary-Matrix │ ├── 1253.Reconstruct-a-2-Row-Binary-Matrix.cpp │ └── Readme.md ├── 1272.Remove-Interval │ ├── 1272.Remove-Interval.cpp │ └── Readme.md ├── 1288.Remove-Covered-Intervals │ ├── 1288.Remove-Covered-Intervals.cpp │ └── Readme.md ├── 1326.Minimum-Number-of-Taps-to-Open-to-Water-a-Garden │ ├── 1326.Minimum-Number-of-Taps-to-Open-to-Water-a-Garden.cpp │ └── Readme.md ├── 134.Gas-Station │ ├── 134.Gas-Station.cpp │ └── Readme.md ├── 135.Candy │ ├── 135.Candy.cpp │ └── Readme.md ├── 1354.Construct-Target-Array-With-Multiple-Sums │ ├── 1354.Construct-Target-Array-With-Multiple-Sums.cpp │ └── Readme.md ├── 1402.Reducing-Dishes │ ├── 1402.Reducing-Dishes.cpp │ └── Readme.md ├── 1405.Longest-Happy-String │ ├── 1405.Longest-Happy-String.cpp │ └── Readme.md ├── 1414.Find-the-Minimum-Number-of-Fibonacci-Numbers-Whose-Sum-Is-K │ ├── 1414.Find-the-Minimum-Number-of-Fibonacci-Numbers-Whose-Sum-Is-K.cpp │ └── Readme.md ├── 1505.Minimum-Possible-Integer-After-at-Most-K-Adjacent-Swaps-On-Digits │ ├── 1505.Minimum-Possible-Integer-After-at-Most-K-Adjacent-Swaps-On-Digits.cpp │ └── Readme.md ├── 1520.Maximum-Number-of-Non-Overlapping-Substrings │ ├── 1520.Maximum-Number-of-Non-Overlapping-Substrings.cpp │ └── Readme.md ├── 1525.Number-of-Good-Ways-to-Split-a-String │ ├── 1525.Number-of-Good-Ways-to-Split-a-String.cpp │ └── Readme.md ├── 1535.Find-the-Winner-of-an-Array-Game │ ├── 1535.Find-the-Winner-of-an-Array-Game.cpp │ └── Readme.md ├── 1536.Minimum-Swaps-to-Arrange-a-Binary-Grid │ ├── 1536.Minimum-Swaps-to-Arrange-a-Binary-Grid.cpp │ └── Readme.md ├── 1540.Can-Convert-String-in-K-Moves │ ├── 1540.Can-Convert-String-in-K-Moves.cpp │ └── Readme.md ├── 1541.Minimum-Insertions-to-Balance-a-Parentheses-String │ ├── 1541.Minimum-Insertions-to-Balance-a-Parentheses-String.cpp │ └── Readme.md ├── 1564.Put-Boxes-Into-the-Warehouse-I │ ├── 1564.Put-Boxes-Into-the-Warehouse-I.cpp │ └── Readme.md ├── 1567.Maximum-Length-of-Subarray-With-Positive-Product │ ├── 1567.Maximum-Length-of-Subarray-With-Positive-Product.cpp │ └── Readme.md ├── 1578.Minimum-Deletion-Cost-to-Avoid-Repeating-Letters │ ├── 1578.Minimum-Deletion-Cost-to-Avoid-Repeating-Letters.cpp │ └── Readme.md ├── 1585.Check-If-String-Is-Transformable-With-Substring-Sort-Operations │ ├── 1585.Check-If-String-Is-Transformable-With-Substring-Sort-Operations.cpp │ └── Readme.md ├── 164.Maximum-Gap │ ├── 164.Maximum Gap.cpp │ └── Readme.md ├── 1653.Minimum-Deletions-to-Make-String-Balanced │ ├── 1653.Minimum-Deletions-to-Make-String-Balanced.cpp │ └── Readme.md ├── 1657.Determine-if-Two-Strings-Are-Close │ ├── 1657.Determine-if-Two-Strings-Are-Close.cpp │ └── Readme.md ├── 1664.Ways-to-Make-a-Fair-Array │ ├── 1664.Ways-to-Make-a-Fair-Array.cpp │ └── Readme.md ├── 1665.Minimum-Initial-Energy-to-Finish-Tasks │ ├── 1665.Minimum-Initial-Energy-to-Finish-Tasks.cpp │ └── Readme.md ├── 1671.Minimum-Number-of-Removals-to-Make-Mountain-Array │ ├── 1671.Minimum-Number-of-Removals-to-Make-Mountain-Array_v1.cpp │ ├── 1671.Minimum-Number-of-Removals-to-Make-Mountain-Array_v2.cpp │ └── Readme.md ├── 1686.Stone-Game-VI │ ├── 1686.Stone-Game-VI.cpp │ └── Readme.md ├── 1702.Maximum-Binary-String-After-Change │ ├── 1702.Maximum-Binary-String-After-Change.cpp │ └── Readme.md ├── 1713.Minimum-Operations-to-Make-a-Subsequence │ ├── 1713.Minimum-Operations-to-Make-a-Subsequence.cpp │ └── Readme.md ├── 1717.Maximum-Score-From-Removing-Substrings │ ├── 1717.Maximum-Score-From-Removing-Substrings.cpp │ └── Readme.md ├── 1727.Largest-Submatrix-With-Rearrangements │ ├── 1727.Largest-Submatrix-With-Rearrangements.cpp │ └── Readme.md ├── 1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day │ ├── 1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day.cpp │ └── Readme.md ├── 1751.Maximum-Number-of-Events-That-Can-Be-Attended-II │ ├── 1751.Maximum-Number-of-Events-That-Can-Be-Attended-II.cpp │ └── Readme.md ├── 1769.Minimum-Number-of-Operations-to-Move-All-Balls-to-Each-Box │ ├── 1769.Minimum-Number-of-Operations-to-Move-All-Balls-to-Each-Box.cpp │ └── Readme.md ├── 1788.Maximize-the-Beauty-of-the-Garden │ ├── 1788.Maximize-the-Beauty-of-the-Garden.cpp │ └── Readme.md ├── 179.Largest-Number │ ├── 179.Largest-Number.cpp │ └── Readme.md ├── 1798.Maximum-Number-of-Consecutive-Values-You-Can-Make │ ├── 1798.Maximum-Number-of-Consecutive-Values-You-Can-Make.cpp │ ├── 1798.Maximum-Number-of-Consecutive-Values-You-Can-Make_TLE.cpp │ └── Readme.md ├── 1818.Minimum-Absolute-Sum-Difference │ ├── 1818.Minimum-Absolute-Sum-Difference.cpp │ └── Readme.md ├── 1840.Maximum-Building-Height │ ├── 1840.Maximum-Building-Height.cpp │ └── Readme.md ├── 1846.Maximum-Element-After-Decreasing-and-Rearranging │ ├── 1846.Maximum-Element-After-Decreasing-and-Rearranging.cpp │ └── Readme.md ├── 1850.Minimum-Adjacent-Swaps-to-Reach-the-Kth-Smallest-Number │ ├── 1850.Minimum-Adjacent-Swaps-to-Reach-the-Kth-Smallest-Number.cpp │ └── Readme.md ├── 1888.Minimum-Number-of-Flips-to-Make-the-Binary-String-Alternating │ ├── 1888.Minimum-Number-of-Flips-to-Make-the-Binary-String-Alternating.cpp │ └── Readme.md ├── 1911.Maximum-Alternating-Subsequence-Sum │ ├── 1911.Maximum-Alternating-Subsequence-Sum_dp.cpp │ ├── 1911.Maximum-Alternating-Subsequence-Sum_greedy.cpp │ └── Readme.md ├── 1963.minimum-number-of-swaps-to-make-the-string-balanced │ ├── 1963.minimum-number-of-swaps-to-make-the-string-balanced.cpp │ └── Readme.md ├── 1964.Find-the-Longest-Valid-Obstacle-Course-at-Each-Position │ ├── 1964.Find-the-Longest-Valid-Obstacle-Course-at-Each-Position.cpp │ └── Readme.md ├── 1982.Find-Array-Given-Subset-Sums │ ├── 1982.Find-Array-Given-Subset-Sums.cpp │ ├── 1982.Find-Array-Given-Subset-Sums_v2.cpp │ └── Readme.md ├── 1996.The-Number-of-Weak-Characters-in-the-Game │ ├── 1996.The-Number-of-Weak-Characters-in-the-Game.cpp │ └── Readme.md ├── 2007.Find-Original-Array-From-Doubled-Array │ ├── 2007.Find-Original-Array-From-Doubled-Array_v1.cpp │ ├── 2007.Find-Original-Array-From-Doubled-Array_v2.cpp │ └── Readme.md ├── 2008.Maximum-Earnings-From-Taxi │ ├── 2008.Maximum-Earnings-From-Taxi_v1.cpp │ ├── 2008.Maximum-Earnings-From-Taxi_v2.cpp │ └── Readme.md ├── 2054.Two-Best-Non-Overlapping-Events │ ├── 2054.Two-Best-Non-Overlapping-Events.cpp │ └── Readme.md ├── 2055.Plates-Between-Candles │ ├── 2055.Plates-Between-Candles.cpp │ └── Readme.md ├── 2086.Minimum-Number-of-Buckets-Required-to-Collect-Rainwater-from-Houses │ ├── 2086.Minimum-Number-of-Buckets-Required-to-Collect-Rainwater-from-Houses.cpp │ └── Readme.md ├── 2111.Minimum-Operations-to-Make-the-Array-K-Increasing │ ├── 2111.Minimum-Operations-to-Make-the-Array-K-Increasing.cpp │ └── Readme.md ├── 2116.Check-if-a-Parentheses-String-Can-Be-Valid │ ├── 2116.Check-if-a-Parentheses-String-Can-Be-Valid_v1.cpp │ ├── 2116.Check-if-a-Parentheses-String-Can-Be-Valid_v2.cpp │ └── Readme.md ├── 2122.Recover-the-Original-Array │ ├── 2122.Recover-the-Original-Array.cpp │ └── Readme.md ├── 2136.Earliest-Possible-Day-of-Full-Bloom │ ├── 2136.Earliest-Possible-Day-of-Full-Bloom_v1.cpp │ ├── 2136.Earliest-Possible-Day-of-Full-Bloom_v2.cpp │ └── Readme.md ├── 2163.Minimum-Difference-in-Sums-After-Removal-of-Elements │ ├── 2163.Minimum-Difference-in-Sums-After-Removal-of-Elements.cpp │ └── Readme.md ├── 2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods │ ├── 2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods_v1.cpp │ ├── 2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods_v2.cpp │ └── Readme.md ├── 2170.Minimum-Operations-to-Make-the-Array-Alternating │ ├── 2170.Minimum-Operations-to-Make-the-Array-Alternating.cpp │ └── Readme.md ├── 2171.Removing-Minimum-Number-of-Magic-Beans │ ├── 2171.Removing-Minimum-Number-of-Magic-Beans.cpp │ └── Readme.md ├── 2182.Construct-String-With-Repeat-Limit │ ├── 2182.Construct-String-With-Repeat-Limit.cpp │ └── Readme.md ├── 2193.Minimum-Number-of-Moves-to-Make-Palindrome │ ├── 2193.Minimum-Number-of-Moves-to-Make-Palindrome_v1.cpp │ ├── 2193.Minimum-Number-of-Moves-to-Make-Palindrome_v2.cpp │ └── Readme.md ├── 2202.Maximize-the-Topmost-Element-After-K-Moves │ ├── 2202.Maximize-the-Topmost-Element-After-K-Moves.cpp │ └── Readme.md ├── 2216.Minimum-Deletions-to-Make-Array-Beautiful │ ├── 2216.Minimum-Deletions-to-Make-Array-Beautiful.cpp │ └── Readme.md ├── 2233.Maximum-Product-After-K-Increments │ ├── 2233.Maximum-Product-After-K-Increments.cpp │ └── Readme.md ├── 2234.Maximum-Total-Beauty-of-the-Gardens │ ├── 2234.Maximum-Total-Beauty-of-the-Gardens.cpp │ └── Readme.md ├── 2242.Maximum-Score-of-a-Node-Sequence │ ├── 2242.Maximum-Score-of-a-Node-Sequence.cpp │ └── Readme.md ├── 2250.Count-Number-of-Rectangles-Containing-Each-Point │ ├── 2250.Count-Number-of-Rectangles-Containing-Each-Point.cpp │ └── Readme.md ├── 2257.Count-Unguarded-Cells-in-the-Grid │ ├── 2257.Count-Unguarded-Cells-in-the-Grid.cpp │ └── Readme.md ├── 2262.Total-Appeal-of-A-String │ ├── 2262.Total-Appeal-of-A-String_v1.cpp │ ├── 2262.Total-Appeal-of-A-String_v2.cpp │ └── Readme.md ├── 2263.Make-Array-Non-decreasing-or-Non-increasing │ ├── 2263.Make-Array-Non-decreasing-or-Non-increasing.cpp │ └── Readme.md ├── 2271.Maximum-White-Tiles-Covered-by-a-Carpet │ ├── 2271.Maximum-White-Tiles-Covered-by-a-Carpet.cpp │ └── Readme.md ├── 2275.Largest-Combination-With-Bitwise-AND-Greater-Than-Zero │ ├── 2275.Largest-Combination-With-Bitwise-AND-Greater-Than-Zero.cpp │ └── Readme.md ├── 229.Majority-Element-II │ ├── 229.Majority-Element-II.cpp │ └── Readme.md ├── 2306.Naming-a-Company │ ├── 2306.Naming-a-Company.cpp │ └── Readme.md ├── 2311.Longest-Binary-Subsequence-Less-Than-or-Equal-to-K │ ├── 2311.Longest-Binary-Subsequence-Less-Than-or-Equal-to-K_v1.cpp │ ├── 2311.Longest-Binary-Subsequence-Less-Than-or-Equal-to-K_v2.cpp │ └── Readme.md ├── 2332.The-Latest-Time-to-Catch-a-Bus │ ├── 2332.The-Latest-Time-to-Catch-a-Bus.cpp │ └── Readme.md ├── 2333.Minimum-Sum-of-Squared-Difference │ ├── 2333.Minimum-Sum-of-Squared-Difference.cpp │ └── Readme.md ├── 2343.Query-Kth-Smallest-Trimmed-Number │ ├── 2343.Query-Kth-Smallest-Trimmed-Number.cpp │ └── Readme.md ├── 2345.Finding-the-Number-of-Visible-Mountains │ ├── 2345.Finding-the-Number-of-Visible-Mountains.cpp │ └── Readme.md ├── 2350.Shortest-Impossible-Sequence-of-Rolls │ ├── 2350.Shortest-Impossible-Sequence-of-Rolls.cpp │ └── Readme.md ├── 2365.Task-Scheduler-II │ ├── 2365.Task-Scheduler-II.cpp │ └── Readme.md ├── 2366.Minimum-Replacements-to-Sort-the-Array │ ├── 2366.Minimum-Replacements-to-Sort-the-Array.cpp │ ├── 2366.Minimum-Replacements-to-Sort-the-Array_v2.cpp │ └── Readme.md ├── 2370.Longest-Ideal-Subsequence │ ├── 2370.Longest-Ideal-Subsequence_v1.cpp │ ├── 2370.Longest-Ideal-Subsequence_v2.cpp │ └── Readme.md ├── 2371.Minimize-Maximum-Value-in-a-Grid │ ├── 2371.Minimize-Maximum-Value-in-a-Grid.cpp │ └── Readme.md ├── 2375.Construct-Smallest-Number-From-DI-String │ ├── 2375.Construct-Smallest-Number-From-DI-String.cpp │ └── Readme.md ├── 2412.Minimum-Money-Required-Before-Transactions │ ├── 2412.Minimum-Money-Required-Before-Transactions.cpp │ └── Readme.md ├── 2449.Minimum-Number-of-Operations-to-Make-Arrays-Similar │ ├── 2449.Minimum-Number-of-Operations-to-Make-Arrays-Similar.cpp │ └── Readme.md ├── 2457.Minimum-Addition-to-Make-Integer-Beautiful │ ├── 2457.Minimum-Addition-to-Make-Integer-Beautiful.cpp │ └── Readme.md ├── 2459.Sort-Array-by-Moving-Items-to-Empty-Space │ ├── 2459.Sort-Array-by-Moving-Items-to-Empty-Space.cpp │ └── Readme.md ├── 2471.Minimum-Number-of-Operations-to-Sort-a-Binary-Tree-by-Level │ ├── 2471.Minimum-Number-of-Operations-to-Sort-a-Binary-Tree-by-Level.cpp │ └── Readme.md ├── 2498.Frog-Jump-II │ ├── 2498.Frog-Jump-II.cpp │ └── Readme.md ├── 2499.minimum-total-cost-to-make-arrays-unequal │ ├── 2499.minimum-total-cost-to-make-arrays-unequal.cpp │ └── Readme.md ├── 2546.Apply-Bitwise-Operations-to-Make-Strings-Equal │ ├── 2546.Apply-Bitwise-Operations-to-Make-Strings-Equal.cpp │ └── Readme.md ├── 2551.Put-Marbles-in-Bags │ ├── 2551.Put-Marbles-in-Bags.cpp │ └── Readme.md ├── 2555.Maximize-Win-From-Two-Segments │ ├── 2555.Maximize-Win-From-Two-Segments.cpp │ └── Readme.md ├── 2561.Rearranging-Fruits │ ├── 2561.Rearranging-Fruits.cpp │ └── Readme.md ├── 2565.Subsequence-With-the-Minimum-Score │ ├── 2565.Subsequence-With-the-Minimum-Score.cpp │ └── Readme.md ├── 2567.Minimum-Score-by-Changing-Two-Elements │ ├── 2567.Minimum-Score-by-Changing-Two-Elements.cpp │ └── Readme.md ├── 2568.Minimum-Impossible-OR │ ├── 2568.Minimum-Impossible-OR_v1.cpp │ ├── 2568.Minimum-Impossible-OR_v2.cpp │ └── Readme.md ├── 2571.Minimum-Operations-to-Reduce-an-Integer-to-0 │ ├── 2571.Minimum-Operations-to-Reduce-an-Integer-to-0.cpp │ └── Readme.md ├── 2573.Find-the-String-with-LCP │ ├── 2573.Find-the-String-with-LCP.cpp │ └── Readme.md ├── 2576.Find-the-Maximum-Number-of-Marked-Indices │ ├── 2576.Find-the-Maximum-Number-of-Marked-Indices.cpp │ └── Readme.md ├── 2580.Count-Ways-to-Group-Overlapping-Ranges │ ├── 2580.Count-Ways-to-Group-Overlapping-Ranges.cpp │ └── Readme.md ├── 2589.Minimum-Time-to-Complete-All-Tasks │ ├── 2589.Minimum-Time-to-Complete-All-Tasks_v1.cpp │ ├── 2589.Minimum-Time-to-Complete-All-Tasks_v2.cpp │ └── Readme.md ├── 2598.Smallest-Missing-Non-negative-Integer-After-Operations │ ├── 2598.Smallest-Missing-Non-negative-Integer-After-Operations.cpp │ └── Readme.md ├── 2663.Lexicographically-Smallest-Beautiful-String │ ├── 2663.Lexicographically-Smallest-Beautiful-String.cpp │ └── Readme.md ├── 268.Missing-Number │ ├── 268.Missing-Number_v1.cpp │ ├── 268.Missing-Number_v2.cpp │ └── Readme.md ├── 2712.Minimum-Cost-to-Make-All-Characters-Equal │ ├── 2712.Minimum-Cost-to-Make-All-Characters-Equal_v1.cpp │ ├── 2712.Minimum-Cost-to-Make-All-Characters-Equal_v2.cpp │ └── Readme.md ├── 2732.Find-a-Good-Subset-of-the-Matrix │ ├── 2732.Find-a-Good-Subset-of-the-Matrix.cpp │ └── Readme.md ├── 2745.Construct-the-Longest-New-String │ ├── 2745.Construct-the-Longest-New-String.cpp │ └── Readme.md ├── 2749.Minimum-Operations-to-Make-the-Integer-Zero │ ├── 2749.Minimum-Operations-to-Make-the-Integer-Zero.cpp │ ├── 2749.Minimun-Operations-to-make-the-integer-Zero-PYTHON │ └── Readme.md ├── 2753.Count-Houses-in-a-Circular-Street-II │ ├── 2753.Count-Houses-in-a-Circular-Street-II.cpp │ └── Readme.md ├── 2813.Maximum-Elegance-of-a-K-Length-Subsequence │ ├── 2813.Maximum-Elegance-of-a-K-Length-Subsequence.cpp │ └── Readme.md ├── 2835.Minimum-Operations-to-Form-Subsequence-With-Target-Sum │ ├── 2835.Minimum-Operations-to-Form-Subsequence-With-Target-Sum.cpp │ └── Readme.md ├── 2856.Minimum-Array-Length-After-Pair-Removals │ ├── 2856.Minimum-Array-Length-After-Pair-Removals.cpp │ └── Readme.md ├── 2868.The-Wording-Game │ ├── 2868.The-Wording-Game.cpp │ └── Readme.md ├── 2871.Split-Array-Into-Maximum-Number-of-Subarrays │ ├── 2871.Split-Array-Into-Maximum-Number-of-Subarrays.cpp │ └── Readme.md ├── 2897.Apply-Operations-on-Array-to-Maximize-Sum-of-Squares │ ├── 2897.Apply-Operations-on-Array-to-Maximize-Sum-of-Squares.cpp │ └── Readme.md ├── 2983.Palindrome-Rearrangement-Queries │ ├── 2983.Palindrome-Rearrangement-Queries.cpp │ └── Readme.md ├── 300.Longest-Increasing-Subsequence │ ├── 300.Longest-Increasing-Subsequence_v1.cpp │ ├── 300.Longest-Increasing-Subsequence_v2.cpp │ └── Readme.md ├── 3012.Minimize-Length-of-Array-Using-Operations │ ├── 3012.Minimize-Length-of-Array-Using-Operations.cpp │ └── Readme.md ├── 3022.Minimize-OR-of-Remaining-Elements-Using-Operations │ ├── 3022.Minimize-OR-of-Remaining-Elements-Using-Operations.cpp │ └── Readme.md ├── 3027.Find-the-Number-of-Ways-to-Place-People-II │ ├── 3027.Find-the-Number-of-Ways-to-Place-People-II.cpp │ └── Readme.md ├── 3139.Minimum-Cost-to-Equalize-Array │ ├── 3139.Minimum-Cost-to-Equalize-Array.cpp │ └── Readme.md ├── 3219.Minimum-Cost-for-Cutting-Cake-II │ ├── 3219.Minimum-Cost-for-Cutting-Cake-II.cpp │ └── Readme.md ├── 330.Patching-Array │ ├── 330.Patching-Array.cpp │ └── Readme.md ├── 334.Increasing-Triplet-Subsequence │ ├── 334.Increasing-Triplet-Subsequence_v1.cpp │ ├── 334.Increasing-Triplet-Subsequence_v2.cpp │ └── Readme.md ├── 3394.Check-if-Grid-can-be-Cut-into-Sections │ ├── 3394.Check-if-Grid-can-be-Cut-into-Sections.cpp │ └── Readme.md ├── 3413.Maximum-Coins-From-K-Consecutive-Bags │ ├── 3413.Maximum-Coins-From-K-Consecutive-Bags.cpp │ └── Readme.md ├── 3458.Select-K-Disjoint-Special-Substrings │ ├── 3458.Select-K-Disjoint-Special-Substrings.cpp │ ├── 3458.Select-K-Disjoint-Special-Substrings_v2.cpp │ └── Readme.md ├── 354.Russian-Doll-Envelopes │ ├── 354.Russian-Doll-Envelopes_v1.cpp │ ├── 354.Russian-Doll-Envelopes_v2.cpp │ └── Readme.md ├── 3551.Minimum-Swaps-to-Sort-by-Digit-Sum │ ├── 3551.Minimum-Swaps-to-Sort-by-Digit-Sum.cpp │ └── Readme.md ├── 3635.Earliest-Finish-Time-for-Land-and-Water-Rides-II │ ├── 3635.Earliest-Finish-Time-for-Land-and-Water-Rides-II.cpp │ └── Readme.md ├── 3696.Maximum-Distance-Between-Unequal-Words-in-Array-I │ ├── 3696.Maximum-Distance-Between-Unequal-Words-in-Array-I.cpp │ └── Readme.md ├── 386.Lexicographical-Numbers │ ├── 386.Lexicographical-Numbers.cpp │ └── Readme.md ├── 406.Queue-Reconstruction-by-Height │ ├── 406.Queue-Reconstruction-by-Height.cpp │ └── Readme.md ├── 435.Non-overlapping-Intervals │ ├── 435.Non-overlapping-Intervals.py │ ├── 435.Non-overlapping-Intervals_v1.cpp │ ├── 435.Non-overlapping-Intervals_v2.cpp │ └── Readme.md ├── 442.Find-All-Duplicates-in-an-Array │ ├── 442.Find-All-Duplicates-in-an-Array_v1.cpp │ ├── 442.Find-All-Duplicates-in-an-Array_v2.cpp │ └── Readme.md ├── 448.Find-All-Numbers-Disappeared-in-an-Array │ ├── 448.Find-All-Numbers-Disappeared-in-an-Array.cpp │ └── Readme.md ├── 452.Minimum-Number-of-Arrows-to-Burst-Balloons │ ├── 452.Minimum-Number-of-Arrows-to-Burst-Balloons.cpp │ ├── 452.Minimum-Number-of-Arrows-to-Burst-Balloons.py │ └── Readme.md ├── 484.Find-Permutation │ ├── 484.Find-Permutation.cpp │ ├── 484.Find-Permutation.py │ └── Readme.md ├── 517.Super-Washing-Machines │ ├── 517.Super-Washing-Machines.cpp │ ├── 517.Super-Washing-Machines.py │ └── Readme.md ├── 524.Longest-Word-in-Dictionary-through-Deleting │ ├── 524.Longest-Word-in-Dictionary-through-Deleting.cpp │ └── Readme.md ├── 556.Next-Greater-Element-III │ ├── 556.Next-Greater-Element-III.cpp │ └── Readme.md ├── 581.shortest-unsorted-continuous-subarray │ ├── 581.shortest-unsorted-continuous-subarray.cpp │ └── Readme.md ├── 624.Maximum-Distance-in-Arrays │ ├── 624.Maximum-Distance-in-Arrays.cpp │ └── Readme.md ├── 645.Set-Mismatch │ ├── 645.Set-Mismatch.cpp │ └── Readme.md ├── 646.Maximum-Length-of-Pair-Chain │ ├── 646.Maximum-Length-of-Pair-Chain.cpp │ └── Readme.md ├── 649.Dota2-Senate │ ├── 649.Dota2-Senate.cpp │ └── Readme.md ├── 659.Split-Array-into-Consecutive-Subsequences │ ├── 659.Split-Array-into-Consecutive-Subsequences.cpp │ └── Readme.md ├── 665.Non-decreasing-Array │ ├── 665.Non-decreasing-Array_v1.cpp │ ├── 665.Non-decreasing-Array_v2.cpp │ └── Readme.md ├── 667.Beautiful-Arrangement-II │ ├── 667.Beautiful-Arrangement-II.cpp │ └── Readme.md ├── 670.Maximum-Swap │ ├── 670.Maximum-Swap.cpp │ └── Readme.md ├── 678.Valid-Parenthesis-String │ ├── 678.Valid-Parenthesis-String.cpp │ └── Readme.md ├── 683.K-Empty-Slots │ ├── 683.K-Empty-Slots.cpp │ └── Readme.md ├── 689.Maximum-Sum-of-3-Non-Overlapping-Subarrays │ ├── 689.Maximum-Sum-of-3-Non-Overlapping-Subarrays.cpp │ └── Readme.md ├── 727.Minimum-Window-Subsequence │ ├── 727.Minimum-Window-Subsequence_v1.cpp │ ├── 727.Minimum-Window-Subsequence_v2.cpp │ └── Readme.md ├── 731.My-Calendar-II │ ├── 731.My-Calendar-II.cpp │ ├── 731.My-Calendar-II_v2.cpp │ └── Readme.md ├── 757.Set-Intersection-Size-At-Least-Two │ ├── 757.Set-Intersection-Size-At-Least-Two.cpp │ └── Readme.md ├── 761.Special-Binary-String │ ├── 761.Special-Binary-String.cpp │ └── Readme.md ├── 767.Reorganize-String │ ├── 767.Reorganize-String_v1.cpp │ ├── 767.Reorganize-String_v2.cpp │ └── Readme.md ├── 781.Rabbits-in-Forest │ ├── 781.Rabbits-in-Forest.cpp │ └── Readme.md ├── 792.Number-of-Matching-Subsequences │ ├── 792.Number-of-Matching-Subsequences_v1.cpp │ ├── 792.Number-of-Matching-Subsequences_v2.cpp │ └── Readme.md ├── 826.Most-Profit-Assigning-Work │ ├── 826.Most-Profit-Assigning-Work.cpp │ └── Readme.md ├── 828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String │ ├── 828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String_v1.cpp │ ├── 828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String_v2.cpp │ └── Readme.md ├── 870.Advantage-Shuffle │ └── 870.Advantage-Shuffle.cpp ├── 871.Minimum-Number-of-Refueling-Stops │ ├── 871.Minimum-Number-of-Refueling-Stops.cpp │ └── Readme.md ├── 881.Boats-to-Save-People │ ├── 881.Boats-to-Save-People_v1.cpp │ ├── 881.Boats-to-Save-People_v2.cpp │ ├── 881.Boats-to-Save-People_v3.cpp │ └── Readme.md ├── 910.Smallest-Range-II │ ├── 910.Smallest-Range-II.cpp │ └── Readme.md ├── 921.Minimum-Add-to-Make-Parentheses-Valid │ ├── 921.Minimum-Add-to-Make-Parentheses-Valid.cpp │ └── Readme.md ├── 932.Beautiful-Array │ ├── 932.Beautiful-Array.cpp │ └── Readme.md ├── 936.Stamping-The-Sequence │ ├── 936.Stamping-The-Sequence.cpp │ └── Readme.md ├── 942.DI-String-Match │ ├── 942.DI-String-Match.cpp │ └── Readme.md ├── 948.Bag-of-Tokens │ ├── 948.Bag-of-Tokens.cpp │ └── Readme.md ├── 955.Delete-Columns-to-Make-Sorted-II │ ├── 955.Delete-Columns-to-Make-Sorted-II.cpp │ └── Readme.md ├── 968.Binary-Tree-Cameras │ ├── 968.Binary-Tree-Cameras.cpp │ └── Readme.md └── 984.String-Without-AAA-or-BBB │ ├── 984.String-Without-AAA-or-BBB_greedy.cpp │ ├── 984.String-Without-AAA-or-BBB_pq.cpp │ └── Readme.md ├── Hash ├── 049.Group-Anagrams │ ├── 49.Group Anagrams.cpp │ └── Readme.md ├── 1074.Number-of-Submatrices-That-Sum-to-Target │ ├── 1074.Number-of-Submatrices-That-Sum-to-Target.cpp │ └── Readme.md ├── 1371.Find-the-Longest-Substring-Containing-Vowels-in-Even-Counts │ ├── 1371.Find-the-Longest-Substring-Containing-Vowels-in-Even-Counts.cpp │ └── Readme.md ├── 1487.Making-File-Names-Unique │ ├── 1487.Making-File-Names-Unique.cpp │ └── Readme.md ├── 149.Max-Points-on-a-Line │ ├── 149.Max-Points-on-a-Line.cpp │ ├── 149.Max-Points-on-a-Line.py │ ├── 149.Max-Points-on-a-Line_v2.cpp │ └── Readme.md ├── 1524.Number-of-Sub-arrays-With-Odd-Sum │ ├── 1524.Number-of-Sub-arrays-With-Odd-Sum.cpp │ └── Readme.md ├── 1542.Find-Longest-Awesome-Substring │ ├── 1542.Find-Longest-Awesome-Substring.cpp │ └── Readme.md ├── 1573.Number-of-Ways-to-Split-a-String │ ├── 1573.Number-of-Ways-to-Split-a-String.cpp │ └── Readme.md ├── 1590.Make-Sum-Divisible-by-P │ ├── 1590.Make-Sum-Divisible-by-P.cpp │ └── Readme.md ├── 1658.Minimum-Operations-to-Reduce-X-to-Zero │ ├── 1658.Minimum-Operations-to-Reduce-X-to-Zero.cpp │ └── Readme.md ├── 166.Fraction-to-Recurring-Decimal │ ├── 166.Fraction-to-Recurring-Decimal.cpp │ └── Readme.md ├── 170.Two-Sum-III-Data-structure-design │ ├── 170.Two Sum III - Data structure design.cpp │ └── Readme.md ├── 1915.Number-of-Wonderful-Substrings │ ├── 1915.Number-of-Wonderful-Substrings.cpp │ └── Readme.md ├── 1983.Widest-Pair-of-Indices-With-Equal-Range-Sum │ ├── 1983.Widest-Pair-of-Indices-With-Equal-Range-Sum.cpp │ └── Readme.md ├── 2025.Maximum-Number-of-Ways-to-Partition-an-Array │ ├── 2025.Maximum-Number-of-Ways-to-Partition-an-Array.cpp │ └── Readme.md ├── 2131.Longest-Palindrome-by-Concatenating-Two-Letter-Words │ ├── 2131.Longest-Palindrome-by-Concatenating-Two-Letter-Words.cpp │ └── Readme.md ├── 2198.Number-of-Single-Divisor-Triplets │ ├── 2198.Number-of-Single-Divisor-Triplets.cpp │ └── Readme.md ├── 2488.Count-Subarrays-With-Median-K │ ├── 2488.Count-Subarrays-With-Median-K.cpp │ └── Readme.md ├── 2489.Number-of-Substrings-With-Fixed-Ratio │ ├── 2489.Number-of-Substrings-With-Fixed-Ratio.cpp │ └── Readme.md ├── 2588.Count-the-Number-of-Beautiful-Subarrays │ ├── 2588.Count-the-Number-of-Beautiful-Subarrays.cpp │ ├── 2588.Count-the-Number-of-Beautiful-Subarrays_v2.cpp │ └── Readme.md ├── 274.H-Index │ ├── 274.H-Index_Hash.cpp │ ├── 274.H-Index_Hash.py │ ├── 274.H-index_Binary.cpp │ ├── 274.H-index_Pointer.cpp │ └── Readme.md ├── 2845.Count-of-Interesting-Subarrays │ ├── 2845.Count-of-Interesting-Subarrays.cpp │ └── Readme.md ├── 2875.Minimum-Size-Subarray-in-Infinite-Array │ ├── 2875.Minimum-Size-Subarray-in-Infinite-Array.cpp │ └── Readme.md ├── 2949.Count-Beautiful-Substrings-II │ ├── 2949.Count-Beautiful-Substrings-II.cpp │ └── Readme.md ├── 2950.Number-of-Divisible-Substrings │ ├── 2950.Number-of-Divisible-Substrings.cpp │ └── Readme.md ├── 325.Maximum-Size-Subarray-Sum-Equals-k │ ├── 325.Maximum Size Subarray Sum Equals k.cpp │ └── Readme.md ├── 3448.Count-Substrings-Divisible-By-Last-Digit │ ├── 3448.Count-Substrings-Divisible-By-Last-Digit.cpp │ └── Readme.md ├── 356.Line-Reflection │ ├── 356.Line Reflection.cpp │ └── Readme.md ├── 3714.Longest-Balanced-Substring-II │ ├── 3714.Longest-Balanced-Substring-II.cpp │ └── Readme.md ├── 392.Is-Subsequence │ ├── 392.Is Subsequence_s1.cpp │ ├── 392.Is Subsequence_s2.cpp │ └── Readme.md ├── 409.Longest-Palindrome │ ├── 409.Longest Palindrome.cpp │ └── Readme.md ├── 438.Find-All-Anagrams-in-a-String │ ├── 438.Find All Anagrams in a String.cpp │ └── Readme.md ├── 446.Arithmetic-Slices-II-Subsequence │ ├── 446.Arithmetic-Slices-II-Subsequence.cpp │ ├── 446.Arithmetic-Slices-II-Subsequence_v2.cpp │ └── Readme.md ├── 447.Number-of-Boomerangs │ ├── 447.Number of Boomerangs.cpp │ └── Readme.md ├── 525.Contiguous-Array │ ├── 525.Contiguous-Array.cpp │ └── Readme.md ├── 532.K-diff-Pairs-in-an-Array │ ├── 532.K-diff Pairs in an Array_Hash.cpp │ ├── 532.K-diff Pairs in an Array_TwoPointer.cpp │ └── Readme.md ├── 535.Encode-and-Decode-TinyURL │ ├── 535.Encode and Decode TinyURL.cpp │ └── Readme.md ├── 594.Longest-Harmonious-Subsequence │ ├── 594.Longest Harmonious Subsequence.cpp │ └── Readme.md ├── 753.Cracking-the-Safe │ ├── 753.Cracking-the-Safe.cpp │ └── Readme.md ├── 890.Find-and-Replace-Pattern │ ├── 890.Find-and-Replace-Pattern.cpp │ └── Readme.md ├── 930.Binary-Subarrays-With-Sum │ ├── 930.Binary-Subarrays-With-Sum.cpp │ ├── 930.Binary-Subarrays-With-Sum.py │ ├── 930.Binary-Subarrays-With-Sum_v2.cpp │ └── Readme.md ├── 939.Minimum-Area-Rectangle │ ├── 939.Minimum-Area-Rectangle.cpp │ └── Readme.md └── 974.Subarray-Sums-Divisible-by-K │ ├── 974.Subarray-Sums-Divisible-by-K.cpp │ └── Readme.md ├── LCCUP ├── 2020Fall │ ├── LCP23.魔术排列 │ │ ├── Readme.md │ │ └── code.cpp │ ├── LCP24.数字游戏 │ │ ├── Readme.md │ │ └── code.cpp │ └── LCP25.古董键盘 │ │ ├── Readme.md │ │ └── code.cpp ├── 2021Fall │ └── LCP43.十字路口的交通 │ │ ├── Readme.md │ │ └── code.cpp └── 2021Spring │ ├── LCP32.批量处理任务 │ ├── Readme.md │ └── code.cpp │ ├── LCP35.电动车游城市 │ ├── Readme.md │ └── code.cpp │ └── LCP36.最多牌组数 │ ├── Readme.md │ └── code.cpp ├── Linked_List ├── 025.Reverse-Nodes-in-k-Group │ ├── 025.Reverse-Nodes-in-k-Group.cpp │ ├── 025.Reverse-Nodes-in-k-Group.py │ ├── 025.Reverse-Nodes-in-k-Group_v2.cpp │ └── Readme.md ├── 061.Rotate-List │ ├── 061.Rotate-List.cpp │ └── Readme.md ├── 082.Remove-Duplicates-from-Sorted-List-II │ ├── 082.Remove-Duplicates-from-Sorted-List-II.cpp │ └── Readme.md ├── 086.Partition-List │ ├── 086.Partition-List_v1.cpp │ ├── 086.Partition-List_v2.cpp │ └── Readme.md ├── 092.Reverse-Linked-List-II │ ├── 092.Reverse-Linked-List-II.cpp │ ├── 092.Reverse-Linked-List-II_v2.cpp │ └── Readme.md ├── 109.Convert-Sorted-List-to-Binary-Search-Tree │ ├── 109.Convert Sorted List to Binary Search Tree.cpp │ └── Readme.md ├── 142.Linked-List-Cycle-II │ ├── 142.Linked-List-Cycle-II.cpp │ └── Readme.md ├── 143.Reorder-List │ ├── 143.Reorder-List.cpp │ ├── 143.Reorder-List.py │ ├── 143.Reorder-List_v2.cpp │ └── Readme.md ├── 1474.Delete-N-Nodes-After-M-Nodes-of-a-Linked-List │ ├── 1474.Delete-N-Nodes-After-M-Nodes-of-a-Linked-List.cpp │ └── Readme.md ├── 1670.Design-Front-Middle-Back-Queue │ ├── 1670.Design-Front-Middle-Back-Queue_v1.cpp │ ├── 1670.Design-Front-Middle-Back-Queue_v2.cpp │ └── Readme.md ├── 1756.Design-Most-Recently-Used-Queue │ ├── 1756.Design-Most-Recently-Used-Queue,cpp │ └── Readme.md ├── 2046.Sort-Linked-List-Already-Sorted-Using-Absolute-Values │ ├── 2046.Sort-Linked-List-Already-Sorted-Using-Absolute-Values.cpp │ └── Readme.md ├── 206.Reverse-Linked-List │ ├── 206.Reverse-Linked-List.cpp │ ├── 206.Reverse-Linked-List_Recursion.cpp │ └── Readme.md ├── 2074.Reverse-Nodes-in-Even-Length-Groups │ ├── 2074.Reverse-Nodes-in-Even-Length-Groups.cpp │ └── Readme.md ├── 369.Plus-One-Linked-List │ ├── 369.Plus-One-Linked-List.cpp │ └── Readme.md ├── 430.Flatten-a-Multilevel-Doubly-Linked-List │ ├── 430.Flatten-a-Multilevel-Doubly-Linked-List.cpp │ └── Readme.md ├── 457.Circular-Array-Loop │ ├── 457.Circular-Array-Loop.cpp │ └── Readme.md └── 708.Insert-into-a-Cyclic-Sorted-List │ ├── 708.Insert-into-a-Cyclic-Sorted-List.cpp │ └── Readme.md ├── Math ├── 046.Permutations │ ├── 046.Permutations.cpp │ ├── 046.Permutations.py │ └── Readme.md ├── 047.Permutations-II │ ├── 047.Permutations-II.py │ ├── 047.Permutations-II_iterative.cpp │ ├── 047.Permutations-II_recursive.cpp │ └── Readme.md ├── 060.Permutation-Sequence │ ├── 060.Permutation-Sequence.cpp │ └── Readme.md ├── 077.Combinations │ ├── 077.Combinations_interative.cpp │ ├── 077.Combinations_iterative.py │ ├── 077.Combinations_recursive.cpp │ ├── 077.Combinations_recursive.py │ └── Readme.md ├── 089.Gray-Code │ ├── 089.Gray-Code.cpp │ ├── 089.Gray-Code_v2.cpp │ └── Readme.md ├── 1012.Numbers-With-Repeated-Digits │ ├── 1012.Numbers-With-Repeated-Digits.cpp │ └── Readme.md ├── 1015.Smallest-Integer-Divisible-by-K │ ├── 1015.Smallest-Integer-Divisible-by-K.cpp │ └── Readme.md ├── 1017.Convert-to-Base--2 │ ├── 1017.Convert-to-Base--2.cpp │ └── Readme.md ├── 1025.Divisor-Game │ ├── 1025.Divisor-Game_v1.cpp │ ├── 1025.Divisor-Game_v2.cpp │ └── Readme.md ├── 1040.Moving-Stones-Until-Consecutive-II │ ├── 1040.Moving-Stones-Until-Consecutive-II.cpp │ └── Readme.md ├── 1073.Adding-Two-Negabinary-Numbers │ ├── 1073.Adding-Two-Negabinary-Numbers.cpp │ └── Readme.md ├── 1103.Distribute-Candies-to-People │ ├── 1103.Distribute-Candies-to-People.cpp │ └── Readme.md ├── 1131.Maximum-of-Absolute-Value-Expression │ ├── 1131.Maximum-of-Absolute-Value-Expression.cpp │ └── Readme.md ├── 1227.Airplane-Seat-Assignment-Probability │ ├── 1227.Airplane-Seat-Assignment-Probability.cpp │ └── Readme.md ├── 1250.Check-If-It-Is-a-Good-Array │ ├── 1250.Check-If-It-Is-a-Good-Array.cpp │ └── Readme.md ├── 1286.Iterator-for-Combination │ ├── 1286.Iterator-for-Combination.cpp │ └── Readme.md ├── 1359.Count-All-Valid-Pickup-and-Delivery-Options │ ├── 1359.Count-All-Valid-Pickup-and-Delivery-Options.cpp │ └── Readme.md ├── 1401.Circle-and-Rectangle-Overlapping │ ├── 1401.Circle-and-Rectangle-Overlapping.cpp │ └── Readme.md ├── 1453.Maximum-Number-of-Darts-Inside-of-a-Circular-Dartboard │ ├── 1453.Maximum-Number-of-Darts-Inside-of-a-Circular-Dartboard_v1.cpp │ ├── 1453.Maximum-Number-of-Darts-Inside-of-a-Circular-Dartboard_v2.cpp │ └── Readme.md ├── 1467.Probability-of-a-Two-Boxes-Having-The-Same-Number-of-Distinct-Balls │ ├── 1467.Probability-of-a-Two-Boxes-Having-The-Same-Number-of-Distinct-Balls.cpp │ └── Readme.md ├── 1605.Find-Valid-Matrix-Given-Row-and-Column-Sums │ ├── 1605.Find-Valid-Matrix-Given-Row-and-Column-Sums.cpp │ └── Readme.md ├── 1610.Maximum-Number-of-Visible-Points │ ├── 1610.Maximum-Number-of-Visible-Points.cpp │ └── Readme.md ├── 1641.Count-Sorted-Vowel-Strings │ ├── 1641.Count-Sorted-Vowel-Strings_dp.cpp │ ├── 1641.Count-Sorted-Vowel-Strings_math.cpp │ └── Readme.md ├── 1643.Kth-Smallest-Instructions │ ├── 1643.Kth-Smallest-Instructions.cpp │ └── Readme.md ├── 1680.Concatenation-of-Consecutive-Binary-Numbers │ ├── 1680.Concatenation-of-Consecutive-Binary-Numbers.cpp │ └── Readme.md ├── 1703.Minimum-Adjacent-Swaps-for-K-Consecutive-Ones │ ├── 1703.Minimum-Adjacent-Swaps-for-K-Consecutive-Ones.cpp │ └── Readme.md ├── 1735.Count-Ways-to-Make-Array-With-Product │ ├── 1735.Count-Ways-to-Make-Array-With-Product.cpp │ └── Readme.md ├── 1739.Building-Boxes │ ├── 1739.Building-Boxes.cpp │ └── Readme.md ├── 1806.Minimum-Number-of-Operations-to-Reinitialize-a-Permutation │ ├── 1806.Minimum-Number-of-Operations-to-Reinitialize-a-Permutation_v1.cpp │ ├── 1806.Minimum-Number-of-Operations-to-Reinitialize-a-Permutation_v2.cpp │ ├── 1806.Minimum-Number-of-Operations-to-Reinitialize-a-Permutation_v3.cpp │ └── Readme.md ├── 1808.Maximize-Number-of-Nice-Divisors │ ├── 1808.Maximize-Number-of-Nice-Divisors.cpp │ └── Readme.md ├── 1819.Number-of-Different-Subsequences-GCDs │ ├── 1819.Number-of-Different-Subsequences-GCDs.cpp │ └── Readme.md ├── 1830.Minimum-Number-of-Operations-to-Make-String-Sorted │ ├── 1830.Minimum-Number-of-Operations-to-Make-String-Sorted.cpp │ └── Readme.md ├── 1866.Number-of-Ways-to-Rearrange-Sticks-With-K-Sticks-Visible │ ├── 1866.Number-of-Ways-to-Rearrange-Sticks-With-K-Sticks-Visible.cpp │ └── Readme.md ├── 1916.Count-Ways-to-Build-Rooms-in-an-Ant-Colony │ ├── 1916.Count-Ways-to-Build-Rooms-in-an-Ant-Colony.cpp │ └── Readme.md ├── 1956.Minimum-Time-For-K-Virus-Variants-to-Spread │ ├── 1956.Minimum-Time-For-K-Virus-Variants-to-Spread.cpp │ └── Readme.md ├── 1969.Minimum-Non-Zero-Product-of-the-Array-Elements │ ├── 1969.Minimum-Non-Zero-Product-of-the-Array-Elements.cpp │ └── Readme.md ├── 2033.Minimum-Operations-to-Make-a-Uni-Value-Grid │ ├── 2033.Minimum-Operations-to-Make-a-Uni-Value-Grid.cpp │ └── Readme.md ├── 204.Count-Primes │ ├── 204.Count-Primes.cpp │ └── Readme.md ├── 2128.Remove-All-Ones-With-Row-and-Column-Flips │ ├── 2128.Remove-All-Ones-With-Row-and-Column-Flips.cpp │ └── Readme.md ├── 2183.Count-Array-Pairs-Divisible-by-K │ ├── 2183.Count-Array-Pairs-Divisible-by-K.cpp │ ├── 2183.Count-Array-Pairs-Divisible-by-K_v2.cpp │ └── Readme.md ├── 2217.Find-Palindrome-With-Fixed-Length │ ├── 2217.Find-Palindrome-With-Fixed-Length.cpp │ └── Readme.md ├── 2221.Find-Triangular-Sum-of-an-Array │ ├── 2221.Find-Triangular-Sum-of-an-Array.cpp │ └── Readme.md ├── 223.Rectangle-Area │ ├── 223.Rectangle-Area.cpp │ └── Readme.md ├── 2280.Minimum-Lines-to-Represent-a-Line-Chart │ ├── 2280.Minimum-Lines-to-Represent-a-Line-Chart.cpp │ └── Readme.md ├── 233.Number-of-Digit-One │ ├── 233.Number-of-Digit-One.cpp │ └── Readme.md ├── 2344.Minimum-Deletions-to-Make-Array-Divisible │ ├── 2344.Minimum-Deletions-to-Make-Array-Divisible.cpp │ └── Readme.md ├── 2400.Number-of-Ways-to-Reach-a-Position-After-Exactly-k-Steps │ ├── 2400.Number-of-Ways-to-Reach-a-Position-After-Exactly-k-Steps_v1.cpp │ ├── 2400.Number-of-Ways-to-Reach-a-Position-After-Exactly-k-Steps_v2.cpp │ └── Readme.md ├── 2448.Minimum-Cost-to-Make-Array-Equal │ ├── 2448.Minimum-Cost-to-Make-Array-Equal_v1.cpp │ ├── 2448.Minimum-Cost-to-Make-Array-Equal_v2.cpp │ └── Readme.md ├── 2514.Count-Anagrams │ ├── 2514.Count-Anagrams.cpp │ └── Readme.md ├── 2539.Count-the-Number-of-Good-Subsequences │ ├── 2539.Count-the-Number-of-Good-Subsequences.cpp │ └── Readme.md ├── 2543.Check-if-Point-Is-Reachable │ ├── 2543.Check-if-Point-Is-Reachable.cpp │ └── Readme.md ├── 2607.Make-K-Subarray-Sums-Equal │ ├── 2607.Make-K-Subarray-Sums-Equal_v1.cpp │ ├── 2607.Make-K-Subarray-Sums-Equal_v2.cpp │ └── Readme.md ├── 2654.Minimum-Number-of-Operations-to-Make-All-Array-Elements-Equal-to-1 │ ├── 2654.Minimum-Number-of-Operations-to-Make-All-Array-Elements-Equal-to-1.cpp │ └── Readme.md ├── 2930.Number-of-Strings-Which-Can-Be-Rearranged-to-Contain-Substring │ ├── 2930.Number-of-Strings-Which-Can-Be-Rearranged-to-Contain-Substring.cpp │ └── Readme.md ├── 2954.Count-the-Number-of-Infection-Sequences │ ├── 2954.Count-the-Number-of-Infection-Sequences.cpp │ └── Readme.md ├── 296.Best-Meeting-Point │ ├── 296.Best-Meeting-Point.cpp │ └── Readme.md ├── 2967.Minimum-Cost-to-Make-Array-Equalindromic │ ├── 2967.Minimum-Cost-to-Make-Array-Equalindromic.cpp │ └── Readme.md ├── 2968.Apply-Operations-to-Maximize-Frequency-Score │ ├── 2968.Apply-Operations-to-Maximize-Frequency-Score_v1.cpp │ ├── 2968.Apply-Operations-to-Maximize-Frequency-Score_v2.cpp │ └── Readme.md ├── 3086.Minimum-Moves-to-Pick-K-Ones │ ├── 3086.Minimum-Moves-to-Pick-K-Ones.cpp │ └── Readme.md ├── 3102.Minimize-Manhattan-Distances │ ├── 3102.Minimize-Manhattan-Distances.cpp │ └── Readme.md ├── 3164.Find-the-Number-of-Good-Pairs-II │ ├── 3164.Find-the-Number-of-Good-Pairs-II.cpp │ └── Readme.md ├── 3197.Find-the-Minimum-Area-to-Cover-All-Ones-II │ ├── 3197.Find-the-Minimum-Area-to-Cover-All-Ones-II.cpp │ └── Readme.md ├── 335.Self-Crossing │ ├── 335.Self-Crossing.cpp │ ├── Readme.md │ └── Readme2.md ├── 3395.Subsequences-with-a-Unique-Middle-Mode-I │ ├── 3395.Subsequences-with-a-Unique-Middle-Mode-I.cpp │ └── Readme.md ├── 3405.Count-the-Number-of-Arrays-with-K-Matching-Adjacent-Elements │ ├── 3405.Count-the-Number-of-Arrays-with-K-Matching-Adjacent-Elements.cpp │ └── Readme.md ├── 3428.Maximum-and-Minimum-Sums-of-at-Most-Size-K-Subsequences │ ├── 3428.Maximum-and-Minimum-Sums-of-at-Most-Size-K-Subsequences.cpp │ └── Readme.md ├── 343.Integer-Break │ ├── 343.Integer-Break.cpp │ ├── 343.Integer-Break_dp.cpp │ └── Readme.md ├── 3463.Check-If-Digits-Are-Equal-in-String-After-Operations-II │ ├── 3463.Check-If-Digits-Are-Equal-in-String-After-Operations-II.cpp │ └── Readme.md ├── 3518.Smallest-Palindromic-Rearrangement-II │ ├── 3518.Smallest-Palindromic-Rearrangement-II.cpp │ └── Readme.md ├── 365.Water-and-Jug-Problem │ ├── 365.Water-and-Jug-Problem.cpp │ └── Readme.md ├── 3681.Maximum-XOR-of-Subsequences │ ├── 3681.Maximum-XOR-of-Subsequences.cpp │ └── Readme.md ├── 3700.Number-of-ZigZag-Arrays-II │ ├── 3700.Number-of-ZigZag-Arrays-II.cpp │ └── Readme.md ├── 382.Linked-List-Random-Node │ ├── 382.Linked-List-Random-Node.cpp │ └── Readme.md ├── 391.Perfect-Rectangle │ ├── 391.Perfect-Rectangle.cpp │ └── Readme.md ├── 400.n-th-digit │ ├── 400.n-th-digit.cpp │ └── Readme.md ├── 441.Arranging-Coins │ ├── 441.Arranging-Coins.cpp │ └── Readme.md ├── 458.Poor-Pigs │ ├── 458.Poor-Pigs.cpp │ └── Readme.md ├── 462.Minimum-Moves-to-Equal-Array-Elements-II │ ├── 462.Minimum-Moves-to-Equal-Array-Elements-II.cpp │ └── Readme.md ├── 470.Implement-Rand10--Using-Rand7 │ ├── 470.Implement-Rand10()-Using-Rand7().cpp │ ├── 470.Implement-Rand10--Using-Rand7_v2.cpp │ ├── 470.Implement-Rand10--Using-Rand7_v3.cpp │ └── Readme.md ├── 478.Generate-Random-Point-in-a-Circle │ ├── 478.Generate-Random-Point-in-a-Circle_v1.cpp │ ├── 478.Generate-Random-Point-in-a-Circle_v2.cpp │ └── Readme.md ├── 497.Random-Point-in-Non-overlapping-Rectangles │ ├── 497.Random-Point-in-Non-overlapping-Rectangles.cpp │ └── Readme.md ├── 519.Random-Flip-Matrix │ ├── 519.Random-Flip-Matrix.cpp │ └── Readme.md ├── 528.Random-Pick-with-Weight │ ├── 528.Random-Pick-with-Weight.cpp │ └── Readme.md ├── 587.Erect-the-Fence │ ├── 587.Erect-the-Fence.cpp │ └── Readme.md ├── 593.Valid-Square │ ├── 593.Valid Square.cpp │ └── Readme.md ├── 628.Maximum-Product-of-Three-Numbers │ ├── 628.Maximum-Product-of-Three-Numbers.cpp │ └── Readme.md ├── 672.Bulb-Switcher-II │ ├── 672.Bulb-Switcher-II.cpp │ └── Readme.md ├── 710.Random-Pick-with-Blacklist │ ├── 710.Random-Pick-with-Blacklist.cpp │ ├── 710.Random-Pick-with-Blacklist_v2.cpp │ └── Readme.md ├── 754.Reach-a-Number │ ├── 754.Reach-a-Number.cpp │ └── Readme.md ├── 829.Consecutive-Numbers-Sum │ ├── 829.Consecutive-Numbers-Sum.cpp │ └── Readme.md ├── 858.Mirror-Reflection │ ├── 858.Mirror-Reflection.cpp │ └── Readme.md ├── 878.Nth-Magical-Number │ ├── 878.Nth-Magical-Number.cpp │ └── Readme.md ├── 883.Projection-Area-of-3D-Shapes │ ├── 883.Projection-Area-of-3D-Shapes.cpp │ └── Readme.md ├── 891.Sum-of-Subsequence-Widths │ ├── 891.Sum-of-Subsequence-Widths.cpp │ └── Readme.md ├── 899.Orderly-Queue │ ├── 899.Orderly-Queue.cpp │ └── Readme.md ├── 963.Minimum-Area-Rectangle-II │ ├── 963.Minimum-Area-Rectangle-II.cpp │ └── Readme.md └── 972.Equal-Rational-Numbers │ ├── 972.Equal-Rational-Numbers.cpp │ └── Readme.md ├── Others ├── 007.Reverse-Integer │ ├── 007.Reverse-Integer.cpp │ └── Readme.md ├── 031.Next-Permutation │ └── 031.Next-Permutation.cpp ├── 042.Trapping-Rain-Water │ ├── 042.Trapping-Rain-Water.cpp │ ├── 042.Trapping-Rain-Water_stack.cpp │ └── Readme.md ├── 048.Rotate-Image │ ├── 048.Rotate-Image.py │ ├── 048.Rotate-Image_v2.cpp │ └── Readme.md ├── 056.Merge-Intervals │ ├── 056.Merge-Intervals.cpp │ └── Readme.md ├── 057.Insert-Interval │ ├── 057.Insert Interval_s1.cpp │ ├── 057.Insert Interval_s2.cpp │ └── Readme.md ├── 065.Valid-Number │ ├── 065.Valid-Number.cpp │ └── Readme.md ├── 090.Subsets-II │ ├── 090.Subsets-II.cpp │ └── Readme.md ├── 1067.Digit-Count-in-Range │ ├── 1067.Digit-Count-in-Range.cpp │ └── Readme.md ├── 1094.Car-Pooling │ ├── 1094.Car-Pooling.cpp │ └── Readme.md ├── 1109.Corporate-Flight-Bookings │ ├── 1109.Corporate-Flight-Bookings.cpp │ └── Readme.md ├── 1183.Maximum-Number-of-Ones │ ├── 1183.Maximum-Number-of-Ones.cpp │ └── Readme.md ├── 1224.Maximum-Equal-Frequency │ ├── 1224.Maximum-Equal-Frequency.cpp │ └── Readme.md ├── 1267.Count-Servers-that-Communicate │ ├── 1267.Count-Servers-that-Communicate.cpp │ └── Readme.md ├── 1503.Last-Moment-Before-All-Ants-Fall-Out-of-a-Plank │ ├── 1503.Last-Moment-Before-All-Ants-Fall-Out-of-a-Plank.cpp │ └── Readme.md ├── 1526.Minimum-Number-of-Increments-on-Subarrays-to-Form-a-Target-Array │ ├── 1526.Minimum-Number-of-Increments-on-Subarrays-to-Form-a-Target-Array_Greedy.cpp │ ├── 1526.Minimum-Number-of-Increments-on-Subarrays-to-Form-a-Target-Array_SegmentTree.cpp │ └── Readme.md ├── 1538.Guess-the-Majority-in-a-Hidden-Array │ ├── 1538.Guess-the-Majority-in-a-Hidden-Array.cpp │ └── Readme.md ├── 158.Read-N-Characters-Given-Read4-II-Call-multiple-times │ ├── 158.Read-N-Characters-Given-Read4-II-Call-multiple-times.cpp │ └── Readme.md ├── 1589.Maximum-Sum-Obtained-of-Any-Permutation │ ├── 1589.Maximum-Sum-Obtained-of-Any-Permutation.cpp │ └── Readme.md ├── 1625.Lexicographically-Smallest-String-After-Applying-Operations │ ├── 1625.Lexicographically-Smallest-String-After-Applying-Operations_v1.cpp │ ├── 1625.Lexicographically-Smallest-String-After-Applying-Operations_v2.cpp │ └── Readme.md ├── 1674.Minimum-Moves-to-Make-Array-Complementary │ ├── 1674.Minimum-Moves-to-Make-Array-Complementary_v1.cpp │ ├── 1674.Minimum-Moves-to-Make-Array-Complementary_v2.cpp │ ├── 1674.Minimum-Moves-to-Make-Array-Complementary_v3.cpp │ └── Readme.md ├── 168.Excel-Sheet-Column-Title │ └── 168.Excel-Sheet-Column-Title.cpp ├── 1685.Sum-of-Absolute-Differences-in-a-Sorted-Array │ ├── 1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.cpp │ └── Readme.md ├── 1706.Where-Will-the-Ball-Fall │ ├── 1706.Where-Will-the-Ball-Fall.cpp │ └── Readme.md ├── 1714.Sum-Of-Special-Evenly-Spaced-Elements-In-Array │ ├── 1714.Sum-Of-Special-Evenly-Spaced-Elements-In-Array_v1.cpp │ ├── 1714.Sum-Of-Special-Evenly-Spaced-Elements-In-Array_v2.cpp │ └── Readme.md ├── 1737.Change-Minimum-Characters-to-Satisfy-One-of-Three-Conditions │ ├── 1737.Change-Minimum-Characters-to-Satisfy-One-of-Three-Conditions.cpp │ └── Readme.md ├── 1749.Maximum-Absolute-Sum-of-Any-Subarray │ ├── 1749.Maximum-Absolute-Sum-of-Any-Subarray_v1.cpp │ ├── 1749.Maximum-Absolute-Sum-of-Any-Subarray_v2.cpp │ └── Readme.md ├── 1752.Check-if-Array-Is-Sorted-and-Rotated │ ├── 1752.Check-if-Array-Is-Sorted-and-Rotated.cpp │ └── Readme.md ├── 1826.Faulty-Sensor │ ├── 1826.Faulty-Sensor.cpp │ └── Readme.md ├── 1861.Rotating-the-Box │ ├── 1861.Rotating-the-Box.cpp │ └── Readme.md ├── 1862.Sum-of-Floored-Pairs │ ├── 1862.Sum-of-Floored-Pairs.cpp │ └── Readme.md ├── 1871.Jump-Game-VII │ ├── 1871.Jump-Game-VII.cpp │ └── Readme.md ├── 1878.Get-Biggest-Three-Rhombus-Sums-in-a-Grid │ ├── 1878.Get-Biggest-Three-Rhombus-Sums-in-a-Grid_v1.cpp │ ├── 1878.Get-Biggest-Three-Rhombus-Sums-in-a-Grid_v2.cpp │ └── Readme.md ├── 1893.Check-if-All-the-Integers-in-a-Range-Are-Covered │ ├── 1893.Check-if-All-the-Integers-in-a-Range-Are-Covered.cpp │ └── Readme.md ├── 1904.The-Number-of-Full-Rounds-You-Have-Played │ ├── 1904.The-Number-of-Full-Rounds-You-Have-Played.cpp │ └── Readme.md ├── 1906.Minimum-Absolute-Difference-Queries │ ├── 1906.Minimum-Absolute-Difference-Queries.cpp │ └── Readme.md ├── 1943.Describe-the-Painting │ ├── 1943.Describe-the-Painting_v1.cpp │ ├── 1943.Describe-the-Painting_v2.cpp │ └── Readme.md ├── 1997.First-Day-Where-You-Have-Been-in-All-the-Rooms │ ├── 1997.First-Day-Where-You-Have-Been-in-All-the-Rooms.cpp │ └── Readme.md ├── 2013.Detect-Squares │ ├── 2013.Detect-Squares.cpp │ └── Readme.md ├── 2015.Average-Height-of-Buildings-in-Each-Segment │ ├── 2015.Average-Height-of-Buildings-in-Each-Segment.cpp │ └── Readme.md ├── 2018.Check-if-Word-Can-Be-Placed-In-Crossword │ ├── 2018.Check-if-Word-Can-Be-Placed-In-Crossword.cpp │ └── Readme.md ├── 2081.Sum-of-k-Mirror-Numbers │ ├── 2081.Sum-of-k-Mirror-Numbers.cpp │ └── Readme.md ├── 2121.Intervals-Between-Identical-Elements │ ├── 2121.Intervals-Between-Identical-Elements.cpp │ ├── 2121.Intervals-Between-Identical-Elements_v2.cpp │ └── Readme.md ├── 2132.Stamping-the-Grid │ ├── 2132.Stamping-the-Grid_v1.cpp │ ├── 2132.Stamping-the-Grid_v2.cpp │ └── Readme.md ├── 2147.Number-of-Ways-to-Divide-a-Long-Corridor │ ├── 2147.Number-of-Ways-to-Divide-a-Long-Corridor.cpp │ └── Readme.md ├── 2158.Amount-of-New-Area-Painted-Each-Day │ ├── 2158.Amount-of-New-Area-Painted-Each-Day.cpp │ └── Readme.md ├── 2211.Count-Collisions-on-a-Road │ ├── 2211.Count-Collisions-on-a-Road.cpp │ └── Readme.md ├── 2237.Count-Positions-on-Street-With-Required-Brightness │ ├── 2237.Count-Positions-on-Street-With-Required-Brightness.cpp │ └── Readme.md ├── 2245.Maximum-Trailing-Zeros-in-a-Cornered-Path │ ├── 2245.Maximum-Trailing-Zeros-in-a-Cornered-Path.cpp │ └── Readme.md ├── 2251.Number-of-Flowers-in-Full-Bloom │ ├── 2251.Number-of-Flowers-in-Full-Bloom.cpp │ └── Readme.md ├── 2281.Sum-of-Total-Strength-of-Wizards │ ├── 2281.Sum-of-Total-Strength-of-Wizards.cpp │ └── Readme.md ├── 2302.Count-Subarrays-With-Score-Less-Than-K │ ├── 2302.Count-Subarrays-With-Score-Less-Than-K.cpp │ └── Readme.md ├── 2327.Number-of-People-Aware-of-a-Secret │ ├── 2327.Number-of-People-Aware-of-a-Secret_v1.cpp │ ├── 2327.Number-of-People-Aware-of-a-Secret_v2.cpp │ └── Readme.md ├── 2337.Move-Pieces-to-Obtain-a-String │ ├── 2337.Move-Pieces-to-Obtain-a-String.cpp │ └── Readme.md ├── 2359.Find-Closest-Node-to-Given-Two-Nodes │ ├── 2359.Find-Closest-Node-to-Given-Two-Nodes.cpp │ └── Readme.md ├── 2376.Count-Special-Integers │ ├── 2376.Count-Special-Integers.cpp │ └── Readme.md ├── 2380.Time-Needed-to-Rearrange-a-Binary-String │ ├── 2380.Time-Needed-to-Rearrange-a-Binary-String.cpp │ └── Readme.md ├── 2381.Shifting-Letters-II │ ├── 2381.Shifting-Letters-II.cpp │ └── Readme.md ├── 240.Search-a-2D-Matrix-II │ ├── 240.Search a 2D Matrix II.cpp │ └── Readme.md ├── 2417.Closest-Fair-Integer │ ├── 2417.Closest-Fair-Integer.cpp │ └── Readme.md ├── 2438.Range-Product-Queries-of-Powers │ ├── 2438.Range-Product-Queries-of-Powers.cpp │ └── Readme.md ├── 2444.Count-Subarrays-With-Fixed-Bounds │ ├── 2444.Count-Subarrays-With-Fixed-Bounds.cpp │ └── Readme.md ├── 2453.Destroy-Sequential-Targets │ ├── 2453.Destroy-Sequential-Targets.cpp │ └── Readme.md ├── 252.Meeting-Rooms │ ├── 252.Meeting-Rooms.cpp │ └── Readme.md ├── 253.Meeting-Rooms-II │ ├── 253.Meeting-Rooms-II.cpp │ ├── 253.Meeting-Rooms-II_v2.cpp │ └── Readme.md ├── 2536.Increment-Submatrices-by-One │ ├── 2536.Increment-Submatrices-by-One.cpp │ └── Readme.md ├── 2552.Count-Increasing-Quadruplets │ ├── 2552.Count-Increasing-Quadruplets_v1.cpp │ └── Readme.md ├── 2584.Split-the-Array-to-Make-Coprime-Products │ ├── 2584.Split-the-Array-to-Make-Coprime-Products.cpp │ └── Readme.md ├── 2591.Distribute-Money-to-Maximum-Children │ ├── 2591.Distribute-Money-to-Maximum-Children.cpp │ └── Readme.md ├── 2615.Sum-of-Distances │ ├── 2615.Sum-of-Distances.cpp │ └── Readme.md ├── 2617.Minimum-Number-of-Visited-Cells-in-a-Grid │ ├── 2617.Minimum-Number-of-Visited-Cells-in-a-Grid.cpp │ └── Readme.md ├── 2647.Color-the-Triangle-Red │ ├── 2647.Color-the-Triangle-Red.cpp │ └── Readme.md ├── 2681.Power-of-Heroes │ ├── 2681.Power-of-Heroes.cpp │ └── Readme.md ├── 2718.Sum-of-Matrix-After-Queries │ ├── 2718.Sum-of-Matrix-After-Queries.cpp │ └── Readme.md ├── 2731.Movement-of-Robots │ ├── 2731.Movement-of-Robots.cpp │ └── Readmd.md ├── 2763.Sum-of-Imbalance-Numbers-of-All-Subarrays │ ├── 2763.Sum-of-Imbalance-Numbers-of-All-Subarrays_v1.cpp │ ├── 2763.Sum-of-Imbalance-Numbers-of-All-Subarrays_v2.cpp │ ├── 2763.Sum-of-Imbalance-Numbers-of-All-Subarrays_v3.cpp │ └── Readme.md ├── 2768.Number-of-Black-Blocks │ ├── 2768.Number-of-Black-Blocks.cpp │ └── Readme.md ├── 277.Find-the-Celebrity │ ├── 277.Find-the-Celebrity.cpp │ └── Readme.md ├── 2772.Apply-Operations-to-Make-All-Array-Elements-Equal-to-Zero │ ├── 2772.Apply-Operations-to-Make-All-Array-Elements-Equal-to-Zero.cpp │ └── Readme.md ├── 2808.Minimum-Seconds-to-Equalize-a-Circular-Array │ ├── 2808.Minimum-Seconds-to-Equalize-a-Circular-Array.cpp │ └── Readme.md ├── 2811.Check-if-it-is-Possible-to-Split-Array │ ├── 2811.Check-if-it-is-Possible-to-Split-Array_v1.cpp │ ├── 2811.Check-if-it-is-Possible-to-Split-Array_v2.cpp │ └── Readme.md ├── 2818.Apply-Operations-to-Maximize-Score │ ├── 2818.Apply-Operations-to-Maximize-Score.cpp │ └── Readme.md ├── 2857.Count-Pairs-of-Points-With-Distance-k │ ├── 2857.Count-Pairs-of-Points-With-Distance-k.cpp │ └── Readme.md ├── 2898.Maximum-Linear-Stock-Score │ ├── 2898.Maximum-Linear-Stock-Score.cpp │ └── Readme.md ├── 2963.Count-the-Number-of-Good-Partitions │ ├── 2963.Count-the-Number-of-Good-Partitions.cpp │ └── Readme.md ├── 3007.Maximum-Number-That-Sum-of-the-Prices-Is-Less-Than-or-Equal-to-K │ ├── 3007.Maximum-Number-That-Sum-of-the-Prices-Is-Less-Than-or-Equal-to-K.cpp │ └── Readme.md ├── 3009.Maximum-Number-of-Intersections-on-the-Chart │ ├── 3009.Maximum-Number-of-Intersections-on-the-Chart.cpp │ └── Readme.md ├── 3068.Find-the-Maximum-Sum-of-Node-Values │ ├── 3068.Find-the-Maximum-Sum-of-Node-Values.cpp │ └── Readme.md ├── 311.Sparse-Matrix-Multiplication │ ├── 311.Sparse Matrix Multiplication.cpp │ └── Readme.md ├── 3169.Count-Days-Without-Meetings │ ├── 3169.Count-Days-Without-Meetings.cpp │ └── Readme.md ├── 324.Wiggle-Sort-II │ ├── 324.Wiggle-Sort-II.cpp │ └── Readme.md ├── 3400.Maximum-Number-of-Matching-Indices-After-Right-Shifts │ ├── 3400.Maximum-Number-of-Matching-Indices-After-Right-Shifts.cpp │ └── Readme.md ├── 3404.Count-Special-Subsequences │ ├── 3404.Count-Special-Subsequences.cpp │ └── Readme.md ├── 3447.Assign-Elements-to-Groups-with-Constraints │ ├── 3447.Assign-Elements-to-Groups-with-Constraints.cpp │ └── Readme.md ├── 347.Top-K-Frequent-Elements │ ├── 347.Top-K-Frequent-Elements_v1.cpp │ ├── 347.Top-K-Frequent-Elements_v2.cpp │ └── Readme.md ├── 348.Design-Tic-Tac-Toe │ ├── 348.Design-Tic-Tac-Toe.cpp │ └── Readme.md ├── 357.Count-Numbers-with-Unique-Digits │ ├── 357.Count-Numbers-with-Unique-Digits.cpp │ └── Readme.md ├── 3628.Maximum-Number-of-Subsequences-After-One-Inserting │ ├── 3628.Maximum-Number-of-Subsequences-After-One-Inserting.cpp │ └── Readme.md ├── 3640.Trionic-Array-II │ ├── 3640.Trionic-Array-II.cpp │ └── Readme.md ├── 3655.XOR-After-Range-Multiplication-Queries-II │ ├── 3655.XOR-After-Range-Multiplication-Queries-II.cpp │ └── Readme.md ├── 420.Strong-Password-Checker │ ├── 420.Strong-Password-Checker.py │ └── Readme.md ├── 423.Reconstruct-Original-Digits-from-English │ ├── 423.Reconstruct-Original-Digits-from-English.cpp │ └── Readme.md ├── 440.K-th-Smallest-in-Lexicographical-Order │ ├── 440.K-th-Smallest-in-Lexicographical-Order.cpp │ └── Readme.md ├── 453.Minimum-Moves-to-Equal-Array-Elements │ ├── 453.Minimum-Moves-to-Equal-Array-Elements.cpp │ └── Readme.md ├── 466.Count-The-Repetitions │ ├── 466.Count-The-Repetitions.cpp │ └── Readme.md ├── 479.Largest-Palindrome-Product │ ├── 479.Largest-Palindrome-Product.cpp │ └── Readme.md ├── 689.Maximum-Sum-of-3-Non-Overlapping-Subarrays │ ├── 689.Maximum-Sum-of-3-Non-Overlapping-Subarrays.cpp │ └── Readme.md ├── 723.Candy-Crush │ ├── 723.Candy-Crush.cpp │ └── Readme.md ├── 732.My-Calendar-III │ ├── 732.My-Calendar-III.cpp │ └── Readme.md ├── 759.Employee-Free-Time │ ├── 759.Employee-Free-Time.cpp │ └── Readme.md ├── 775.Global-and-Local-Inversions │ ├── 775.Global-and-Local-Inversions.cpp │ └── Readme.md ├── 782.Transform-to-Chessboard │ ├── 782.Transform-to-Chessboard.cpp │ └── Readme.md ├── 794.Valid-Tic-Tac-Toe-State │ ├── 794.Valid-Tic-Tac-Toe-State.cpp │ └── Readme.md ├── 795.Number-of-Subarrays-with-Bounded-Maximum │ ├── 795.Number-of-Subarrays-with-Bounded-Maximum_v1.cpp │ ├── 795.Number-of-Subarrays-with-Bounded-Maximum_v2.cpp │ └── Readme.md ├── 798.Smallest-Rotation-with-Highest-Score │ ├── 798.Smallest-Rotation-with-Highest-Score_v1.cpp │ ├── 798.Smallest-Rotation-with-Highest-Score_v2.cpp │ └── Readme.md ├── 810.Chalkboard-XOR-Game │ ├── 810.Chalkboard-XOR-Game.cpp │ └── Readme.md ├── 825.Friends-Of-Appropriate-Ages │ ├── 825.Friends-Of-Appropriate-Ages.cpp │ └── Readme.md ├── 835.Image-Overlap │ ├── 835.Image-Overlap.cpp │ └── Readme.md ├── 843.Guess-the-Word │ ├── 843.Guess-the-Word.cpp │ └── Readme.md ├── 850.Rectangle-Area-II │ ├── 850.Rectangle-Area-II.cpp │ ├── 850.Rectangle-Area-II_v2.cpp │ └── Readme.md ├── 853.Car-Fleet │ ├── 853.Car-Fleet.cpp │ └── Readme.md ├── 866.Prime-Palindrome │ ├── 866.Prime-Palindrome.cpp │ └── Readme.md ├── 906.Super-Palindromes │ ├── 906.Super-Palindromes.cpp │ └── Readme.md ├── 918.Maximum-Sum-Circular-Subarray │ ├── 918.Maximum-Sum-Circular-Subarray.cpp │ └── Readme.md ├── 927.Three-Equal-Parts │ ├── 927.Three-Equal-Parts.cpp │ └── Readme.md ├── 973.K-Closest-Points-to-Origin │ ├── 973.K-Closest-Points-to-Origin_v1.cpp │ ├── 973.K-Closest-Points-to-Origin_v2.cpp │ └── Readme.md ├── 978.Longest-Turbulent-Subarray │ ├── 978.Longest-Turbulent-Subarray.cpp │ └── Readme.md └── 995.Minimum-Number-of-K-Consecutive-Bit-Flips │ ├── 995.Minimum-Number-of-K-Consecutive-Bit-Flips.cpp │ └── Readme.md ├── Priority_Queue ├── 004.Median-of-Two-Sorted-Arrays │ ├── 4-Median-of-Two-Sorted-Arrays.cpp │ ├── 4-Median-of-Two-Sorted-Arrays_PQ.cpp │ └── Readme.md ├── 1057.Campus-Bikes │ ├── 1057.Campus-Bikes.cpp │ └── Readme.md ├── 1167.Minimum-Cost-to-Connect-Sticks │ ├── 1167.Minimum-Cost-to-Connect-Sticks.cpp │ └── Readme.md ├── 1353.Maximum-Number-of-Events-That-Can-Be-Attended │ ├── 1353.Maximum-Number-of-Events-That-Can-Be-Attended.cpp │ └── Readme.md ├── 1383.Maximum-Performance-of-a-Team │ ├── 1383.Maximum-Performance-of-a-Team.cpp │ └── Readme.md ├── 1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows │ ├── 1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows_v1.cpp │ ├── 1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows_v2.cpp │ ├── 1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows_v3.cpp │ └── Readme.md ├── 1642.Furthest-Building-You-Can-Reach │ ├── 1642.Furthest-Building-You-Can-Reach.cpp │ └── Readme.md ├── 1705.Maximum-Number-of-Eaten-Apples │ ├── 1705.Maximum-Number-of-Eaten-Apples.cpp │ └── Readme.md ├── 1792.Maximum-Average-Pass-Ratio │ ├── 1792.Maximum-Average-Pass-Ratio.cpp │ └── Readme.md ├── 1801.Number-of-Orders-in-the-Backlog │ ├── 1801.Number-of-Orders-in-the-Backlog.cpp │ └── Readme.md ├── 1834.Single-Threaded-CPU │ ├── 1834.Single-Threaded-CPU.cpp │ └── Readme.md ├── 1851.Minimum-Interval-to-Include-Each-Query │ ├── 1851.Minimum-Interval-to-Include-Each-Query.cpp │ └── Readme.md ├── 1882.Process-Tasks-Using-Servers │ ├── 1882.Process-Tasks-Using-Servers.cpp │ └── Readme.md ├── 1942.The-Number-of-the-Smallest-Unoccupied-Chair │ ├── 1942.The-Number-of-the-Smallest-Unoccupied-Chair.cpp │ └── Readme.md ├── 1953.Maximum-Number-of-Weeks-for-Which-You-Can-Work │ ├── 1953.Maximum-Number-of-Weeks-for-Which-You-Can-Work.cpp │ └── Readme.md ├── 2335.Minimum-Amount-of-Time-to-Fill-Cups │ ├── 2335.Minimum-Amount-of-Time-to-Fill-Cups_v1.cpp │ ├── 2335.Minimum-Amount-of-Time-to-Fill-Cups_v2.cpp │ └── Readme.md ├── 2386.Find-the-K-Sum-of-an-Array │ ├── 2386.Find-the-K-Sum-of-an-Array.cpp │ └── Readme.md ├── 2402.Meeting-Rooms-III │ ├── 2402.Meeting-Rooms-III.cpp │ └── Readme.md ├── 2406.Divide-Intervals-Into-Minimum-Number-of-Groups │ ├── 2406.Divide-Intervals-Into-Minimum-Number-of-Groups_v1.cpp │ ├── 2406.Divide-Intervals-Into-Minimum-Number-of-Groups_v2.cpp │ └── Readme.md ├── 2542.Maximum-Subsequence-Score │ ├── 2542.Maximum-Subsequence-Score.cpp │ └── Readme.md ├── 2599.Make-the-Prefix-Sum-Non-negative │ ├── 2599.Make-the-Prefix-Sum-Non-negative.cpp │ └── Readme.md ├── 2931.Maximum-Spending-After-Buying-Items │ ├── 2931.Maximum-Spending-After-Buying-Items.cpp │ └── Readme.md ├── 358.Rearrange-String-k-Distance-Apart │ ├── 358.Rearrange-String-k-Distance-Apart.cpp │ └── Readme.md ├── 3645.Maximum-Total-from-Optimal-Activation-Order │ ├── 3645.Maximum-Total-from-Optimal-Activation-Order.cpp │ └── Readme.md ├── 502.IPO │ ├── 502.IPO.cpp │ └── Readme.md ├── 621.Task-Scheduler │ ├── 621.Task-Scheduler_v1.cpp │ ├── 621.Task-Scheduler_v2.cpp │ └── Readme.md ├── 630.Course-Schedule-III │ ├── 630.Course-Schedule-III.cpp │ └── Readme.md ├── 774.Minimize-Max-Distance-to-Gas-Station │ ├── 774.Minimize-Max-Distance-to-Gas-Station_binary.cpp │ ├── 774.Minimize-Max-Distance-to-Gas-Station_pq.cpp │ └── Readme.md └── 857.Minimum-Cost-to-Hire-K-Workers │ ├── 857.Minimum-Cost-to-Hire-K-Workers.cpp │ └── Readme.md ├── Readme.md ├── Recursion ├── 087.Scramble-String │ ├── 087.Scramble-String.cpp │ └── Readme.md ├── 1088.Confusing-Number-II │ ├── 1088.Confusing-Number-II_v1.cpp │ ├── 1088.Confusing-Number-II_v2.cpp │ └── Readme.md ├── 1140.Stone-Game-II │ ├── 1140.Stone-Game-II.cpp │ └── Readme.md ├── 1199.Minimum-Time-to-Build-Blocks │ ├── 1199.Minimum-Time-to-Build-Blocks.cpp │ └── Readme.md ├── 1274.Number-of-Ships-in-a-Rectangle │ ├── 1274.Number-of-Ships-in-a-Rectangle.cpp │ └── Readme.md ├── 133.Clone-Graph │ ├── 133.Clone Graph_BFS.cpp │ ├── 133.Clone Graph_DFS.cpp │ └── Readme.md ├── 1406.Stone-Game-III │ ├── 1406.Stone-Game-III.cpp │ └── Readme.md ├── 1415.The-k-th-Lexicographical-String-of-All-Happy-Strings-of-Length-n │ ├── 1415.The-k-th-Lexicographical-String-of-All-Happy-Strings-of-Length-n_v1.cpp │ ├── 1415.The-k-th-Lexicographical-String-of-All-Happy-Strings-of-Length-n_v2.cpp │ └── Readme.md ├── 1510.Stone-Game-IV │ ├── 1510.Stone-Game-IV_dp.cpp │ ├── 1510.Stone-Game-IV_recursion.cpp │ └── Readme.md ├── 1545.Find-Kth-Bit-in-Nth-Binary-String │ └── 1545.Find-Kth-Bit-in-Nth-Binary-String.cpp ├── 1553.Minimum-Number-of-Days-to-Eat-N-Oranges │ ├── 1553.Minimum-Number-of-Days-to-Eat-N-Oranges.cpp │ └── Readme.md ├── 1611.Minimum-One-Bit-Operations-to-Make-Integers-Zero │ ├── 1611.Minimum-One-Bit-Operations-to-Make-Integers-Zero_GrayCode.cpp │ ├── 1611.Minimum-One-Bit-Operations-to-Make-Integers-Zero_Recursion.cpp │ └── Readme.md ├── 2019.The-Score-of-Students-Solving-Math-Expression │ ├── 2019.The-Score-of-Students-Solving-Math-Expression.cpp │ └── Readme.md ├── 2029.Stone-Game-IX │ ├── 2029.Stone-Game-IX.cpp │ └── Readme.md ├── 2060.Check-if-an-Original-String-Exists-Given-Two-Encoded-Strings │ ├── 2060.Check-if-an-Original-String-Exists-Given-Two-Encoded-Strings.cpp │ └── Readme.md ├── 2378.Choose-Edges-to-Maximize-Score-in-a-Tree │ ├── 2378.Choose-Edges-to-Maximize-Score-in-a-Tree.cpp │ └── Readme.md ├── 241.Different-Ways-to-Add-Parentheses │ ├── 241.Different-Ways-to-Add-Parentheses.cpp │ ├── 241.Different-Ways-to-Add-Parentheses_v2.cpp │ └── Readme.md ├── 2646.Minimize-the-Total-Price-of-the-Trips │ ├── 2646.Minimize-the-Total-Price-of-the-Trips.cpp │ └── Readmd.md ├── 2719.Count-of-Integers │ ├── 2719.Count-of-Integers.cpp │ └── Readme.md ├── 2801.Count-Stepping-Numbers-in-Range │ ├── 2801.Count-Stepping-Numbers-in-Range.cpp │ └── Readme.md ├── 2827.Number-of-Beautiful-Integers-in-the-Range │ ├── 2827.Number-of-Beautiful-Integers-in-the-Range.cpp │ └── Readme.md ├── 2998.Minimum-Number-of-Operations-to-Make-X-and-Y-Equal │ ├── 2998.Minimum-Number-of-Operations-to-Make-X-and-Y-Equal.cpp │ └── Readme.md ├── 2999.Count-the-Number-of-Powerful-Integers │ ├── 2999.Count-the-Number-of-Powerful-Integers.cpp │ └── Readme.md ├── 3307.Find-the-K-th-Character-in-String-Game-II │ ├── 3307.Find-the-K-th-Character-in-String-Game-II.cpp │ └── Readme.md ├── 337.House-Robber-III │ ├── 337.House-Robber-III.cpp │ ├── 337.House-Robber-III.py │ └── Readme.md ├── 3490.Count-Beautiful-Numbers │ ├── 3490.Count-Beautiful-Numbers.cpp │ └── Readme.md ├── 3614.Process-String-with-Special-Operations-II │ ├── 3614.Process-String-with-Special-Operations-II.cpp │ └── Readme.md ├── 3704.Count-No-Zero-Pairs-That-Sum-to-N │ ├── 3704.Count-No-Zero-Pairs-That-Sum-to-N.cpp │ └── Readme.md ├── 390.Elimination-Game │ ├── 390.Elimination-Game.cpp │ └── Readme.md ├── 395.Longest-Substring-with-At-Least-K-Repeating-Characters │ ├── 395.Longest-Substring-with-At-Least-K-Repeating-Characters_v1.cpp │ ├── 395.Longest-Substring-with-At-Least-K-Repeating-Characters_v2.cpp │ └── Readme.md ├── 397.Integer-Replacement │ ├── 397.Integer-Replacement.cpp │ └── Readme.md ├── 464.Can-I-Win │ ├── 464.Can-I-Win.cpp │ └── Readme.md ├── 679.24-Game │ ├── 679.24-Game_v1.cpp │ ├── 679.24-Game_v2.cpp │ ├── 679.24-Game_v3.cpp │ └── Readme.md ├── 779.K-th-Symbol-in-Grammar │ ├── 779.K-th-Symbol-in-Grammar.py │ └── Readme.md ├── 780.Reaching-Points │ ├── 780.Reaching-Points.cpp │ └── Readme.md ├── 808.Soup-Servings │ ├── 808.Soup-Servings.cpp │ └── Readme.md ├── 877.Stone-Game │ ├── 877.Stone-Game.cpp │ └── Readme.md ├── 880.Decoded-String-at-Index │ ├── 880.Decoded-String-at-Index.cpp │ └── Readme.md ├── 902.Numbers-At-Most-N-Given-Digit-Set │ ├── 902.Numbers-At-Most-N-Given-Digit-Set.cpp │ └── Readme.md ├── 964.Least-Operators-to-Express-Number │ ├── 964.Least-Operators-to-Express-Number_v1.cpp │ ├── 964.Least-Operators-to-Express-Number_v2.cpp │ └── Readme.md └── 991.Broken-Calculator │ ├── 991.Broken-Calculator.cpp │ └── Readme.md ├── SQL ├── Date │ └── Readme.md ├── README.md └── Window_Function │ └── README.md ├── Segment_Tree ├── 2031.Count-Subarrays-With-More-Ones-Than-Zeros │ ├── 2031.Count-Subarrays-With-More-Ones-Than-Zeros.cpp │ └── Readme.md ├── 2179.Count-Good-Triplets-in-an-Array │ ├── 2179.Count-Good-Triplets-in-an-Array.cpp │ └── Readme.md ├── 218.The-Skyline-Problem │ ├── 218.The-Skyline-Problem.cpp │ ├── 218.The-Skyline-Problem_SegTree_v1.cpp │ ├── 218.The-Skyline-Problem_SegTree_v2.cpp │ └── Readme.md ├── 2286.Booking-Concert-Tickets-in-Groups │ ├── 2286.Booking-Concert-Tickets-in-Groups.cpp │ └── Readme.md ├── 2407.Longest-Increasing-Subsequence-II │ ├── 2407.Longest-Increasing-Subsequence-II.cpp │ └── Readme.md ├── 2569.Handling-Sum-Queries-After-Update │ ├── 2569.Handling-Sum-Queries-After-Update.cpp │ └── Readme.md ├── 2659.Make-Array-Empty │ ├── 2659.Make-Array-Empty.cpp │ └── Readme.md ├── 2916.Subarrays-Distinct-Element-Sum-of-Squares-II │ ├── 2916.Subarrays-Distinct-Element-Sum-of-Squares-II.cpp │ └── Readme.md ├── 307.Range-Sum-Query-Mutable │ ├── 307.Range-Sum-Query-Mutable_BIT.cpp │ ├── 307.Range-Sum-Query-Mutable_SegTree_v3.cpp │ ├── 307.Range-Sum-Query-Mutable_segTree_v1.cpp │ ├── 307.Range-Sum-Query-Mutable_segTree_v2.cpp │ └── Readme.md ├── 3072.Distribute-Elements-Into-Two-Arrays-II │ ├── 3072.Distribute-Elements-Into-Two-Arrays-II.cpp │ ├── 3072.Distribute-Elements-Into-Two-Arrays-II.py │ └── Readme.md ├── 3161.Block-Placement-Queries │ ├── 3161.Block-Placement-Queries.cpp │ └── Readme.md ├── 3165.Maximum-Sum-of-Subsequence-With-Non-adjacent-Elements │ ├── 3165.Maximum-Sum-of-Subsequence-With-Non-adjacent-Elements.cpp │ └── Readme.md ├── 3187.Peaks-in-Array │ ├── 3187.Peaks-in-Array.cpp │ └── Readme.md ├── 3261.Count-Substrings-That-Satisfy-K-Constraint-II │ ├── 3261.Count-Substrings-That-Satisfy-K-Constraint-II.cpp │ └── Readme.md ├── 3624.Number-of-Integers-With-Popcount-Depth-Equal-to-K-II │ ├── 3624.Number-of-Integers-With-Popcount-Depth-Equal-to-K-II.cpp │ └── Readme.md ├── 3671.Sum-of-Beautiful-Subsequences │ ├── 3671.Sum-of-Beautiful-Subsequences.cpp │ └── Readme.md ├── 370.Range-Addition │ ├── 370.Range-Addition_DiffArray.cpp │ ├── 370.Range-Addition_SegTree.cpp │ └── Readme.md ├── 3721.Longest-Balanced-Subarray-II │ ├── 3721.Longest-Balanced-Subarray-II.cpp │ └── Readme.md ├── 699.Falling-Squares │ ├── 699.Falling-Squares_Heap_v1.cpp │ ├── 699.Falling-Squares_Heap_v2.cpp │ ├── 699.Falling-Squares_SegTree_v1.cpp │ ├── 699.Falling-Squares_SegTree_v2.cpp │ └── Readme.md └── 715.Range-Module │ ├── 715.Range-Module.cpp │ ├── 715.Range-Module_segTree.cpp │ └── Readme.md ├── Simulation ├── 2061.Number-of-Spaces-Cleaning-Robot-Cleaned │ ├── 2061.Number-of-Spaces-Cleaning-Robot-Cleaned.cpp │ └── Readme.md ├── 2069.Walking-Robot-Simulation-II │ ├── 2069.Walking-Robot-Simulation-II.cpp │ └── Readme.md └── 2532.Time-to-Cross-a-Bridge │ ├── 2532.Time-to-Cross-a-Bridge.cpp │ └── Readme.md ├── Sorted_Container ├── 1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers │ ├── 1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers.cpp │ └── Readme.md ├── 1348.Tweet-Counts-Per-Frequency │ ├── 1348.Tweet-Counts-Per-Frequency.cpp │ └── Readme.md ├── 1488.Avoid-Flood-in-The-City │ ├── 1488.Avoid-Flood-in-The-City.cpp │ └── Readme.md ├── 1606.Find-Servers-That-Handled-Most-Number-of-Requests │ ├── 1606.Find-Servers-That-Handled-Most-Number-of-Requests.cpp │ └── Readme.md ├── 1675.Minimize-Deviation-in-Array │ ├── 1675.Minimize-Deviation-in-Array.cpp │ └── Readme.md ├── 1825.Finding-MK-Average │ ├── 1825.Finding-MK-Average.cpp │ └── Readme.md ├── 1847.Closest-Room │ ├── 1847.Closest-Room.cpp │ └── Readme.md ├── 1912.Design-Movie-Rental-System │ ├── 1912.Design-Movie-Rental-System.cpp │ └── Readme.md ├── 2102.Sequentially-Ordinal-Rank-Tracker │ ├── 2102.Sequentially-Ordinal-Rank-Tracker_v1.cpp │ ├── 2102.Sequentially-Ordinal-Rank-Tracker_v2.cpp │ ├── 2102.Sequentially-Ordinal-Rank-Tracker_v3.cpp │ └── Readme.md ├── 220.Contains-Duplicate-III │ ├── 220.Contains-Duplicate-III.cpp │ └── Readme.md ├── 2213.Longest-Substring-of-One-Repeating-Character │ ├── 2213.Longest-Substring-of-One-Repeating-Character.cpp │ └── Readme.md ├── 2276.Count-Integers-in-Intervals │ ├── 2276.Count-Integers-in-Intervals.cpp │ └── Readme.md ├── 2382.Maximum-Segment-Sum-After-Removals │ ├── 2382.Maximum-Segment-Sum-After-Removals.cpp │ └── Readme.md ├── 2612.Minimum-Reverse-Operations │ ├── 2612.Minimum-Reverse-Operations.cpp │ └── Readme.md ├── 2653.Sliding-Subarray-Beauty │ ├── 2653.Sliding-Subarray-Beauty.cpp │ └── Readme.md ├── 2736.Maximum-Sum-Queries │ ├── 2736.Maximum-Sum-Queries.cpp │ └── Readme.md ├── 2907.Maximum-Profitable-Triplets-With-Increasing-Prices-I │ ├── 2907.Maximum-Profitable-Triplets-With-Increasing-Prices-I_v1.cpp │ ├── 2907.Maximum-Profitable-Triplets-With-Increasing-Prices-I_v2.cpp │ └── Readme.md ├── 2926.Maximum-Balanced-Subsequence-Sum │ ├── 2926.Maximum-Balanced-Subsequence-Sum.cpp │ └── Readme.md ├── 2940.Find-Building-Where-Alice-and-Bob-Can-Meet │ ├── 2940.Find-Building-Where-Alice-and-Bob-Can-Meet.cpp │ └── Readme.md ├── 2945.Find-Maximum-Non-decreasing-Array-Length │ ├── 2945.Find-Maximum-Non-decreasing-Array-Length.cpp │ └── Readme.md ├── 295.Find-Median-from-Data-Stream │ ├── 295.Find-Median-from-Data-Stream.cpp │ ├── 295.Find-Median-from-Data-Stream_v2.cpp │ └── Readme.md ├── 3013.Divide-an-Array-Into-Subarrays-With-Minimum-Cost-II │ ├── 3013.Divide-an-Array-Into-Subarrays-With-Minimum-Cost-II.cpp │ └── Readme.md ├── 352.Data-Stream-as-Disjoint-Intervals │ ├── 352.Data Stream as Disjoint Intervals.cpp │ ├── 352.Data-Stream-as-Disjoint-Intervals-v2.cpp │ ├── 352.Data-Stream-as-Disjoint-Intervals-v3.cpp │ └── Readme.md ├── 363.Max-Sum-of-Rectangle-No-Larger-Than-K │ ├── 363.Max-Sum-of-Rectangle-No-Larger-Than-K.cpp │ └── Readme.md ├── 3672.Sum-of-Weighted-Modes-in-Subarrays │ ├── 3672.Sum-of-Weighted-Modes-in-Subarrays.cpp │ └── Readme.md ├── 480.Sliding-Window-Median │ ├── 480.Sliding-Window-Median.cpp │ └── Readme.md ├── 632.Smallest-Range-Covering-Elements-from-K-Lists │ ├── 632.Smallest-Range-Covering-Elements-from-K-Lists.cpp │ └── Readme.md ├── 729.My-Calendar-I │ ├── 729.My-Calendar-I.cpp │ └── Readme.md ├── 855.Exam-Room │ ├── 855.Exam-Room.cpp │ └── Readme.md └── 975.Odd-Even-Jump │ ├── 975.Odd-Even-Jump.cpp │ └── Readme.md ├── Stack ├── 032.Longest-Valid-Parentheses │ ├── 032.Longest-Valid-Parentheses.cpp │ └── Readme.md ├── 071.Simplify-Path │ ├── 071.Simplify-Path.cpp │ └── Readme.md ├── 084.Largest-Rectangle-in-Histogram │ ├── 084.Largest-Rectangle-in-Histogram.py │ ├── 084.Largest-Rectangle-in-Histogram_v1.cpp │ ├── 084.Largest-Rectangle-in-Histogram_v2.cpp │ └── Readme.md ├── 085.Maximal-Rectangle │ ├── 85-Maximal-Rectangle.cpp │ └── Readme.md ├── 1019.Next-Greater-Node-In-Linked-List │ ├── 1019.Next-Greater-Node-In-Linked-List.cpp │ └── Readme.md ├── 1063.Number-of-Valid-Subarrays │ ├── 1063.Number-of-Valid-Subarrays.cpp │ └── Readme.md ├── 1081.Smallest-Subsequence-of-Distinct-Characters │ ├── 1081.Smallest-Subsequence-of-Distinct-Characters.cpp │ └── Readme.md ├── 1087.Brace-Expansion │ ├── 1087.Brace-Expansion.cpp │ └── Readme.md ├── 1096.Brace-Expansion-II │ ├── 1096.Brace-Expansion-II_recursion.cpp │ ├── 1096.Brace-Expansion-II_stack.cpp │ └── Readme.md ├── 1106.Parsing-A-Boolean-Expression │ ├── 1106.Parsing-A-Boolean-Expression_recursion.cpp │ ├── 1106.Parsing-A-Boolean-Expression_stack.cpp │ └── Readme.md ├── 1124.Longest-Well-Performing-Interval │ ├── 1124.Longest-Well-Performing-Interval_Map.cpp │ ├── 1124.Longest-Well-Performing-Interval_Stack.cpp │ └── Readme.md ├── 1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses │ ├── 1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses_O(N).cpp │ ├── 1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses_Stack.cpp │ └── Readme.md ├── 1209.Remove-All-Adjacent-Duplicates-in-String-II │ ├── 1209.Remove-All-Adjacent-Duplicates-in-String-II.cpp │ └── Readme.md ├── 1504.Count-Submatrices-With-All-Ones │ ├── 1504.Count-Submatrices-With-All-Ones.cpp │ └── Readme.md ├── 155.Min-Stack │ ├── 155.Min Stack.cpp │ ├── 155.Min-Stack_v2.cpp │ └── Readme.md ├── 1586.Binary-Search-Tree-Iterator-II │ ├── 1586.Binary-Search-Tree-Iterator-II.cpp │ └── Readme.md ├── 1673.Find-the-Most-Competitive-Subsequence │ ├── 1673.Find-the-Most-Competitive-Subsequence.cpp │ └── Readme.md ├── 173.Binary-Search-Tree-Iterator │ ├── 173.Binary Search Tree Iterator.cpp │ └── Readme.md ├── 1856.Maximum-Subarray-Min-Product │ ├── 1856.Maximum-Subarray-Min-Product.cpp │ └── Readme.md ├── 1896.Minimum-Cost-to-Change-the-Final-Value-of-Expression │ ├── 1896.Minimum-Cost-to-Change-the-Final-Value-of-Expression.cpp │ └── Readme.md ├── 1944.Number-of-Visible-People-in-a-Queue │ ├── 1944.Number-of-Visible-People-in-a-Queue.cpp │ └── Readme.md ├── 1950.Maximum-of-Minimum-Values-in-All-Subarrays │ ├── 1950.Maximum-of-Minimum-Values-in-All-Subarrays.cpp │ └── Readme.md ├── 1966.Binary-Searchable-Numbers-in-an-Unsorted-Array │ ├── 1966.Binary-Searchable-Numbers-in-an-Unsorted-Array.cpp │ └── Readme.md ├── 2030.Smallest-K-Length-Subsequence-With-Occurrences-of-a-Letter │ ├── 2030.Smallest-K-Length-Subsequence-With-Occurrences-of-a-Letter.cpp │ └── Readme.md ├── 2104.Sum-of-Subarray-Ranges │ ├── 2104.Sum-of-Subarray-Ranges.cpp │ └── Readme.md ├── 2197.Replace-Non-Coprime-Numbers-in-Array │ ├── 2197.Replace-Non-Coprime-Numbers-in-Array.cpp │ └── Readme.md ├── 224.Basic-Calculator │ ├── 224.Basic Calculator.cpp │ ├── Readme.md │ └── basic_calculator.java ├── 225.Implement-Stack-using-Queues │ ├── 225.Implement Stack using Queues.cpp │ └── Readme.md ├── 227.Basic-Calculator-II │ ├── 227.Basic-Calculator-II.cpp │ └── Readme.md ├── 2282.Number-of-People-That-Can-Be-Seen-in-a-Grid │ ├── 2282.Number-of-People-That-Can-Be-Seen-in-a-Grid.cpp │ └── Readme.md ├── 232.Implement-Queue-using-Stacks │ ├── 232.Implement-Queue-using-Stacks.cpp │ └── Readme.md ├── 2334.Subarray-With-Elements-Greater-Than-Varying-Threshold │ ├── 2334.Subarray-With-Elements-Greater-Than-Varying-Threshold.cpp │ └── Readme.md ├── 2355.Maximum-Number-of-Books-You-Can-Take │ ├── 2355.Maximum-Number-of-Books-You-Can-Take.cpp │ └── Readme.md ├── 2434.Using-a-Robot-to-Print-the-Lexicographically-Smallest-String │ ├── 2434.Using-a-Robot-to-Print-the-Lexicographically-Smallest-String.cpp │ └── Readme.md ├── 2454.Next-Greater-Element-IV │ ├── 2454.Next-Greater-Element-IV.cpp │ └── Readme.md ├── 2751.Robot-Collisions │ ├── 2751.Robot-Collisions.cpp │ └── Readme.md ├── 2764.is-Array-a-Preorder-of-Some-Binary-Tree │ ├── 2764.is-Array-a-Preorder-of-Some-Binary-Tree.cpp │ └── Readme.md ├── 2863.Maximum-Length-of-Semi-Decreasing-Subarrays │ ├── 2863.Maximum-Length-of-Semi-Decreasing-Subarrays_v1.cpp │ ├── 2863.Maximum-Length-of-Semi-Decreasing-Subarrays_v2.cpp │ └── Readme.md ├── 2866.Beautiful-Towers-II │ ├── 2866.Beautiful-Towers-II.cpp │ └── Readme.md ├── 3113.Find-the-Number-of-Subarrays-Where-Boundary-Elements-Are-Maximum │ ├── 3113.Find-the-Number-of-Subarrays-Where-Boundary-Elements-Are-Maximum.cpp │ └── Readme.md ├── 316.Remove-Duplicate-Letters │ ├── 316.Remove Duplicate Letters.cpp │ └── Readme.md ├── 321.Create-Maximum-Number │ ├── 321.Create-Maximum-Number.cpp │ ├── 321.Create-Maximum-Number_dp.cpp │ └── Readme.md ├── 341.Flatten-Nested-List-Iterator │ ├── 341.Flatten Nested List Iterator.cpp │ └── Readme.md ├── 3676.Count-Bowl-Subarrays │ ├── 3676.Count-Bowl-Subarrays.cpp │ └── Readme.md ├── 385.Mini-Parser │ ├── 385.Mini Parser.cpp │ └── Readme.md ├── 402.Remove-K-Digits │ ├── 402.Remove K Digits.cpp │ └── Readme.md ├── 439.Ternary-Expression-Parser │ ├── 439.Ternary Expression Parser.cpp │ └── Readme.md ├── 456.132-Pattern │ ├── 456.132-Pattern.cpp │ └── Readme.md ├── 496.Next-Greater-Element-I │ ├── 496.Next-Greater-Element-I.cpp │ └── Readme.md ├── 503.Next-Greater-Element-II │ ├── 503.Next-Greater-Element-II.cpp │ ├── 503.Next-Greater-Element-II.py │ └── Readme.md ├── 536.Construct-Binary-Tree-from-String │ ├── 536.Construct Binary Tree from String.cpp │ └── Readme.md ├── 591.Tag-Validator │ ├── 591.Tag Validator.cpp │ ├── 591.Tag-Validator_s2.cpp │ └── Readme.md ├── 636.Exclusive-Time-of-Functions │ ├── 636.Exclusive-Time-of-Functions.cpp │ └── Readme.md ├── 654.Maximum-Binary-Tree │ ├── 654.Maximum-Binary-Tree_v1.cpp │ ├── 654.Maximum-Binary-Tree_v2.cpp │ └── Readme.md ├── 726.Number-of-Atoms │ ├── 726.Number-of-Atoms.cpp │ └── Readme.md ├── 739.Daily-Temperatures │ ├── 739.Daily-Temperatures.cpp │ ├── 739.Daily-Temperatures_v2.cpp │ └── Readme.md ├── 768.Max-Chunks-To-Make-Sorted-II │ ├── 768.Max-Chunks-To-Make-Sorted-II_v1.cpp │ ├── 768.Max-Chunks-To-Make-Sorted-II_v2.cpp │ └── Readme.md ├── 772.Basic-Calculator-III │ ├── 772.Basic-Calculator-III.cpp │ └── Readme.md ├── 856.Score-of-Parentheses │ ├── 856.Score-of-Parentheses.cpp │ └── Readme.md ├── 901.Online-Stock-Span │ ├── 901.Online-Stock-Span.cpp │ └── Readme.md ├── 907.Sum-of-Subarray-Minimums │ ├── 907.Sum-of-Subarray-Minimums.cpp │ ├── 907.Sum-of-Subarray-Minimums_v2.cpp │ └── Readme.md ├── 946.Validate-Stack-Sequences │ ├── 946.Validate-Stack-Sequences.cpp │ └── Readme.md └── 962.Maximum-Width-Ramp │ ├── 962.Maximum-Width-Ramp.cpp │ ├── 962.Maximum-Width-Ramp.py │ └── Readme.md ├── String ├── 005.Longest-Palindromic-Substring │ ├── 005.Longest-Palindromic-Substring.cpp │ └── Readme.md ├── 006.ZigZag-Conversion │ ├── 006.ZigZag-Conversion.cpp │ ├── 006.ZigZag-Conversion.py │ └── Readme.md ├── 028.Implement-strStr │ ├── 028.Implement-strStr-KMP.cpp │ ├── 028.Implement-strStr-sunday.cpp │ └── Readme.md ├── 068.Text-Justification │ ├── 068.Text-Justification.cpp │ └── Readme.md ├── 1044.Longest-Duplicate-Substring │ ├── 1044.Longest-Duplicate-Substring.cpp │ ├── 1044.Longest-Duplicate-Substring_v2.cpp │ └── Readme.md ├── 1062.Longest-Repeating-Substring │ ├── 1062.Longest-Repeating-Substring_RollingHash.cpp │ ├── 1062.Longest-Repeating-Substring_dp.cpp │ └── Readme.md ├── 1367.Linked-List-in-Binary-Tree │ ├── 1367.Linked-List-in-Binary-Tree_KMP.cpp │ ├── 1367.Linked-List-in-Binary-Tree_recursion.cpp │ └── Readme.md ├── 1392.Longest-Happy-Prefix │ ├── 1392.Longest-Happy-Prefix.cpp │ └── Readme.md ├── 1554.Strings-Differ-by-One-Character │ ├── 1554.Strings-Differ-by-One-Character.cpp │ └── Readme.md ├── 1616.Split-Two-Strings-to-Make-Palindrome │ ├── 1616.Split-Two-Strings-to-Make-Palindrome.cpp │ └── Readme.md ├── 1698.Number-of-Distinct-Substrings-in-a-String │ ├── 1698.Number-of-Distinct-Substrings-in-a-String_v1.cpp │ ├── 1698.Number-of-Distinct-Substrings-in-a-String_v2.cpp │ └── Readme.md ├── 1754.Largest-Merge-Of-Two-Strings │ ├── 1754.Largest-Merge-Of-Two-Strings.cpp │ └── Readme.md ├── 1764.Form-Array-by-Concatenating-Subarrays-of-Another-Array │ ├── 1764.Form-Array-by-Concatenating-Subarrays-of-Another-Array_BruteForce.cpp │ ├── 1764.Form-Array-by-Concatenating-Subarrays-of-Another-Array_KMP.cpp │ └── Readme.md ├── 1849.Splitting-a-String-Into-Descending-Consecutive-Values │ ├── 1849.Splitting-a-String-Into-Descending-Consecutive-Values.cpp │ ├── 1849.Splitting-a-String-Into-Descending-Consecutive-Values.py │ └── Readme.md ├── 1923.Longest-Common-Subpath │ ├── 1923.Longest-Common-Subpath.cpp │ ├── 1923.Longest-Common-Subpath_v2.cpp │ └── Readme.md ├── 1960.Maximum-Product-of-the-Length-of-Two-Palindromic-Substrings │ ├── 1960.Maximum-Product-of-the-Length-of-Two-Palindromic-Substrings.cpp │ └── Readme.md ├── 214.Shortest-Palindrome │ ├── 214.Shortest-Palindrome.cpp │ ├── 214.Shortest-Palindrome.py │ ├── 214.Shortest-Palindrome_KMP.cpp │ ├── 214.Shortest-Palindrome_Manacher.cpp │ └── Readme.md ├── 2156.Find-Substring-With-Given-Hash-Value │ ├── 2156.Find-Substring-With-Given-Hash-Value.cpp │ └── Readme.md ├── 2168.Unique-Substrings-With-Equal-Digit-Frequency │ ├── 2168.Unique-Substrings-With-Equal-Digit-Frequency.cpp │ └── Readme.md ├── 2223.Sum-of-Scores-of-Built-Strings │ ├── 2223.Sum-of-Scores-of-Built-Strings.cpp │ └── Readme.md ├── 2261.K-Divisible-Elements-Subarrays │ ├── 2261.K-Divisible-Elements-Subarrays_v1.cpp │ ├── 2261.K-Divisible-Elements-Subarrays_v2.cpp │ └── Readme.md ├── 2301.Match-Substring-After-Replacement │ ├── 2301.Match-Substring-After-Replacement_Brute.cpp │ ├── 2301.Match-Substring-After-Replacement_KMP.cpp │ └── Readme.md ├── 2468.Split-Message-Based-on-Limit │ ├── 2468.Split-Message-Based-on-Limit.cpp │ └── Readme.md ├── 2781.Length-of-the-Longest-Valid-Substring │ ├── 2781.Length-of-the-Longest-Valid-Substring.cpp │ └── Readme.md ├── 3008.Find-Beautiful-Indices-in-the-Given-Array-II │ ├── 3008.Find-Beautiful-Indices-in-the-Given-Array-II.cpp │ └── Readme.md ├── 3023.Find-Pattern-in-Infinite-Stream-I │ ├── 3023.Find-Pattern-in-Infinite-Stream-I.cpp │ └── Readme.md ├── 3031.Minimum-Time-to-Revert-Word-to-Initial-State-II │ ├── 3031.Minimum-Time-to-Revert-Word-to-Initial-State-II.cpp │ ├── 3031.Minimum-Time-to-Revert-Word-to-Initial-State-II_v2.cpp │ └── Readme.md ├── 3045.Count-Prefix-and-Suffix-Pairs-II │ ├── 3045.Count-Prefix-and-Suffix-Pairs-II.cpp │ └── Readme.md ├── 320.Generalized-Abbreviation │ ├── 320.Generalized-Abbreviation.cpp │ └── Readme.md ├── 336.Palindrome-Pairs │ ├── 336.Palindrome Pairs.cpp │ ├── 336.Palindrome-Pairs.py │ ├── 336.Palindrome-Pairs_v2.cpp │ └── Readme.md ├── 3388.Count-Beautiful-Splits-in-an-Array │ ├── 3388.Count-Beautiful-Splits-in-an-Array.cpp │ └── Readme.md ├── 388.Longest-Absolute-File-Path │ ├── 388.Longest-Absolute-File-Path.cpp │ └── Readme.md ├── 408.Valid-Word-Abbreviation │ ├── 408.Valid Word Abbreviation.cpp │ └── Readme.md ├── 411.Minimum-Unique-Word-Abbreviation │ ├── 411.Minimum-Unique-Word-Abbreviation.cpp │ └── Readme.md ├── 418.Sentence-Screen-Fitting │ ├── 418.Sentence-Screen-Fitting.cpp │ └── Readme.md ├── 459.Repeated-Substring-Pattern │ ├── 459.Repeated-Substring-Pattern_v1.cpp │ ├── 459.Repeated-Substring-Pattern_v2.cpp │ └── Readme.md ├── 467.Unique-Substrings-in-Wraparound-String │ ├── 467.Unique-Substrings-in-Wraparound-String.cpp │ └── Readme.md ├── 527.Word-Abbreviation │ ├── 527.Word-Abbreviation.cpp │ └── Readme.md ├── 564.Find-the-Closest-Palindrome │ ├── 564.Find-the-Closest-Palindrome.cpp │ └── Readme.md ├── 616.Add-Bold-Tag-in-String │ └── 616.Add-Bold-Tag-in-String.cpp ├── 647.Palindromic-Substrings │ ├── 647.Palindromic-Substrings.cpp │ ├── 647.Palindromic-Substrings_v2.cpp │ └── Readme.md ├── 722.Remove-Comments │ ├── 722.Remove-Comments.cpp │ └── Readme.md ├── 736.Parse-Lisp-Expression │ ├── 736.Parse-Lisp-Expression.cpp │ └── Readme.md ├── 816.Ambiguous-Coordinates │ ├── 816.Ambiguous-Coordinates.cpp │ └── Readme.md └── 844.Backspace-String-Compare │ ├── 844.Backspace-String-Compare.cpp │ └── Readme.md ├── Template ├── Binary_Index_Tree │ └── BIT.cpp ├── Binary_Lift │ └── binary_lift.cpp ├── Bit_manipulation │ ├── Count_bit_1_numbers.cpp │ ├── Gospers-Hack.cpp │ ├── Iterate_Subsets.cpp │ └── bitset.cpp ├── CPP_LANG │ ├── Hash.cpp │ ├── Struct.cpp │ ├── fill_memset.cpp │ └── istringstream.cpp ├── Combination-Number │ └── comb.cpp ├── Diff_Array_2D │ ├── Readme.md │ └── code.cpp ├── Fast_IO │ └── Fast_IO.cpp ├── Graph │ ├── Hungarian.cpp │ ├── Judge_Circle.cpp │ └── Readme.md ├── Inverse_Element │ ├── Inverse_Element.cpp │ └── Readme.md ├── Math │ ├── Combination-Number.cpp │ ├── Lucas.cpp │ ├── Matrix_Multiplication.cpp │ ├── Primes.cpp │ └── QuickPow.cpp ├── RB_Tree │ └── ordered_set.cpp ├── Random │ └── random.cpp ├── SegmentTree │ ├── range_bitwise_and.cpp │ ├── range_max.cpp │ ├── range_min.cpp │ ├── range_module.cpp │ ├── range_sum.cpp │ └── range_sum_increase_by.cpp ├── Sub_Rect_Sum_2D │ └── code.cpp └── Union_Find │ └── union_find.cpp ├── Thinking ├── 2860.Happy-Students │ ├── 2860.Happy-Students.cpp │ └── Readme.md ├── 2862.Maximum-Element-Sum-of-a-Complete-Subset-of-Indices │ ├── 2862.Maximum-Element-Sum-of-a-Complete-Subset-of-Indices.cpp │ └── Readme.md ├── 2910.Minimum-Number-of-Groups-to-Create-a-Valid-Assignment │ ├── 2910.Minimum-Number-of-Groups-to-Create-a-Valid-Assignment.cpp │ └── Readme.md ├── 2939.Maximum-Xor-Product │ ├── 2939.Maximum-Xor-Product.cpp │ └── Readme.md ├── 2952.Minimum-Number-of-Coins-to-be-Added │ ├── 2952.Minimum-Number-of-Coins-to-be-Added.cpp │ └── Readme.md ├── 2957.Remove-Adjacent-Almost-Equal-Characters │ ├── 2957.Remove-Adjacent-Almost-Equal-Characters.cpp │ └── Readme.md ├── 3609.Minimum-Moves-to-Reach-Target-in-Grid │ ├── 3609.Minimum-Moves-to-Reach-Target-in-Grid.cpp │ └── Readme.md ├── 3644.Maximum-K-to-Sort-a-Permutation │ ├── 3644.Maximum-K-to-Sort-a-Permutation.cpp │ └── Readme.md └── 3660.Jump-Game-IX │ ├── 3660.Jump-Game-IX.cpp │ └── Readme.md ├── Tree ├── 094.Binary-Tree-Inorder-Traversal │ ├── 094.Binary Tree Inorder Traversal.cpp │ ├── 94.Binary Tree Inorder Traversal.cpp │ └── Readme.md ├── 095.Unique-Binary-Search-Trees-II │ ├── 095.Unique Binary Search Trees II.cpp │ └── Readme.md ├── 098.Validate-Binary-Search-Tree │ ├── 098.Validate Binary Search Tree.cpp │ ├── 098.Validate-Binary-Search-Tree_s2.cpp │ └── Readme.md ├── 099.Recover-Binary-Search-Tree │ ├── 099.Recover-Binary-Search-Tree.cpp │ └── Readme.md ├── 1028.Recover-a-Tree-From-Preorder-Traversal │ ├── 1028.Recover-a-Tree-From-Preorder-Traversal.cpp │ └── Readme.md ├── 105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal │ ├── 105.Construct Binary Tree from Preorder and Inorder Traversal.cpp │ └── Readme.md ├── 106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal │ ├── 106.Construct Binary Tree from Inorder and Postorder Traversal.cpp │ └── Readme.md ├── 110.Balanced-Binary-Tree │ ├── 110.Balanced Binary Tree.cpp │ └── Readme.md ├── 1104.Path-In-Zigzag-Labelled-Binary-Tree │ ├── 1104.Path-In-Zigzag-Labelled-Binary-Tree.cpp │ └── Readme.md ├── 1123.Lowest-Common-Ancestor-of-Deepest-Leaves │ ├── 1123.Lowest-Common-Ancestor-of-Deepest-Leaves.cpp │ └── Readme.md ├── 114.Flatten-Binary-Tree-to-Linked-List │ ├── 114.Flatten Binary Tree to Linked List.cpp │ └── Readme.md ├── 117.Populating-Next-Right-Pointers-in-Each-Node-II │ ├── 117.Populating Next Right Pointers in Each Node II.cpp │ └── Readme.md ├── 124.Binary-Tree-Maximum-Path-Sum │ ├── 124.Binary-Tree-Maximum-Path-Sum.cpp │ └── Readme.md ├── 144.Binary-Tree-Preorder-Traversal │ ├── 144.Binary Tree Preorder Traversal.cpp │ └── Readme.md ├── 145.Binary-Tree-Postorder-Traversal │ ├── 145.Binary Tree Postorder Traversal.cpp │ ├── 145.Binary-Tree-Postorder-Traversal_v2.cpp │ └── Readme.md ├── 1516.Move-Sub-Tree-of-N-Ary-Tree │ ├── 1516.Move-Sub-Tree-of-N-Ary-Tree.cpp │ └── Readme.md ├── 1522.Diameter-of-N-Ary-Tree │ ├── 1522.Diameter-of-N-Ary-Tree.cpp │ └── Readme.md ├── 156.Binary-Tree-Upside-Down │ ├── 156.Binary-Tree-Upside-Down.cpp │ └── Readme.md ├── 1569.Number-of-Ways-to-Reorder-Array-to-Get-Same-BST │ ├── 1569.Number-of-Ways-to-Reorder-Array-to-Get-Same-BST.cpp │ └── Readme.md ├── 1597.Build-Binary-Expression-Tree-From-Infix-Expression │ ├── 1597.Build-Binary-Expression-Tree-From-Infix-Expression.cpp │ └── Readme.md ├── 1644.Lowest-Common-Ancestor-of-a-Binary-Tree-II │ ├── 1644.Lowest-Common-Ancestor-of-a-Binary-Tree-II.cpp │ └── Readme.md ├── 1650.Lowest-Common-Ancestor-of-a-Binary-Tree-III │ ├── 1650.Lowest-Common-Ancestor-of-a-Binary-Tree-III.cpp │ └── Readme.md ├── 1660.Correct-a-Binary-Tree │ ├── 1660.Correct-a-Binary-Tree.cpp │ └── Readme.md ├── 1666.Change-the-Root-of-a-Binary-Tree │ ├── 1666.Change-the-Root-of-a-Binary-Tree.cpp │ └── Readme.md ├── 1676.Lowest-Common-Ancestor-of-a-Binary-Tree-IV │ ├── 1676.Lowest-Common-Ancestor-of-a-Binary-Tree-IV.cpp │ └── Readme.md ├── 1740.Find-Distance-in-a-Binary-Tree │ ├── 1740.Find-Distance-in-a-Binary-Tree.cpp │ ├── 1740.Find-Distance-in-a-Binary-Tree_v2.cpp │ └── Readme.md ├── 1902.Depth-of-BST-Given-Insertion-Order │ ├── 1902.Depth-of-BST-Given-Insertion-Order.cpp │ └── Readme.md ├── 1932.Merge-BSTs-to-Create-Single-BST │ ├── 1932.Merge-BSTs-to-Create-Single-BST.cpp │ └── Readme.md ├── 1948.Delete-Duplicate-Folders-in-System │ ├── 1948.Delete-Duplicate-Folders-in-System.cpp │ └── Readme.md ├── 2003.Smallest-Missing-Genetic-Value-in-Each-Subtree │ ├── 2003.Smallest-Missing-Genetic-Value-in-Each-Subtree_v1.cpp │ ├── 2003.Smallest-Missing-Genetic-Value-in-Each-Subtree_v2.cpp │ └── Readme.md ├── 2049.Count-Nodes-With-the-Highest-Score │ ├── 2049.Count-Nodes-With-the-Highest-Score.cpp │ └── Readme.md ├── 2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another │ ├── 2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.cpp │ ├── 2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another_v2.cpp │ └── Readme.md ├── 222.Count-Complete-Tree-Nodes │ ├── 222.Count-Complete-Tree-Nodes_v1.cpp │ ├── 222.Count-Complete-Tree-Nodes_v2.cpp │ └── Readme.md ├── 2246.Longest-Path-With-Different-Adjacent-Characters │ ├── 2246.Longest-Path-With-Different-Adjacent-Characters.cpp │ └── Readme.md ├── 226.Invert-Binary-Tree │ ├── 226.Invert Binary Tree.cpp │ ├── 226.Invert Binary Tree_s2.cpp │ └── Readme.md ├── 2277.Closest-Node-to-Path-in-Tree │ ├── 2277.Closest-Node-to-Path-in-Tree_v1.cpp │ ├── 2277.Closest-Node-to-Path-in-Tree_v2.cpp │ └── Readme.md ├── 2313.Minimum-Flips-in-Binary-Tree-to-Get-Result │ ├── 2313.Minimum-Flips-in-Binary-Tree-to-Get-Result.cpp │ └── Readme.md ├── 2322.Minimum-Score-After-Removals-on-a-Tree │ ├── 2322.Minimum-Score-After-Removals-on-a-Tree.cpp │ └── Readme.md ├── 236.Lowest-Common-Ancestor-of-a-Binary-Tree │ ├── 235.Lowest Common Ancestor of a Binary Search Tree.cpp │ ├── 236.Lowest-Common-Ancestor-of-a-Binary-Tree_v1.cpp │ ├── 236.Lowest-Common-Ancestor-of-a-Binary-Tree_v2.cpp │ └── Readme.md ├── 2445.Number-of-Nodes-With-Value-One │ ├── 2445.Number-of-Nodes-With-Value-One.cpp │ └── Readme.md ├── 2458.Height-of-Binary-Tree-After-Subtree-Removal-Queries │ ├── 2458.Height-of-Binary-Tree-After-Subtree-Removal-Queries.cpp │ └── Readme.md ├── 2467.Most-Profitable-Path-in-a-Tree │ ├── 2467.Most-Profitable-Path-in-a-Tree.cpp │ └── Readme.md ├── 2509.Cycle-Length-Queries-in-a-Tree │ ├── 2509.Cycle-Length-Queries-in-a-Tree.cpp │ └── Readme.md ├── 2538.Difference-Between-Maximum-and-Minimum-Price-Sum │ ├── 2538.Difference-Between-Maximum-and-Minimum-Price-Sum.cpp │ └── Readme.md ├── 255.Verify-Preorder-Sequence-in-Binary-Search-Tree │ ├── 255.Verify Preorder Sequence in Binary Search Tree_DFS.cpp │ ├── 255.Verify Preorder Sequence in Binary Search Tree_stack.cpp │ └── Readme.md ├── 2581.Count-Number-of-Possible-Root-Nodes │ ├── 2581.Count-Number-of-Possible-Root-Nodes.cpp │ └── Readme.md ├── 270.Closest-Binary-Search-Tree-Value │ ├── 270.Closest Binary Search Tree Value.cpp │ └── Readme.md ├── 272.Closest-Binary-Search-Tree-Value-II │ ├── 272.Closest Binary Search Tree Value II.cpp │ └── Readme.md ├── 285.Inorder-Successor-in-BST │ ├── 285.Inorder Successor in BST.cpp │ └── Readme.md ├── 2858.Minimum-Edge-Reversals-So-Every-Node-Is-Reachable │ ├── 2858.Minimum-Edge-Reversals-So-Every-Node-Is-Reachable.cpp │ └── Readme.md ├── 2920.Maximum-Points-After-Collecting-Coins-From-All-Nodes │ ├── 2920.Maximum-Points-After-Collecting-Coins-From-All-Nodes.cpp │ └── Readme.md ├── 2925.Maximum-Score-After-Applying-Operations-on-a-Tree │ ├── 2925.Maximum-Score-After-Applying-Operations-on-a-Tree.cpp │ └── Readme.md ├── 297.Serialize-and-Deserialize-Binary-Tree │ ├── 297.Serialize and Deserialize Binary Tree.cpp │ ├── 297.Serialize-and-Deserialize-Binary-Tree_v2.cpp │ ├── 297.Serialize-and-Deserialize-Binary-Tree_v3.cpp │ └── Readme.md ├── 2973.Find-Number-of-Coins-to-Place-in-Tree-Nodes │ ├── 2973.Find-Number-of-Coins-to-Place-in-Tree-Nodes.cpp │ └── Readme.md ├── 298.Binary-Tree-Longest-Consecutive-Sequence │ ├── 298.Binary Tree Longest Consecutive Sequence.cpp │ └── Readme.md ├── 3203.Find-Minimum-Diameter-After-Merging-Two-Trees │ ├── 3203.Find-Minimum-Diameter-After-Merging-Two-Trees.cpp │ └── Readme.md ├── 331.Verify-Preorder-Serialization-of-a-Binary-Tree │ ├── 331.Verify Preorder Serialization of a Binary Tree.cpp │ └── Readme.md ├── 333.Largest-BST-Subtree │ ├── 333.Largest BST Subtree.cpp │ └── Readme.md ├── 3715.Sum-of-Perfect-Square-Ancestors │ ├── 3715.Sum-of-Perfect-Square-Ancestors.cpp │ └── Readme.md ├── 3772.Maximum-Subgraph-Score-in-a-Tree │ ├── 3772.Maximum-Subgraph-Score-in-a-Tree.cpp │ └── Readme.md ├── 428.Serialize-and-Deserialize-N-ary-Tree │ ├── 428.Serialize-and-Deserialize-N-ary-Tree.cpp │ └── Readme.md ├── 431.Encode-N-ary-Tree-to-Binary-Tree │ ├── 431.Encode-N-ary-Tree-to-Binary-Tree.cpp │ └── Readme.md ├── 437.Path-Sum-III │ ├── 437.Path Sum III.cpp │ ├── 437.Path-Sum-III_v2.cpp │ └── Readme.md ├── 449.Serialize-and-Deserialize-BST │ ├── 449.Serialize and Deserialize BST.cpp │ └── Readme.md ├── 450.Delete-Node-in-a-BST │ ├── 450.Delete Node in a BST.cpp │ ├── 450.Delete-Node-in-a-BST_s2.cpp │ └── Readme.md ├── 501.Find-Mode-in-Binary-Search-Tree │ ├── 501.Find-Mode-in-Binary-Search-Tree.cpp │ └── Readme.md ├── 543.Diameter-of-Binary-Tree │ ├── 543.Diameter-of-Binary-Tree.cpp │ └── Readme.md ├── 545.Boundary-of-Binary-Tree │ ├── 545.Boundary of Binary Tree.cpp │ └── Readme.md ├── 549.Binary-Tree-Longest-Consecutive-Sequence-II │ ├── 549.Binary Tree Longest Consecutive Sequence II.cpp │ └── Readme.md ├── 558.Quad-Tree-Intersection │ ├── 558.Quad-Tree-Intersection.cpp │ └── Readme.md ├── 572.Subtree-of-Another-Tree │ ├── 572.Subtree-of-Another-Tree_KMP.cpp │ ├── 572.Subtree-of-Another-Tree_Recursion.cpp │ ├── 572.Subtree-of-Another-Tree_uid.cpp │ └── Readme.md ├── 652.Find-Duplicate-Subtrees │ ├── 652.Find-Duplicate-Subtrees_v1.cpp │ ├── 652.Find-Duplicate-Subtrees_v2.cpp │ └── Readme.md ├── 655.Print-Binary-Tree │ ├── 655.Print-Binary-Tree.cpp │ └── Readme.md ├── 662.Maximum-Width-of-Binary-Tree │ ├── 662.Maximum-Width-of-Binary-Tree.cpp │ └── Readme.md ├── 687.Longest-Univalue-Path │ ├── 687.Longest-Univalue-Path.cpp │ └── Readme.md ├── 742.Closest-Leaf-in-a-Binary-Tree │ ├── 742.Closest-Leaf-in-a-Binary-Tree.cpp │ └── Readme.md ├── 834.Sum-of-Distances-in-Tree │ ├── 834.Sum-of-Distances-in-Tree.cpp │ └── Readme.md ├── 863.All-Nodes-Distance-K-in-Binary-Tree │ ├── 863.All-Nodes-Distance-K-in-Binary-Tree_v1.cpp │ ├── 863.All-Nodes-Distance-K-in-Binary-Tree_v2.cpp │ └── Readme.md ├── 897.Increasing-Order-Search-Tree │ ├── 897.Increasing-Order-Search-Tree.cpp │ └── Readme.md ├── 954.Check-Completeness-of-a-Binary-Tree │ ├── 954.Check-Completeness-of-a-Binary-Tree.cpp │ ├── 954.Check-Completeness-of-a-Binary-Tree_v2.cpp │ └── Readme.md └── 971.Flip-Binary-Tree-To-Match-Preorder-Traversal │ └── 971.Flip-Binary-Tree-To-Match-Preorder-Traversal.cpp ├── Trie ├── 1268.Search-Suggestions-System │ ├── 1268.Search-Suggestions-System_v1.cpp │ ├── 1268.Search-Suggestions-System_v2.cpp │ └── Readme.md ├── 139.Word-Break │ ├── 139.Word-Break_DP.cpp │ ├── 139.Word-Break_DP.py │ ├── 139.Word-Break_Trie.cpp │ └── Readme.md ├── 140.Word-Break-II │ ├── 140.Word-Break-II.cpp │ └── Readme.md ├── 1707.Maximum-XOR-With-an-Element-From-Array │ ├── 1707.Maximum-XOR-With-an-Element-From-Array.cpp │ └── Readme.md ├── 1803.Count-Pairs-With-XOR-in-a-Range │ ├── 1803.Count-Pairs-With-XOR-in-a-Range.cpp │ └── Readme.md ├── 1804.Implement-Trie-II-(Prefix-Tree) │ ├── 1804.Implement-Trie-II-(Prefix-Tree).cpp │ └── Readme.md ├── 1858.Longest-Word-With-All-Prefixes │ ├── 1858.Longest-Word-With-All-Prefixes.cpp │ └── Readme.md ├── 1938.Maximum-Genetic-Difference-Query │ ├── 1938.Maximum-Genetic-Difference-Query.cpp │ └── Readme.md ├── 208.Implement-Trie--Prefix-Tree │ ├── 208.Implement-Trie--Prefix-Tree.cpp │ └── Readme.md ├── 211.Add-and-Search-Word │ ├── 211.Add and Search Word.cpp │ └── Readme.md ├── 212.Word-Search-II │ ├── 212.Word-Search-II_v1.cpp │ ├── 212.Word-Search-II_v2.cpp │ ├── 212.Word-Search-II_v3.cpp │ └── Readme.md ├── 2416.Sum-of-Prefix-Scores-of-Strings │ ├── 2416.Sum-of-Prefix-Scores-of-Strings.cpp │ └── Readme.md ├── 2479.Maximum-XOR-of-Two-Non-Overlapping-Subtrees │ ├── 2479.Maximum-XOR-of-Two-Non-Overlapping-Subtrees.cpp │ └── Readme.md ├── 2935.Maximum-Strong-Pair-XOR-II │ ├── 2935.Maximum-Strong-Pair-XOR-II.cpp │ └── Readme.md ├── 2977.Minimum-Cost-to-Convert-String-II │ ├── 2977.Minimum-Cost-to-Convert-String-II_v1.cpp │ ├── 2977.Minimum-Cost-to-Convert-String-II_v2.cpp │ └── Readme.md ├── 3093.Longest-Common-Suffix-Queries │ ├── 3093.Longest-Common-Suffix-Queries.cpp │ └── Readme.md ├── 3632.Subarrays-with-XOR-at-Least-K │ ├── 3632.Subarrays-with-XOR-at-Least-K.cpp │ └── Readme.md ├── 3670.Maximum-Product-of-Two-Integers-With-No-Common-Bits │ ├── 3670.Maximum-Product-of-Two-Integers-With-No-Common-Bits.cpp │ ├── 3670.Maximum-Product-of-Two-Integers-With-No-Common-Bits_v2.cpp │ └── Readme.md ├── 421.Maximum-XOR-of-Two-Numbers-in-an-Array │ ├── 421.Maximum-XOR-of-Two-Numbers-in-an-Array.cpp │ └── Readme.md ├── 472.Concatenated-Words │ ├── 472.Concatenated-Words.cpp │ └── Readme.md ├── 588.Design-In-Memory-File-System │ ├── 588.Design-In-Memory-File-System.cpp │ └── Readme.md ├── 648.Replace-Words │ ├── 648.Replace-Words.cpp │ └── Readme.md ├── 676.Implement-Magic-Dictionary │ ├── 676.Implement-Magic-Dictionary.cpp │ └── Readme.md ├── 677.Map-Sum-Pairs │ ├── 677.Map-Sum-Pairs.cpp │ └── Readme.md └── 745.Prefix-and-Suffix-Search │ ├── 745.Prefix-and-Suffix-Search.cpp │ └── Readme.md ├── Two_Pointers ├── 003.Longest Substring Without Repeating Characters │ ├── 003.Longest-Substring-Without-Repeating-Characters.cpp │ ├── 3. Longest Substring Without Repeating Characters.cpp │ └── Readme.md ├── 011.Container-With-Most-Water │ ├── 11-Container-With-Most-Water.cpp │ └── Readme.md ├── 015.3Sum │ ├── 15-3Sum.cpp │ └── Readme.md ├── 016.3Sum-Closest │ ├── 16.3Sum_Closest.cpp │ └── Readme.md ├── 018.4Sum │ ├── 18. 4Sum_s1.cpp │ └── Readme.md ├── 026.Remove-Duplicates-from-Sorted-Array │ ├── 026.Remove-Duplicates-from-Sorted-Array_v1.cpp │ ├── 026.Remove-Duplicates-from-Sorted-Array_v2.cpp │ └── Readme.md ├── 030.Substring-with-Concatenation-of-All-Words │ ├── 030.Substring-with-Concatenation-of-All-Words.py │ ├── 30. Substring with Concatenation of All Words.cpp │ └── Readme.md ├── 075.Sort-Colors │ ├── 75. Sort Colors.cpp │ └── Readme.md ├── 076.Minimum-Window-Substring │ ├── 076.Minimum-Window-Substring.cpp │ └── Readme.md ├── 080.Remove-Duplicates-from-Sorted-Array-II │ ├── 80.Remove Duplicates from Sorted Array II.cpp │ └── Readme.md ├── 088.Merge-Sorted-Array │ ├── 88 Merge Sorted Array.cpp │ └── Readme.md ├── 1004.Max-Consecutive-Ones-III │ ├── 1004.Max-Consecutive-Ones-III.cpp │ ├── 1004.Max-Consecutive-Ones-III_v2.cpp │ └── Readme.md ├── 1052.Grumpy-Bookstore-Owner │ ├── 1052.Grumpy-Bookstore-Owner.cpp │ └── Readme.md ├── 1229.Meeting-Scheduler │ ├── 1229.Meeting-Scheduler_2_pointers.cpp │ ├── 1229.Meeting-Scheduler_diff_array.cpp │ └── Readme.md ├── 1234.Replace-the-Substring-for-Balanced-String │ ├── 1234.Replace-the-Substring-for-Balanced-String_BinarySearch.cpp │ ├── 1234.Replace-the-Substring-for-Balanced-String_TwoPointers.cpp │ └── Readme.md ├── 1358.Number-of-Substrings-Containing-All-Three-Characters │ ├── 1358.Number-of-Substrings-Containing-All-Three-Characters.cpp │ └── Readme.md ├── 141.Linked-List-Cycle │ ├── 141-Linked-List-Cycle.cpp │ └── Readme.md ├── 1498.Number-of-Subsequences-That-Satisfy-the-Given-Sum-Condition │ ├── 1498.Number-of-Subsequences-That-Satisfy-the-Given-Sum-Condition.cpp │ └── Readme.md ├── 1537.Get-the-Maximum-Score │ ├── 1537.Get-the-Maximum-Score.cpp │ └── Readme.md ├── 1574.Shortest-Subarray-to-be-Removed-to-Make-Array-Sorted │ ├── 1574.Shortest-Subarray-to-be-Removed-to-Make-Array-Sorted.cpp │ └── Readme.md ├── 1577.Number-of-Ways-Where-Square-of-Number-Is-Equal-to-Product-of-Two-Numbers │ ├── 1577.Number-of-Ways-Where-Square-of-Number-Is-Equal-to-Product-of-Two-Numbers_Hash.cpp │ ├── 1577.Number-of-Ways-Where-Square-of-Number-Is-Equal-to-Product-of-Two-Numbers_TwoPointer.cpp │ └── Readme.md ├── 1580.Put-Boxes-Into-the-Warehouse-II │ ├── 1580.Put-Boxes-Into-the-Warehouse-II.cpp │ └── Readme.md ├── 159.Longest-Substring-with-At-Most-Two-Distinct-Characters │ ├── 159. Longest Substring with At Most Two Distinct Characters.cpp │ └── Readme.md ├── 1687.Delivering-Boxes-from-Storage-to-Ports │ ├── 1687.Delivering-Boxes-from-Storage-to-Ports.cpp │ └── Readme.md ├── 1763.Longest-Nice-Substring │ ├── 1763.Longest-Nice-Substring.cpp │ └── Readme.md ├── 1775.Equal-Sum-Arrays-With-Minimum-Number-of-Operations │ ├── 1775.Equal-Sum-Arrays-With-Minimum-Number-of-Operations.cpp │ └── Readme.md ├── 1793.Maximum-Score-of-a-Good-Subarray │ ├── 1793.Maximum-Score-of-a-Good-Subarray.cpp │ └── Readme.md ├── 1838.Frequency-of-the-Most-Frequent-Element │ ├── 1838.Frequency-of-the-Most-Frequent-Element_v1.cpp │ ├── 1838.Frequency-of-the-Most-Frequent-Element_v2.cpp │ └── Readme.md ├── 1868.Product-of-Two-Run-Length-Encoded-Arrays │ ├── 1868.Product-of-Two-Run-Length-Encoded-Arrays.cpp │ └── Readme.md ├── 1989.Maximum-Number-of-People-That-Can-Be-Caught-in-Tag │ ├── 1989.Maximum-Number-of-People-That-Can-Be-Caught-in-Tag.cpp │ └── Readme.md ├── 2009.Minimum-Number-of-Operations-to-Make-Array-Continuous │ ├── 2009.Minimum-Number-of-Operations-to-Make-Array-Continuous.cpp │ └── Readme.md ├── 2024.Maximize-the-Confusion-of-an-Exam │ ├── 2024.Maximize-the-Confusion-of-an-Exam.cpp │ └── Readme.md ├── 209.Minimum-Size-Subarray-Sum │ ├── 209.Minimum Size Subarray Sum.cpp │ └── Readme.md ├── 2098.Subsequence-of-Size-K-With-the-Largest-Even-Sum │ ├── 2098.Subsequence-of-Size-K-With-the-Largest-Even-Sum.cpp │ └── Readme.md ├── 2106.Maximum-Fruits-Harvested-After-at-Most-K-Steps │ ├── 2106.Maximum-Fruits-Harvested-After-at-Most-K-Steps_v1.cpp │ ├── 2106.Maximum-Fruits-Harvested-After-at-Most-K-Steps_v2.cpp │ └── Readme.md ├── 2354.Number-of-Excellent-Pairs │ ├── 2354.Number-of-Excellent-Pairs.cpp │ └── Readme.md ├── 2401.Longest-Nice-Subarray │ ├── 2401.Longest-Nice-Subarray.cpp │ └── Readme.md ├── 2411.Smallest-Subarrays-With-Maximum-Bitwise-OR │ ├── 2411.Smallest-Subarrays-With-Maximum-Bitwise-OR.cpp │ └── Readme.md ├── 2422.Merge-Operations-to-Turn-Array-Into-a-Palindrome │ ├── 2422.Merge-Operations-to-Turn-Array-Into-a-Palindrome.cpp │ └── Readme.md ├── 2461.Maximum-Sum-of-Distinct-Subarrays-With-Length-K │ ├── 2461.Maximum-Sum-of-Distinct-Subarrays-With-Length-K.cpp │ └── Readme.md ├── 2516.Take-K-of-Each-Character-From-Left-and-Right │ ├── 2516.Take-K-of-Each-Character-From-Left-and-Right_v1.cpp │ ├── 2516.Take-K-of-Each-Character-From-Left-and-Right_v2.cpp │ └── Readme.md ├── 2537.Count-the-Number-of-Good-Subarrays │ ├── 2537.Count-the-Number-of-Good-Subarrays.cpp │ └── Readme.md ├── 2564.Substring-XOR-Queries │ ├── 2564.Substring-XOR-Queries.cpp │ └── Readme.md ├── 259.3Sum-Smaller │ ├── 259. 3Sum Smaller.cpp │ └── Readme.md ├── 2730.Find-the-Longest-Semi-Repetitive-Substring │ ├── 2730.Find-the-Longest-Semi-Repetitive-Substring.cpp │ └── Readme.md ├── 2747.Count-Zero-Request-Servers │ ├── 2747.Count-Zero-Request-Servers.cpp │ └── Readme.md ├── 283.Move-Zeroes │ ├── 283.Move Zeroes.cpp │ └── Readme.md ├── 2831.Find-the-Longest-Equal-Subarray │ ├── 2831.Find-the-Longest-Equal-Subarray.cpp │ └── Readme.md ├── 2953.Count-Complete-Substrings │ ├── 2953.Count-Complete-Substrings.cpp │ └── Readme.md ├── 2958.Length-of-Longest-Subarray-With-at-Most-K-Frequency │ ├── 2958.Length-of-Longest-Subarray-With-at-Most-K-Frequency.cpp │ └── Readme.md ├── 3134.Find-the-Median-of-the-Uniqueness-Array │ ├── 3134.Find-the-Median-of-the-Uniqueness-Array.cpp │ └── Readme.md ├── 3234.Count-the-Number-of-Substrings-With-Dominant-Ones │ ├── 3234.Count-the-Number-of-Substrings-With-Dominant-Ones.cpp │ └── Readme.md ├── 3298.Count-Substrings-That-Can-Be-Rearranged-to-Contain-a-String-II │ ├── 3298.Count-Substrings-That-Can-Be-Rearranged-to-Contain-a-String-II_v1.cpp │ ├── 3298.Count-Substrings-That-Can-Be-Rearranged-to-Contain-a-String-II_v2.cpp │ └── Readme.md ├── 3306.Count-of-Substrings-Containing-Every-Vowel-and-K-Consonants-II │ ├── 3306.Count-of-Substrings-Containing-Every-Vowel-and-K-Consonants-II.cpp │ └── Readme.md ├── 340.Longest-Substring-with-At-Most-K-Distinct-Characters │ ├── 340.Longest-Substring-with-At-Most-K-Distinct-Characters_v1.cpp │ ├── 340.Longest-Substring-with-At-Most-K-Distinct-Characters_v2.cpp │ └── Readme.md ├── 360.Sort-Transformed-Array │ ├── 360.Sort Transformed Array.cpp │ └── Readme.md ├── 3634.Minimum-Removals-to-Balance-Array │ ├── 3634.Minimum-Removals-to-Balance-Array.cpp │ └── Readme.md ├── 3641.Longest-Semi-Repeating-Subarray │ ├── 3641.Longest-Semi-Repeating-Subarray.cpp │ └── Readme.md ├── 424.Longest-Repeating-Character-Replacement │ ├── 424.Longest-Repeating-Character-Replacement_v1.cpp │ ├── 424.Longest-Repeating-Character-Replacement_v2.cpp │ └── Readme.md ├── 532.K-diff-Pairs-in-an-Array │ ├── 532.K-diff Pairs in an Array.cpp │ ├── 532.K-diff-Pairs-in-an-Array_s2.cpp │ └── Readme.md ├── 611.Valid-Triangle-Number │ ├── 611.Valid-Triangle-Number.cpp │ └── Readme.md ├── 713.Subarray-Product-Less-Than-K │ ├── 713.Subarray-Product-Less-Than-K.cpp │ └── Readme.md ├── 923.3Sum-With-Multiplicity │ ├── 923.3Sum-With-Multiplicity.cpp │ └── Readme.md ├── 986.Interval-List-Intersections │ ├── 986.Interval-List-Intersections.cpp │ └── Readme.md └── 992.Subarrays-with-K-Different-Integers │ ├── 992.Subarrays-with-K-Different-Integers_v1.cpp │ └── Readme.md ├── Union_Find ├── 1061.Lexicographically-Smallest-Equivalent-String │ ├── 1061.Lexicographically-Smallest-Equivalent-String.cpp │ └── Readme.md ├── 1101.The-Earliest-Moment-When-Everyone-Become-Friends │ ├── 1101.The-Earliest-Moment-When-Everyone-Become-Friends.cpp │ └── Readme.md ├── 1135.Connecting-Cities-With-Minimum-Cost │ ├── 1135.Connecting-Cities-With-Minimum-Cost.cpp │ └── Readme.md ├── 1168.Optimize-Water-Distribution-in-a-Village │ ├── 1168.Optimize-Water-Distribution-in-a-Village.cpp │ └── Readme.md ├── 1202.Smallest-String-With-Swaps │ ├── 1202.Smallest-String-With-Swaps.cpp │ └── Readme.md ├── 128.Longest-Consecutive-Sequence │ ├── 128.Longest-Consecutive-Sequence.cpp │ ├── 128.Longest-Consecutive-Sequence_v2.cpp │ └── Readme.md ├── 130.Surrounded-Regions │ ├── 130.Surrounded-Regions.cpp │ ├── 130.Surrounded-Regions_BFS.cpp │ └── Readme.md ├── 1319.Number-of-Operations-to-Make-Network-Connected │ ├── 1319.Number-of-Operations-to-Make-Network-Connected.cpp │ └── Readme.md ├── 1489.Find-Critical-and-Pseudo-Critical-Edges-in-Minimum-Spanning-Tree │ ├── 1489.Find-Critical-and-Pseudo-Critical-Edges-in-Minimum-Spanning-Tree.cpp │ └── Readme.md ├── 1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable │ ├── 1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable.cpp │ └── Readme.md ├── 1584.Min-Cost-to-Connect-All-Points │ ├── 1584.Min-Cost-to-Connect-All-Points_Kruskal.cpp │ ├── 1584.Min-Cost-to-Connect-All-Points_Prim.cpp │ ├── 1584.Min-Cost-to-Connect-All-Points_Prim_v2.cpp │ └── Readme.md ├── 1627.Graph-Connectivity-With-Threshold │ ├── 1627.Graph-Connectivity-With-Threshold.cpp │ ├── 1627.Graph-Connectivity-With-Threshold_v2.cpp │ └── Readme.md ├── 1631.Path-With-Minimum-Effort │ ├── 1631.Path-With-Minimum-Effort_v1.cpp │ ├── 1631.Path-With-Minimum-Effort_v2.cpp │ └── Readme.md ├── 1632.Rank-Transform-of-a-Matrix │ ├── 1632.Rank-Transform-of-a-Matrix_v1.cpp │ ├── 1632.Rank-Transform-of-a-Matrix_v2.cpp │ └── Readme.md ├── 1697.Checking-Existence-of-Edge-Length-Limited-Paths │ ├── 1697.Checking-Existence-of-Edge-Length-Limited-Paths.cpp │ └── Readme.md ├── 1722.Minimize-Hamming-Distance-After-Swap-Operations │ ├── 1722.Minimize-Hamming-Distance-After-Swap-Operations.cpp │ └── Readme.md ├── 1724.Checking-Existence-of-Edge-Length-Limited-Paths-II │ ├── 1724.Checking-Existence-of-Edge-Length-Limited-Paths-II.cpp │ ├── 1724.Checking-Existence-of-Edge-Length-Limited-Paths-II_v2.cpp │ └── Readme.md ├── 1970.Last-Day-Where-You-Can-Still-Cross │ ├── 1970.Last-Day-Where-You-Can-Still-Cross.cpp │ └── Readme.md ├── 1998.GCD-Sort-of-an-Array │ ├── 1998.GCD-Sort-of-an-Array.cpp │ └── Readme.md ├── 2076.Process-Restricted-Friend-Requests │ ├── 2076.Process-Restricted-Friend-Requests.cpp │ └── Readme.md ├── 2092.Find-All-People-With-Secret │ ├── 2092.Find-All-People-With-Secret.cpp │ └── Readme.md ├── 2157.Groups-of-Strings │ ├── 2157.Groups-of-Strings.cpp │ └── Readme.md ├── 2421.Number-of-Good-Paths │ ├── 2421.Number-of-Good-Paths_v1.cpp │ ├── 2421.Number-of-Good-Paths_v2.cpp │ └── Readme.md ├── 2492.Minimum-Score-of-a-Path-Between-Two-Cities │ ├── 2492.Minimum-Score-of-a-Path-Between-Two-Cities.cpp │ └── Readme.md ├── 2709.Greatest-Common-Divisor-Traversal │ ├── 2709.Greatest-Common-Divisor-Traversal.cpp │ └── Readme.md ├── 2867.Count-Valid-Paths-in-a-Tree │ ├── 2867.Count-Valid-Paths-in-a-Tree.cpp │ └── Readme.md ├── 305.Number-of-Islands-II │ ├── 305.Number-of-Islands-II.cpp │ └── Readme.md ├── 3600.Maximize-Spanning-Tree-Stability-with-Upgrades │ ├── 3600.Maximize-Spanning-Tree-Stability-with-Upgrades.cpp │ └── Readme.md ├── 547.Friend-Circles │ ├── 547.Friend-Circles.cpp │ └── Readme.md ├── 684.Redundant-Connection │ ├── 684.Redundant-Connection.cpp │ └── Readme.md ├── 685.Redundant-Connection-II │ ├── 685.Redundant-Connection-II.cpp │ └── Readme.md ├── 721.Accounts-Merge │ ├── 721.Accounts-Merge.cpp │ └── Readme.md ├── 765.Couples-Holding-Hands │ ├── 765.Couples-Holding-Hands.cpp │ ├── 765.Couples-Holding-Hands_v2.cpp │ └── Readme.md ├── 924.Minimize-Malware-Spread │ ├── 924.Minimize-Malware-Spread.cpp │ └── Readme.md ├── 947.Most-Stones-Removed-with-Same-Row-or-Column │ ├── 947.Most-Stones-Removed-with-Same-Row-or-Column.cpp │ └── Readme.md ├── 952.Largest-Component-Size-by-Common-Factor │ ├── 952.Largest-Component-Size-by-Common-Factor.cpp │ └── Readme.md └── 990.Satisfiability-of-Equality-Equations │ ├── 990.Satisfiability-of-Equality-Equations.cpp │ └── Readme.md └── tests ├── BFS ├── 1036.Escape-a-Large-Maze │ ├── 1036.Escape-a-Large-Maze.t.cpp │ └── CMakeLists.txt └── CMakeLists.txt ├── CMakeLists.txt ├── Divide_Conquer ├── 315.Count-of-Smaller-Numbers-After-Self │ ├── 315.Count-of-Smaller-Numbers-After-Self.t.cpp.in │ ├── 315.binary-indexed-tree.cpp │ ├── 315.binary-indexed-tree.h │ ├── 315.divided-conquer.cpp │ ├── 315.divided-conquer.h │ └── CMakeLists.txt └── CMakeLists.txt └── Dynamic_Programming ├── 072.Edit-Distance ├── 072.Edit-Distance.t.cpp └── CMakeLists.txt ├── 1027.Longest-Arithmetic-Sequence ├── 1027.Longest-Arithmetic-Sequence.t.cpp └── CMakeLists.txt └── CMakeLists.txt /.gitignore: -------------------------------------------------------------------------------- 1 | build 2 | .idea 3 | .DS_Store 4 | -------------------------------------------------------------------------------- /BFS/1036.Escape-a-Large-Maze/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/1036.Escape-a-Large-Maze/Readme.md -------------------------------------------------------------------------------- /BFS/1066.Campus-Bikes-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/1066.Campus-Bikes-II/Readme.md -------------------------------------------------------------------------------- /BFS/1136.Parallel-Courses/1136.Parallel-Courses.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/1136.Parallel-Courses/1136.Parallel-Courses.cpp -------------------------------------------------------------------------------- /BFS/1136.Parallel-Courses/Readme.md: -------------------------------------------------------------------------------- 1 | ### 1136.Parallel-Courses 2 | 3 | 常规的拓扑排序。在BFS的过程中，将层级遍历的“层数”记录下来，就是答案。 4 | -------------------------------------------------------------------------------- /BFS/1245.Tree-Diameter/1245.Tree-Diameter.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/1245.Tree-Diameter/1245.Tree-Diameter.cpp -------------------------------------------------------------------------------- /BFS/1245.Tree-Diameter/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/1245.Tree-Diameter/Readme.md -------------------------------------------------------------------------------- /BFS/126.Word-Ladder-II/126.Word-Ladder-II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/126.Word-Ladder-II/126.Word-Ladder-II.cpp -------------------------------------------------------------------------------- /BFS/126.Word-Ladder-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/126.Word-Ladder-II/Readme.md -------------------------------------------------------------------------------- /BFS/127.Word-Ladder/127.Word-Ladder.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/127.Word-Ladder/127.Word-Ladder.cpp -------------------------------------------------------------------------------- /BFS/127.Word-Ladder/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/127.Word-Ladder/Readme.md -------------------------------------------------------------------------------- /BFS/1345.Jump-Game-IV/1345.Jump-Game-IV.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/1345.Jump-Game-IV/1345.Jump-Game-IV.cpp -------------------------------------------------------------------------------- /BFS/1345.Jump-Game-IV/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/1345.Jump-Game-IV/Readme.md -------------------------------------------------------------------------------- /BFS/1462.Course-Schedule-IV/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/1462.Course-Schedule-IV/Readme.md -------------------------------------------------------------------------------- /BFS/1559.Detect-Cycles-in-2D-Grid/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/1559.Detect-Cycles-in-2D-Grid/Readme.md -------------------------------------------------------------------------------- /BFS/1591.Strange-Printer-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/1591.Strange-Printer-II/Readme.md -------------------------------------------------------------------------------- /BFS/1654.Minimum-Jumps-to-Reach-Home/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/1654.Minimum-Jumps-to-Reach-Home/Readme.md -------------------------------------------------------------------------------- /BFS/1728.Cat-and-Mouse-II/1728.Cat-and-Mouse-II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/1728.Cat-and-Mouse-II/1728.Cat-and-Mouse-II.cpp -------------------------------------------------------------------------------- /BFS/1728.Cat-and-Mouse-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/1728.Cat-and-Mouse-II/Readme.md -------------------------------------------------------------------------------- /BFS/1879.Minimum-XOR-Sum-of-Two-Arrays/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/1879.Minimum-XOR-Sum-of-Two-Arrays/Readme.md -------------------------------------------------------------------------------- /BFS/1905.Count-Sub-Islands/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/1905.Count-Sub-Islands/Readme.md -------------------------------------------------------------------------------- /BFS/2050.Parallel-Courses-III/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/2050.Parallel-Courses-III/Readme.md -------------------------------------------------------------------------------- /BFS/207.Course-Schedule/207.Course-Schedule_BFS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/207.Course-Schedule/207.Course-Schedule_BFS.cpp -------------------------------------------------------------------------------- /BFS/207.Course-Schedule/207.Course-Schedule_DFS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/207.Course-Schedule/207.Course-Schedule_DFS.cpp -------------------------------------------------------------------------------- /BFS/207.Course-Schedule/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/207.Course-Schedule/Readme.md -------------------------------------------------------------------------------- /BFS/210.Course-Schedule-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/210.Course-Schedule-II/Readme.md -------------------------------------------------------------------------------- /BFS/2101.Detonate-the-Maximum-Bombs/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/2101.Detonate-the-Maximum-Bombs/Readme.md -------------------------------------------------------------------------------- /BFS/2258.Escape-the-Spreading-Fire/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/2258.Escape-the-Spreading-Fire/Readme.md -------------------------------------------------------------------------------- /BFS/2392.Build-a-Matrix-With-Conditions/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/2392.Build-a-Matrix-With-Conditions/Readme.md -------------------------------------------------------------------------------- /BFS/2473.Minimum-Cost-to-Buy-Apples/Readme.md: -------------------------------------------------------------------------------- 1 | ### 2473.Minimum-Cost-to-Buy-Apples 2 | 3 | 无脑对每个起点都做一遍Dijkstra找到所有位置的最短路径即可。 4 | -------------------------------------------------------------------------------- /BFS/269.Alien-Dictionary/269.Alien-Dictionary.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/269.Alien-Dictionary/269.Alien-Dictionary.cpp -------------------------------------------------------------------------------- /BFS/269.Alien-Dictionary/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/269.Alien-Dictionary/Readme.md -------------------------------------------------------------------------------- /BFS/2714.Find-Shortest-Path-with-K-Hops/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/2714.Find-Shortest-Path-with-K-Hops/Readme.md -------------------------------------------------------------------------------- /BFS/2812.Find-the-Safest-Path-in-a-Grid/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/2812.Find-the-Safest-Path-in-a-Grid/Readme.md -------------------------------------------------------------------------------- /BFS/310.Minimum-Height-Trees/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/310.Minimum-Height-Trees/Readme.md -------------------------------------------------------------------------------- /BFS/3552.Grid-Teleportation-Traversal/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/3552.Grid-Teleportation-Traversal/Readme.md -------------------------------------------------------------------------------- /BFS/407.Trapping-Rain-Water-II/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/407.Trapping-Rain-Water-II/README.md -------------------------------------------------------------------------------- /BFS/444.Sequence-Reconstruction/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/444.Sequence-Reconstruction/Readme.md -------------------------------------------------------------------------------- /BFS/490.The-Maze/490.The-Maze.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/490.The-Maze/490.The-Maze.cpp -------------------------------------------------------------------------------- /BFS/490.The-Maze/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/490.The-Maze/Readme.md -------------------------------------------------------------------------------- /BFS/499.The-Maze-III/499.The-Maze-III.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/499.The-Maze-III/499.The-Maze-III.cpp -------------------------------------------------------------------------------- /BFS/499.The-Maze-III/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/499.The-Maze-III/Readme.md -------------------------------------------------------------------------------- /BFS/505.The-Maze-II/505.The-Maze-II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/505.The-Maze-II/505.The-Maze-II.cpp -------------------------------------------------------------------------------- /BFS/505.The-Maze-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/505.The-Maze-II/Readme.md -------------------------------------------------------------------------------- /BFS/529.Minesweeper/529.Minesweeper.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/529.Minesweeper/529.Minesweeper.cpp -------------------------------------------------------------------------------- /BFS/529.Minesweeper/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/529.Minesweeper/Readme.md -------------------------------------------------------------------------------- /BFS/637.Average-of-Levels-in-Binary-Tree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/637.Average-of-Levels-in-Binary-Tree/Readme.md -------------------------------------------------------------------------------- /BFS/675.Cut-Off-Trees-for-Golf-Event/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/675.Cut-Off-Trees-for-Golf-Event/Readme.md -------------------------------------------------------------------------------- /BFS/694.Number-of-Distinct-Islands/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/694.Number-of-Distinct-Islands/Readme.md -------------------------------------------------------------------------------- /BFS/743.Network-Delay-Time/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/743.Network-Delay-Time/Readme.md -------------------------------------------------------------------------------- /BFS/778.Swim-in-Rising-Water/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/778.Swim-in-Rising-Water/Readme.md -------------------------------------------------------------------------------- /BFS/785.Is-Graph-Bipartite/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/785.Is-Graph-Bipartite/Readme.md -------------------------------------------------------------------------------- /BFS/802.Find-Eventual-Safe-States/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/802.Find-Eventual-Safe-States/Readme.md -------------------------------------------------------------------------------- /BFS/815.Bus-Routes/815.Bus-Routes.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/815.Bus-Routes/815.Bus-Routes.py -------------------------------------------------------------------------------- /BFS/815.Bus-Routes/815.Bus-Routes_v1.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/815.Bus-Routes/815.Bus-Routes_v1.cpp -------------------------------------------------------------------------------- /BFS/815.Bus-Routes/815.Bus-Routes_v2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/815.Bus-Routes/815.Bus-Routes_v2.cpp -------------------------------------------------------------------------------- /BFS/815.Bus-Routes/815.Bus-Routes_v3.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/815.Bus-Routes/815.Bus-Routes_v3.cpp -------------------------------------------------------------------------------- /BFS/815.Bus-Routes/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/815.Bus-Routes/Readme.md -------------------------------------------------------------------------------- /BFS/838.Push-Dominoes/838.Push-Dominoes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/838.Push-Dominoes/838.Push-Dominoes.cpp -------------------------------------------------------------------------------- /BFS/838.Push-Dominoes/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/838.Push-Dominoes/Readme.md -------------------------------------------------------------------------------- /BFS/847.Shortest-Path-Visiting-All-Nodes/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/847.Shortest-Path-Visiting-All-Nodes/Readme.md -------------------------------------------------------------------------------- /BFS/854.K-Similar-Strings/854.K-Similar-Strings.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/854.K-Similar-Strings/854.K-Similar-Strings.cpp -------------------------------------------------------------------------------- /BFS/864.Shortest-Path-to-Get-All-Keys/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/864.Shortest-Path-to-Get-All-Keys/Readme.md -------------------------------------------------------------------------------- /BFS/913.Cat-and-Mouse/913.Cat-and-Mouse.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/913.Cat-and-Mouse/913.Cat-and-Mouse.cpp -------------------------------------------------------------------------------- /BFS/913.Cat-and-Mouse/913.Cat-and-Mouse.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/913.Cat-and-Mouse/913.Cat-and-Mouse.py -------------------------------------------------------------------------------- /BFS/913.Cat-and-Mouse/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/913.Cat-and-Mouse/Readme.md -------------------------------------------------------------------------------- /BFS/928.Minimize-Malware-Spread-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/BFS/928.Minimize-Malware-Spread-II/Readme.md -------------------------------------------------------------------------------- /Binary_Search/029.Divide-Two-Integers/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Binary_Search/029.Divide-Two-Integers/Readme.md -------------------------------------------------------------------------------- /Binary_Search/034.Search-for-a-Range/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Binary_Search/034.Search-for-a-Range/Readme.md -------------------------------------------------------------------------------- /Binary_Search/1201.Ugly-Number-III/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Binary_Search/1201.Ugly-Number-III/Readme.md -------------------------------------------------------------------------------- /Binary_Search/1231.Divide-Chocolate/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Binary_Search/1231.Divide-Chocolate/Readme.md -------------------------------------------------------------------------------- /Binary_Search/162.Find-Peak-Element/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Binary_Search/162.Find-Peak-Element/Readme.md -------------------------------------------------------------------------------- /Binary_Search/1891.Cutting-Ribbons/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Binary_Search/1891.Cutting-Ribbons/Readme.md -------------------------------------------------------------------------------- /Binary_Search/1901.Find-a-Peak-Element-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Binary_Search/1901.Find-a-Peak-Element-II/Readme.md -------------------------------------------------------------------------------- /Binary_Search/1922.Count-Good-Numbers/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Binary_Search/1922.Count-Good-Numbers/Readme.md -------------------------------------------------------------------------------- /Binary_Search/2560.House-Robber-IV/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Binary_Search/2560.House-Robber-IV/Readme.md -------------------------------------------------------------------------------- /Binary_Search/275.H-Index-II/275.H-Index II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Binary_Search/275.H-Index-II/275.H-Index II.cpp -------------------------------------------------------------------------------- /Binary_Search/275.H-Index-II/275.H-Index-II_v2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Binary_Search/275.H-Index-II/275.H-Index-II_v2.cpp -------------------------------------------------------------------------------- /Binary_Search/275.H-Index-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Binary_Search/275.H-Index-II/Readme.md -------------------------------------------------------------------------------- /Binary_Search/475.Heaters/475.Heaters.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Binary_Search/475.Heaters/475.Heaters.cpp -------------------------------------------------------------------------------- /Binary_Search/475.Heaters/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Binary_Search/475.Heaters/Readme.md -------------------------------------------------------------------------------- /Binary_Search/483.Smallest-Good-Base/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Binary_Search/483.Smallest-Good-Base/Readme.md -------------------------------------------------------------------------------- /Binary_Search/658.Find-K-Closest-Elements/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Binary_Search/658.Find-K-Closest-Elements/Readme.md -------------------------------------------------------------------------------- /Bit_Manipulation/136.Single-Number/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Bit_Manipulation/136.Single-Number/Readme.md -------------------------------------------------------------------------------- /Bit_Manipulation/137.Single-Number-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Bit_Manipulation/137.Single-Number-II/Readme.md -------------------------------------------------------------------------------- /Bit_Manipulation/260.Single-Number-III/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Bit_Manipulation/260.Single-Number-III/Readme.md -------------------------------------------------------------------------------- /Bit_Manipulation/2680.Maximum-OR/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Bit_Manipulation/2680.Maximum-OR/Readme.md -------------------------------------------------------------------------------- /Bit_Manipulation/3133.Minimum-Array-End/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Bit_Manipulation/3133.Minimum-Array-End/Readme.md -------------------------------------------------------------------------------- /Bit_Manipulation/342.Power-of-Four/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Bit_Manipulation/342.Power-of-Four/Readme.md -------------------------------------------------------------------------------- /Bit_Manipulation/371.Sum-of-Two-Integers/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Bit_Manipulation/371.Sum-of-Two-Integers/Readme.md -------------------------------------------------------------------------------- /CMakeLists.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/CMakeLists.txt -------------------------------------------------------------------------------- /DFS/037.Sudoku-Solver/037.Sudoku-Solver.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/037.Sudoku-Solver/037.Sudoku-Solver.cpp -------------------------------------------------------------------------------- /DFS/037.Sudoku-Solver/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/037.Sudoku-Solver/Readme.md -------------------------------------------------------------------------------- /DFS/040.Combination-Sum-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/040.Combination-Sum-II/Readme.md -------------------------------------------------------------------------------- /DFS/051.N-Queens/051.N-Queens.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/051.N-Queens/051.N-Queens.cpp -------------------------------------------------------------------------------- /DFS/051.N-Queens/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/051.N-Queens/Readme.md -------------------------------------------------------------------------------- /DFS/090.Subsets-II/090.Subsets-II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/090.Subsets-II/090.Subsets-II.cpp -------------------------------------------------------------------------------- /DFS/090.Subsets-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/090.Subsets-II/Readme.md -------------------------------------------------------------------------------- /DFS/1306.Jump-Game-III/1306.Jump-Game-III.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/1306.Jump-Game-III/1306.Jump-Game-III.cpp -------------------------------------------------------------------------------- /DFS/1306.Jump-Game-III/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/1306.Jump-Game-III/Readme.md -------------------------------------------------------------------------------- /DFS/1307.Verbal-Arithmetic-Puzzle/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/1307.Verbal-Arithmetic-Puzzle/Readme.md -------------------------------------------------------------------------------- /DFS/1340.Jump-Game-V/1340.Jump-Game-V_v1.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/1340.Jump-Game-V/1340.Jump-Game-V_v1.cpp -------------------------------------------------------------------------------- /DFS/1340.Jump-Game-V/1340.Jump-Game-V_v2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/1340.Jump-Game-V/1340.Jump-Game-V_v2.cpp -------------------------------------------------------------------------------- /DFS/1340.Jump-Game-V/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/1340.Jump-Game-V/Readme.md -------------------------------------------------------------------------------- /DFS/1766.Tree-of-Coprimes/1766.Tree-of-Coprimes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/1766.Tree-of-Coprimes/1766.Tree-of-Coprimes.cpp -------------------------------------------------------------------------------- /DFS/1766.Tree-of-Coprimes/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/1766.Tree-of-Coprimes/Readme.md -------------------------------------------------------------------------------- /DFS/1778.Shortest-Path-in-a-Hidden-Grid/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/1778.Shortest-Path-in-a-Hidden-Grid/Readme.md -------------------------------------------------------------------------------- /DFS/200.Number-of-Islands/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/200.Number-of-Islands/Readme.md -------------------------------------------------------------------------------- /DFS/2065.Maximum-Path-Quality-of-a-Graph/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/2065.Maximum-Path-Quality-of-a-Graph/Readme.md -------------------------------------------------------------------------------- /DFS/2305.Fair-Distribution-of-Cookies/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/2305.Fair-Distribution-of-Cookies/Readme.md -------------------------------------------------------------------------------- /DFS/2597.The-Number-of-Beautiful-Subsets/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/2597.The-Number-of-Beautiful-Subsets/Readme.md -------------------------------------------------------------------------------- /DFS/2741.Special-Permutations/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/2741.Special-Permutations/Readme.md -------------------------------------------------------------------------------- /DFS/2746.Decremental-String-Concatenation/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/2746.Decremental-String-Concatenation/Readme.md -------------------------------------------------------------------------------- /DFS/282.Expression-Add-Operators/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/282.Expression-Add-Operators/Readme.md -------------------------------------------------------------------------------- /DFS/291.Word-Pattern-II/291.Word-Pattern-II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/291.Word-Pattern-II/291.Word-Pattern-II.cpp -------------------------------------------------------------------------------- /DFS/291.Word-Pattern-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/291.Word-Pattern-II/Readme.md -------------------------------------------------------------------------------- /DFS/301.Remove-Invalid-Parentheses/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/301.Remove-Invalid-Parentheses/Readme.md -------------------------------------------------------------------------------- /DFS/312.Burst-Balloons/312.Burst-Balloons-DFS.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/312.Burst-Balloons/312.Burst-Balloons-DFS.py -------------------------------------------------------------------------------- /DFS/312.Burst-Balloons/312.Burst-Balloons-DP.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/312.Burst-Balloons/312.Burst-Balloons-DP.cpp -------------------------------------------------------------------------------- /DFS/312.Burst-Balloons/312.Burst-Balloons-DP.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/312.Burst-Balloons/312.Burst-Balloons-DP.py -------------------------------------------------------------------------------- /DFS/312.Burst-Balloons/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/312.Burst-Balloons/Readme.md -------------------------------------------------------------------------------- /DFS/332.Reconstruct-Itinerary/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/332.Reconstruct-Itinerary/Readme.md -------------------------------------------------------------------------------- /DFS/351.Android-Unlock-Patterns/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/351.Android-Unlock-Patterns/Readme.md -------------------------------------------------------------------------------- /DFS/3669.Balanced-K-Factor-Decomposition/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/3669.Balanced-K-Factor-Decomposition/Readme.md -------------------------------------------------------------------------------- /DFS/399.Evaluate-Division/399.Evaluate Division.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/399.Evaluate-Division/399.Evaluate Division.cpp -------------------------------------------------------------------------------- /DFS/399.Evaluate-Division/399.Evaluate-Division.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/399.Evaluate-Division/399.Evaluate-Division.py -------------------------------------------------------------------------------- /DFS/399.Evaluate-Division/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/399.Evaluate-Division/Readme.md -------------------------------------------------------------------------------- /DFS/403.Frog-Jump/403.Frog-Jump_v1.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/403.Frog-Jump/403.Frog-Jump_v1.cpp -------------------------------------------------------------------------------- /DFS/403.Frog-Jump/403.Frog-Jump_v2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/403.Frog-Jump/403.Frog-Jump_v2.cpp -------------------------------------------------------------------------------- /DFS/403.Frog-Jump/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/403.Frog-Jump/Readme.md -------------------------------------------------------------------------------- /DFS/417.Pacific-Atlantic-Water-Flow/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/417.Pacific-Atlantic-Water-Flow/Readme.md -------------------------------------------------------------------------------- /DFS/425.Word-Squares/425.Word-Squares.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/425.Word-Squares/425.Word-Squares.cpp -------------------------------------------------------------------------------- /DFS/425.Word-Squares/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/425.Word-Squares/Readme.md -------------------------------------------------------------------------------- /DFS/473.Matchsticks-to-Square/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/473.Matchsticks-to-Square/Readme.md -------------------------------------------------------------------------------- /DFS/488.Zuma-Game/488.Zuma-Game.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/488.Zuma-Game/488.Zuma-Game.cpp -------------------------------------------------------------------------------- /DFS/488.Zuma-Game/488.Zuma-Game.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/488.Zuma-Game/488.Zuma-Game.py -------------------------------------------------------------------------------- /DFS/488.Zuma-Game/488.Zuma-Game_v2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/488.Zuma-Game/488.Zuma-Game_v2.cpp -------------------------------------------------------------------------------- /DFS/488.Zuma-Game/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/488.Zuma-Game/Readme.md -------------------------------------------------------------------------------- /DFS/489.Robot-Room-Cleaner/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/489.Robot-Room-Cleaner/Readme.md -------------------------------------------------------------------------------- /DFS/491.Increasing-Subsequences/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/491.Increasing-Subsequences/Readme.md -------------------------------------------------------------------------------- /DFS/546.Remove-Boxes/546.Remove-Boxes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/546.Remove-Boxes/546.Remove-Boxes.cpp -------------------------------------------------------------------------------- /DFS/546.Remove-Boxes/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/546.Remove-Boxes/Readme.md -------------------------------------------------------------------------------- /DFS/638.Shopping-Offers/638.Shopping-Offers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/638.Shopping-Offers/638.Shopping-Offers.cpp -------------------------------------------------------------------------------- /DFS/638.Shopping-Offers/638.Shopping-Offers.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/638.Shopping-Offers/638.Shopping-Offers.py -------------------------------------------------------------------------------- /DFS/638.Shopping-Offers/638.Shopping-Offers_v2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/638.Shopping-Offers/638.Shopping-Offers_v2.cpp -------------------------------------------------------------------------------- /DFS/638.Shopping-Offers/638.Shopping-Offers_v3.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/638.Shopping-Offers/638.Shopping-Offers_v3.cpp -------------------------------------------------------------------------------- /DFS/638.Shopping-Offers/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/638.Shopping-Offers/Readme.md -------------------------------------------------------------------------------- /DFS/698.Partition-to-K-Equal-Sum-Subsets/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/698.Partition-to-K-Equal-Sum-Subsets/Readme.md -------------------------------------------------------------------------------- /DFS/803.Bricks-Falling-When-Hit/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/803.Bricks-Falling-When-Hit/Readme.md -------------------------------------------------------------------------------- /DFS/959.Regions-Cut-By-Slashes/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/959.Regions-Cut-By-Slashes/Readme.md -------------------------------------------------------------------------------- /DFS/996.Number-of-Squareful-Arrays/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/DFS/996.Number-of-Squareful-Arrays/Readme.md -------------------------------------------------------------------------------- /Deque/1425.Constrained-Subsequence-Sum/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Deque/1425.Constrained-Subsequence-Sum/Readme.md -------------------------------------------------------------------------------- /Deque/1499.Max-Value-of-Equation/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Deque/1499.Max-Value-of-Equation/Readme.md -------------------------------------------------------------------------------- /Deque/1562.Find-Latest-Group-of-Size-M/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Deque/1562.Find-Latest-Group-of-Size-M/Readme.md -------------------------------------------------------------------------------- /Deque/1696.Jump-Game-VI/1696.Jump-Game-VI.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Deque/1696.Jump-Game-VI/1696.Jump-Game-VI.cpp -------------------------------------------------------------------------------- /Deque/1696.Jump-Game-VI/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Deque/1696.Jump-Game-VI/Readme.md -------------------------------------------------------------------------------- /Deque/1776.Car-Fleet-II/1776.Car-Fleet-II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Deque/1776.Car-Fleet-II/1776.Car-Fleet-II.cpp -------------------------------------------------------------------------------- /Deque/1776.Car-Fleet-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Deque/1776.Car-Fleet-II/Readme.md -------------------------------------------------------------------------------- /Deque/239.Sliding-Window-Maximum/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Deque/239.Sliding-Window-Maximum/Readme.md -------------------------------------------------------------------------------- /Deque/2762.Continuous-Subarrays/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Deque/2762.Continuous-Subarrays/Readme.md -------------------------------------------------------------------------------- /Design/1146.Snapshot-Array/1146.Snapshot-Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/1146.Snapshot-Array/1146.Snapshot-Array.cpp -------------------------------------------------------------------------------- /Design/1146.Snapshot-Array/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/1146.Snapshot-Array/Readme.md -------------------------------------------------------------------------------- /Design/1172.Dinner-Plate-Stacks/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/1172.Dinner-Plate-Stacks/Readme.md -------------------------------------------------------------------------------- /Design/1352.Product-of-the-Last-K-Numbers/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/1352.Product-of-the-Last-K-Numbers/Readme.md -------------------------------------------------------------------------------- /Design/146.LRU-Cache/146.LRU-Cache.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/146.LRU-Cache/146.LRU-Cache.cpp -------------------------------------------------------------------------------- /Design/146.LRU-Cache/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/146.LRU-Cache/Readme.md -------------------------------------------------------------------------------- /Design/1622.Fancy-Sequence/1622.Fancy-Sequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/1622.Fancy-Sequence/1622.Fancy-Sequence.cpp -------------------------------------------------------------------------------- /Design/1622.Fancy-Sequence/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/1622.Fancy-Sequence/Readme.md -------------------------------------------------------------------------------- /Design/2166.Design-Bitset/2166.Design-Bitset.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/2166.Design-Bitset/2166.Design-Bitset.cpp -------------------------------------------------------------------------------- /Design/2166.Design-Bitset/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/2166.Design-Bitset/Readme.md -------------------------------------------------------------------------------- /Design/2227.Encrypt-and-Decrypt-Strings/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/2227.Encrypt-and-Decrypt-Strings/Readme.md -------------------------------------------------------------------------------- /Design/2296.Design-a-Text-Editor/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/2296.Design-a-Text-Editor/Readme.md -------------------------------------------------------------------------------- /Design/355.Design-Twitter/355.Design-Twitter.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/355.Design-Twitter/355.Design-Twitter.cpp -------------------------------------------------------------------------------- /Design/355.Design-Twitter/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/355.Design-Twitter/Readme.md -------------------------------------------------------------------------------- /Design/380.Insert-Delete-GetRandom-O-1/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/380.Insert-Delete-GetRandom-O-1/Readme.md -------------------------------------------------------------------------------- /Design/432.All-O-one-Data-Structure/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/432.All-O-one-Data-Structure/Readme.md -------------------------------------------------------------------------------- /Design/460.LFU-Cache/460.LFU Cache.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/460.LFU-Cache/460.LFU Cache.cpp -------------------------------------------------------------------------------- /Design/460.LFU-Cache/460.LFU-Cache_v2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/460.LFU-Cache/460.LFU-Cache_v2.cpp -------------------------------------------------------------------------------- /Design/460.LFU-Cache/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/460.LFU-Cache/Readme.md -------------------------------------------------------------------------------- /Design/535.Encode-and-Decode-TinyURL/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/535.Encode-and-Decode-TinyURL/Readme.md -------------------------------------------------------------------------------- /Design/631.Design-Excel-Sum-Formula/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/631.Design-Excel-Sum-Formula/Readme.md -------------------------------------------------------------------------------- /Design/716.Max-Stack/716.Max-Stack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/716.Max-Stack/716.Max-Stack.cpp -------------------------------------------------------------------------------- /Design/716.Max-Stack/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/716.Max-Stack/Readme.md -------------------------------------------------------------------------------- /Design/895.Maximum-Frequency-Stack/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Design/895.Maximum-Frequency-Stack/Readme.md -------------------------------------------------------------------------------- /Divide_Conquer/327.Count-of-Range-Sum/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Divide_Conquer/327.Count-of-Range-Sum/Readme.md -------------------------------------------------------------------------------- /Divide_Conquer/493.Reverse-Pairs/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Divide_Conquer/493.Reverse-Pairs/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/044.Wildcard-Matching/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/044.Wildcard-Matching/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/053.Maximum-Subarray/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/053.Maximum-Subarray/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/072.Edit-Distance/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/072.Edit-Distance/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/091.Decode-Ways/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/091.Decode-Ways/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/1035.Uncrossed-Lines/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/1035.Uncrossed-Lines/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/120.Triangle/120.Triangle.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/120.Triangle/120.Triangle.cpp -------------------------------------------------------------------------------- /Dynamic_Programming/120.Triangle/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/120.Triangle/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/1463.Cherry-Pickup-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/1463.Cherry-Pickup-II/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/1473.Paint-House-III/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/1473.Paint-House-III/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/1563.Stone-Game-V/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/1563.Stone-Game-V/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/1690.Stone-Game-VII/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/1690.Stone-Game-VII/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/174.Dungeon-Game/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/174.Dungeon-Game/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/1872.Stone-Game-VIII/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/1872.Stone-Game-VIII/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/198.House-Robber/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/198.House-Robber/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/213.House-Robber-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/213.House-Robber-II/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/221.Maximal-Square/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/221.Maximal-Square/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/264.Ugly-Number-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/264.Ugly-Number-II/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/265.Paint-House-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/265.Paint-House-II/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/276.Paint-Fence/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/276.Paint-Fence/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/313.Super-Ugly-Number/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/313.Super-Ugly-Number/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/322.Coin-Change/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/322.Coin-Change/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/474.Ones-and-Zeroes/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/474.Ones-and-Zeroes/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/494.Target-Sum/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/494.Target-Sum/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/514.Freedom-Trail/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/514.Freedom-Trail/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/518.Coin-Change-2/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/518.Coin-Change-2/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/639.Decode-Ways-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/639.Decode-Ways-II/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/650.2-Keys-Keyboard/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/650.2-Keys-Keyboard/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/651.4-Keys-Keyboard/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/651.4-Keys-Keyboard/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/656.Coin-Path/656.Coin-Path.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/656.Coin-Path/656.Coin-Path.cpp -------------------------------------------------------------------------------- /Dynamic_Programming/656.Coin-Path/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/656.Coin-Path/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/664.Strange-Printer/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/664.Strange-Printer/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/740.Delete-and-Earn/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/740.Delete-and-Earn/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/741.Cherry-Pickup/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/741.Cherry-Pickup/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/818.Race-Car/818.Race-Car.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/818.Race-Car/818.Race-Car.cpp -------------------------------------------------------------------------------- /Dynamic_Programming/818.Race-Car/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/818.Race-Car/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/837.New-21-Game/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/837.New-21-Game/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/887.Super-Egg-Drop/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/887.Super-Egg-Drop/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/935.Knight-Dialer/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/935.Knight-Dialer/Readme.md -------------------------------------------------------------------------------- /Dynamic_Programming/956.Tallest-Billboard/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Dynamic_Programming/956.Tallest-Billboard/Readme.md -------------------------------------------------------------------------------- /Graph/1514.Path-with-Maximum-Probability/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Graph/1514.Path-with-Maximum-Probability/Readme.md -------------------------------------------------------------------------------- /Graph/1782.Count-Pairs-Of-Nodes/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Graph/1782.Count-Pairs-Of-Nodes/Readme.md -------------------------------------------------------------------------------- /Graph/2097.Valid-Arrangement-of-Pairs/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Graph/2097.Valid-Arrangement-of-Pairs/Readme.md -------------------------------------------------------------------------------- /Graph/2360.Longest-Cycle-in-a-Graph/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Graph/2360.Longest-Cycle-in-a-Graph/Readme.md -------------------------------------------------------------------------------- /Graph/2603.Collect-Coins-in-a-Tree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Graph/2603.Collect-Coins-in-a-Tree/Readme.md -------------------------------------------------------------------------------- /Graph/2608.Shortest-Cycle-in-a-Graph/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Graph/2608.Shortest-Cycle-in-a-Graph/Readme.md -------------------------------------------------------------------------------- /Graph/2699.Modify-Graph-Edge-Weights/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Graph/2699.Modify-Graph-Edge-Weights/Readme.md -------------------------------------------------------------------------------- /Graph/3123.Find-Edges-in-Shortest-Paths/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Graph/3123.Find-Edges-in-Shortest-Paths/Readme.md -------------------------------------------------------------------------------- /Graph/787.Cheapest-Flights-Within-K-Stops/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Graph/787.Cheapest-Flights-Within-K-Stops/Readme.md -------------------------------------------------------------------------------- /Greedy/031.Next-Permutation/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/031.Next-Permutation/Readme.md -------------------------------------------------------------------------------- /Greedy/041.First-Missing-Positive/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/041.First-Missing-Positive/Readme.md -------------------------------------------------------------------------------- /Greedy/045.Jump-Game-II/045.Jump-Game-II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/045.Jump-Game-II/045.Jump-Game-II.cpp -------------------------------------------------------------------------------- /Greedy/045.Jump-Game-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/045.Jump-Game-II/Readme.md -------------------------------------------------------------------------------- /Greedy/055.Jump-Game/055.Jump-Game.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/055.Jump-Game/055.Jump-Game.cpp -------------------------------------------------------------------------------- /Greedy/055.Jump-Game/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/055.Jump-Game/Readme.md -------------------------------------------------------------------------------- /Greedy/1024.Video-Stitching/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/1024.Video-Stitching/Readme.md -------------------------------------------------------------------------------- /Greedy/1054.Distant-Barcodes/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/1054.Distant-Barcodes/Readme.md -------------------------------------------------------------------------------- /Greedy/1055.Shortest-Way-to-Form-String/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/1055.Shortest-Way-to-Form-String/Readme.md -------------------------------------------------------------------------------- /Greedy/1191.K-Concatenation-Maximum-Sum/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/1191.K-Concatenation-Maximum-Sum/Readme.md -------------------------------------------------------------------------------- /Greedy/1272.Remove-Interval/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/1272.Remove-Interval/Readme.md -------------------------------------------------------------------------------- /Greedy/1288.Remove-Covered-Intervals/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/1288.Remove-Covered-Intervals/Readme.md -------------------------------------------------------------------------------- /Greedy/134.Gas-Station/134.Gas-Station.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/134.Gas-Station/134.Gas-Station.cpp -------------------------------------------------------------------------------- /Greedy/134.Gas-Station/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/134.Gas-Station/Readme.md -------------------------------------------------------------------------------- /Greedy/135.Candy/135.Candy.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/135.Candy/135.Candy.cpp -------------------------------------------------------------------------------- /Greedy/135.Candy/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/135.Candy/Readme.md -------------------------------------------------------------------------------- /Greedy/1402.Reducing-Dishes/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/1402.Reducing-Dishes/Readme.md -------------------------------------------------------------------------------- /Greedy/1405.Longest-Happy-String/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/1405.Longest-Happy-String/Readme.md -------------------------------------------------------------------------------- /Greedy/1540.Can-Convert-String-in-K-Moves/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/1540.Can-Convert-String-in-K-Moves/Readme.md -------------------------------------------------------------------------------- /Greedy/164.Maximum-Gap/164.Maximum Gap.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/164.Maximum-Gap/164.Maximum Gap.cpp -------------------------------------------------------------------------------- /Greedy/164.Maximum-Gap/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/164.Maximum-Gap/Readme.md -------------------------------------------------------------------------------- /Greedy/1664.Ways-to-Make-a-Fair-Array/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/1664.Ways-to-Make-a-Fair-Array/Readme.md -------------------------------------------------------------------------------- /Greedy/1686.Stone-Game-VI/1686.Stone-Game-VI.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/1686.Stone-Game-VI/1686.Stone-Game-VI.cpp -------------------------------------------------------------------------------- /Greedy/1686.Stone-Game-VI/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/1686.Stone-Game-VI/Readme.md -------------------------------------------------------------------------------- /Greedy/179.Largest-Number/179.Largest-Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/179.Largest-Number/179.Largest-Number.cpp -------------------------------------------------------------------------------- /Greedy/179.Largest-Number/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/179.Largest-Number/Readme.md -------------------------------------------------------------------------------- /Greedy/1840.Maximum-Building-Height/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/1840.Maximum-Building-Height/Readme.md -------------------------------------------------------------------------------- /Greedy/1982.Find-Array-Given-Subset-Sums/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/1982.Find-Array-Given-Subset-Sums/Readme.md -------------------------------------------------------------------------------- /Greedy/2008.Maximum-Earnings-From-Taxi/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/2008.Maximum-Earnings-From-Taxi/Readme.md -------------------------------------------------------------------------------- /Greedy/2055.Plates-Between-Candles/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/2055.Plates-Between-Candles/Readme.md -------------------------------------------------------------------------------- /Greedy/2122.Recover-the-Original-Array/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/2122.Recover-the-Original-Array/Readme.md -------------------------------------------------------------------------------- /Greedy/2262.Total-Appeal-of-A-String/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/2262.Total-Appeal-of-A-String/Readme.md -------------------------------------------------------------------------------- /Greedy/229.Majority-Element-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/229.Majority-Element-II/Readme.md -------------------------------------------------------------------------------- /Greedy/2306.Naming-a-Company/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/2306.Naming-a-Company/Readme.md -------------------------------------------------------------------------------- /Greedy/2365.Task-Scheduler-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/2365.Task-Scheduler-II/Readme.md -------------------------------------------------------------------------------- /Greedy/2370.Longest-Ideal-Subsequence/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/2370.Longest-Ideal-Subsequence/Readme.md -------------------------------------------------------------------------------- /Greedy/2498.Frog-Jump-II/2498.Frog-Jump-II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/2498.Frog-Jump-II/2498.Frog-Jump-II.cpp -------------------------------------------------------------------------------- /Greedy/2498.Frog-Jump-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/2498.Frog-Jump-II/Readme.md -------------------------------------------------------------------------------- /Greedy/2551.Put-Marbles-in-Bags/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/2551.Put-Marbles-in-Bags/Readme.md -------------------------------------------------------------------------------- /Greedy/2561.Rearranging-Fruits/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/2561.Rearranging-Fruits/Readme.md -------------------------------------------------------------------------------- /Greedy/2568.Minimum-Impossible-OR/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/2568.Minimum-Impossible-OR/Readme.md -------------------------------------------------------------------------------- /Greedy/2573.Find-the-String-with-LCP/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/2573.Find-the-String-with-LCP/Readme.md -------------------------------------------------------------------------------- /Greedy/268.Missing-Number/268.Missing-Number_v1.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/268.Missing-Number/268.Missing-Number_v1.cpp -------------------------------------------------------------------------------- /Greedy/268.Missing-Number/268.Missing-Number_v2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/268.Missing-Number/268.Missing-Number_v2.cpp -------------------------------------------------------------------------------- /Greedy/268.Missing-Number/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/268.Missing-Number/Readme.md -------------------------------------------------------------------------------- /Greedy/2868.The-Wording-Game/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/2868.The-Wording-Game/Readme.md -------------------------------------------------------------------------------- /Greedy/300.Longest-Increasing-Subsequence/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/300.Longest-Increasing-Subsequence/Readme.md -------------------------------------------------------------------------------- /Greedy/330.Patching-Array/330.Patching-Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/330.Patching-Array/330.Patching-Array.cpp -------------------------------------------------------------------------------- /Greedy/330.Patching-Array/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/330.Patching-Array/Readme.md -------------------------------------------------------------------------------- /Greedy/334.Increasing-Triplet-Subsequence/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/334.Increasing-Triplet-Subsequence/Readme.md -------------------------------------------------------------------------------- /Greedy/354.Russian-Doll-Envelopes/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/354.Russian-Doll-Envelopes/Readme.md -------------------------------------------------------------------------------- /Greedy/386.Lexicographical-Numbers/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/386.Lexicographical-Numbers/Readme.md -------------------------------------------------------------------------------- /Greedy/406.Queue-Reconstruction-by-Height/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/406.Queue-Reconstruction-by-Height/Readme.md -------------------------------------------------------------------------------- /Greedy/435.Non-overlapping-Intervals/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/435.Non-overlapping-Intervals/Readme.md -------------------------------------------------------------------------------- /Greedy/484.Find-Permutation/484.Find-Permutation.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/484.Find-Permutation/484.Find-Permutation.py -------------------------------------------------------------------------------- /Greedy/484.Find-Permutation/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/484.Find-Permutation/Readme.md -------------------------------------------------------------------------------- /Greedy/517.Super-Washing-Machines/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/517.Super-Washing-Machines/Readme.md -------------------------------------------------------------------------------- /Greedy/556.Next-Greater-Element-III/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/556.Next-Greater-Element-III/Readme.md -------------------------------------------------------------------------------- /Greedy/624.Maximum-Distance-in-Arrays/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/624.Maximum-Distance-in-Arrays/Readme.md -------------------------------------------------------------------------------- /Greedy/645.Set-Mismatch/645.Set-Mismatch.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/645.Set-Mismatch/645.Set-Mismatch.cpp -------------------------------------------------------------------------------- /Greedy/645.Set-Mismatch/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/645.Set-Mismatch/Readme.md -------------------------------------------------------------------------------- /Greedy/646.Maximum-Length-of-Pair-Chain/Readme.md: -------------------------------------------------------------------------------- 1 | ### 646.Maximum-Length-of-Pair-Chain 2 | 3 | 此题本质和 435.Non-overlapping-Intervals 一模一样。 4 | -------------------------------------------------------------------------------- /Greedy/649.Dota2-Senate/649.Dota2-Senate.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/649.Dota2-Senate/649.Dota2-Senate.cpp -------------------------------------------------------------------------------- /Greedy/649.Dota2-Senate/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/649.Dota2-Senate/Readme.md -------------------------------------------------------------------------------- /Greedy/665.Non-decreasing-Array/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/665.Non-decreasing-Array/Readme.md -------------------------------------------------------------------------------- /Greedy/667.Beautiful-Arrangement-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/667.Beautiful-Arrangement-II/Readme.md -------------------------------------------------------------------------------- /Greedy/670.Maximum-Swap/670.Maximum-Swap.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/670.Maximum-Swap/670.Maximum-Swap.cpp -------------------------------------------------------------------------------- /Greedy/670.Maximum-Swap/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/670.Maximum-Swap/Readme.md -------------------------------------------------------------------------------- /Greedy/678.Valid-Parenthesis-String/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/678.Valid-Parenthesis-String/Readme.md -------------------------------------------------------------------------------- /Greedy/683.K-Empty-Slots/683.K-Empty-Slots.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/683.K-Empty-Slots/683.K-Empty-Slots.cpp -------------------------------------------------------------------------------- /Greedy/683.K-Empty-Slots/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/683.K-Empty-Slots/Readme.md -------------------------------------------------------------------------------- /Greedy/727.Minimum-Window-Subsequence/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/727.Minimum-Window-Subsequence/Readme.md -------------------------------------------------------------------------------- /Greedy/731.My-Calendar-II/731.My-Calendar-II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/731.My-Calendar-II/731.My-Calendar-II.cpp -------------------------------------------------------------------------------- /Greedy/731.My-Calendar-II/731.My-Calendar-II_v2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/731.My-Calendar-II/731.My-Calendar-II_v2.cpp -------------------------------------------------------------------------------- /Greedy/731.My-Calendar-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/731.My-Calendar-II/Readme.md -------------------------------------------------------------------------------- /Greedy/761.Special-Binary-String/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/761.Special-Binary-String/Readme.md -------------------------------------------------------------------------------- /Greedy/767.Reorganize-String/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/767.Reorganize-String/Readme.md -------------------------------------------------------------------------------- /Greedy/781.Rabbits-in-Forest/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/781.Rabbits-in-Forest/Readme.md -------------------------------------------------------------------------------- /Greedy/826.Most-Profit-Assigning-Work/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/826.Most-Profit-Assigning-Work/Readme.md -------------------------------------------------------------------------------- /Greedy/881.Boats-to-Save-People/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/881.Boats-to-Save-People/Readme.md -------------------------------------------------------------------------------- /Greedy/910.Smallest-Range-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/910.Smallest-Range-II/Readme.md -------------------------------------------------------------------------------- /Greedy/932.Beautiful-Array/932.Beautiful-Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/932.Beautiful-Array/932.Beautiful-Array.cpp -------------------------------------------------------------------------------- /Greedy/932.Beautiful-Array/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/932.Beautiful-Array/Readme.md -------------------------------------------------------------------------------- /Greedy/936.Stamping-The-Sequence/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/936.Stamping-The-Sequence/Readme.md -------------------------------------------------------------------------------- /Greedy/942.DI-String-Match/942.DI-String-Match.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/942.DI-String-Match/942.DI-String-Match.cpp -------------------------------------------------------------------------------- /Greedy/942.DI-String-Match/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/942.DI-String-Match/Readme.md -------------------------------------------------------------------------------- /Greedy/948.Bag-of-Tokens/948.Bag-of-Tokens.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/948.Bag-of-Tokens/948.Bag-of-Tokens.cpp -------------------------------------------------------------------------------- /Greedy/948.Bag-of-Tokens/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/948.Bag-of-Tokens/Readme.md -------------------------------------------------------------------------------- /Greedy/968.Binary-Tree-Cameras/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/968.Binary-Tree-Cameras/Readme.md -------------------------------------------------------------------------------- /Greedy/984.String-Without-AAA-or-BBB/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Greedy/984.String-Without-AAA-or-BBB/Readme.md -------------------------------------------------------------------------------- /Hash/049.Group-Anagrams/49.Group Anagrams.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/049.Group-Anagrams/49.Group Anagrams.cpp -------------------------------------------------------------------------------- /Hash/049.Group-Anagrams/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/049.Group-Anagrams/Readme.md -------------------------------------------------------------------------------- /Hash/1487.Making-File-Names-Unique/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/1487.Making-File-Names-Unique/Readme.md -------------------------------------------------------------------------------- /Hash/149.Max-Points-on-a-Line/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/149.Max-Points-on-a-Line/Readme.md -------------------------------------------------------------------------------- /Hash/1542.Find-Longest-Awesome-Substring/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/1542.Find-Longest-Awesome-Substring/Readme.md -------------------------------------------------------------------------------- /Hash/1590.Make-Sum-Divisible-by-P/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/1590.Make-Sum-Divisible-by-P/Readme.md -------------------------------------------------------------------------------- /Hash/166.Fraction-to-Recurring-Decimal/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/166.Fraction-to-Recurring-Decimal/Readme.md -------------------------------------------------------------------------------- /Hash/1915.Number-of-Wonderful-Substrings/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/1915.Number-of-Wonderful-Substrings/Readme.md -------------------------------------------------------------------------------- /Hash/2488.Count-Subarrays-With-Median-K/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/2488.Count-Subarrays-With-Median-K/Readme.md -------------------------------------------------------------------------------- /Hash/274.H-Index/274.H-Index_Hash.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/274.H-Index/274.H-Index_Hash.cpp -------------------------------------------------------------------------------- /Hash/274.H-Index/274.H-Index_Hash.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/274.H-Index/274.H-Index_Hash.py -------------------------------------------------------------------------------- /Hash/274.H-Index/274.H-index_Binary.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/274.H-Index/274.H-index_Binary.cpp -------------------------------------------------------------------------------- /Hash/274.H-Index/274.H-index_Pointer.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/274.H-Index/274.H-index_Pointer.cpp -------------------------------------------------------------------------------- /Hash/274.H-Index/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/274.H-Index/Readme.md -------------------------------------------------------------------------------- /Hash/2845.Count-of-Interesting-Subarrays/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/2845.Count-of-Interesting-Subarrays/Readme.md -------------------------------------------------------------------------------- /Hash/2949.Count-Beautiful-Substrings-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/2949.Count-Beautiful-Substrings-II/Readme.md -------------------------------------------------------------------------------- /Hash/2950.Number-of-Divisible-Substrings/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/2950.Number-of-Divisible-Substrings/Readme.md -------------------------------------------------------------------------------- /Hash/356.Line-Reflection/356.Line Reflection.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/356.Line-Reflection/356.Line Reflection.cpp -------------------------------------------------------------------------------- /Hash/356.Line-Reflection/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/356.Line-Reflection/Readme.md -------------------------------------------------------------------------------- /Hash/3714.Longest-Balanced-Substring-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/3714.Longest-Balanced-Substring-II/Readme.md -------------------------------------------------------------------------------- /Hash/392.Is-Subsequence/392.Is Subsequence_s1.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/392.Is-Subsequence/392.Is Subsequence_s1.cpp -------------------------------------------------------------------------------- /Hash/392.Is-Subsequence/392.Is Subsequence_s2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/392.Is-Subsequence/392.Is Subsequence_s2.cpp -------------------------------------------------------------------------------- /Hash/392.Is-Subsequence/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/392.Is-Subsequence/Readme.md -------------------------------------------------------------------------------- /Hash/409.Longest-Palindrome/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/409.Longest-Palindrome/Readme.md -------------------------------------------------------------------------------- /Hash/438.Find-All-Anagrams-in-a-String/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/438.Find-All-Anagrams-in-a-String/Readme.md -------------------------------------------------------------------------------- /Hash/446.Arithmetic-Slices-II-Subsequence/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/446.Arithmetic-Slices-II-Subsequence/Readme.md -------------------------------------------------------------------------------- /Hash/447.Number-of-Boomerangs/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/447.Number-of-Boomerangs/Readme.md -------------------------------------------------------------------------------- /Hash/525.Contiguous-Array/525.Contiguous-Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/525.Contiguous-Array/525.Contiguous-Array.cpp -------------------------------------------------------------------------------- /Hash/525.Contiguous-Array/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/525.Contiguous-Array/Readme.md -------------------------------------------------------------------------------- /Hash/532.K-diff-Pairs-in-an-Array/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/532.K-diff-Pairs-in-an-Array/Readme.md -------------------------------------------------------------------------------- /Hash/535.Encode-and-Decode-TinyURL/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/535.Encode-and-Decode-TinyURL/Readme.md -------------------------------------------------------------------------------- /Hash/594.Longest-Harmonious-Subsequence/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/594.Longest-Harmonious-Subsequence/Readme.md -------------------------------------------------------------------------------- /Hash/753.Cracking-the-Safe/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/753.Cracking-the-Safe/Readme.md -------------------------------------------------------------------------------- /Hash/890.Find-and-Replace-Pattern/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/890.Find-and-Replace-Pattern/Readme.md -------------------------------------------------------------------------------- /Hash/930.Binary-Subarrays-With-Sum/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/930.Binary-Subarrays-With-Sum/Readme.md -------------------------------------------------------------------------------- /Hash/939.Minimum-Area-Rectangle/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/939.Minimum-Area-Rectangle/Readme.md -------------------------------------------------------------------------------- /Hash/974.Subarray-Sums-Divisible-by-K/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Hash/974.Subarray-Sums-Divisible-by-K/Readme.md -------------------------------------------------------------------------------- /LCCUP/2020Fall/LCP23.魔术排列/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/LCCUP/2020Fall/LCP23.魔术排列/Readme.md -------------------------------------------------------------------------------- /LCCUP/2020Fall/LCP23.魔术排列/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/LCCUP/2020Fall/LCP23.魔术排列/code.cpp -------------------------------------------------------------------------------- /LCCUP/2020Fall/LCP24.数字游戏/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/LCCUP/2020Fall/LCP24.数字游戏/Readme.md -------------------------------------------------------------------------------- /LCCUP/2020Fall/LCP24.数字游戏/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/LCCUP/2020Fall/LCP24.数字游戏/code.cpp -------------------------------------------------------------------------------- /LCCUP/2020Fall/LCP25.古董键盘/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/LCCUP/2020Fall/LCP25.古董键盘/Readme.md -------------------------------------------------------------------------------- /LCCUP/2020Fall/LCP25.古董键盘/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/LCCUP/2020Fall/LCP25.古董键盘/code.cpp -------------------------------------------------------------------------------- /LCCUP/2021Fall/LCP43.十字路口的交通/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/LCCUP/2021Fall/LCP43.十字路口的交通/Readme.md -------------------------------------------------------------------------------- /LCCUP/2021Fall/LCP43.十字路口的交通/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/LCCUP/2021Fall/LCP43.十字路口的交通/code.cpp -------------------------------------------------------------------------------- /LCCUP/2021Spring/LCP32.批量处理任务/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/LCCUP/2021Spring/LCP32.批量处理任务/Readme.md -------------------------------------------------------------------------------- /LCCUP/2021Spring/LCP32.批量处理任务/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/LCCUP/2021Spring/LCP32.批量处理任务/code.cpp -------------------------------------------------------------------------------- /LCCUP/2021Spring/LCP35.电动车游城市/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/LCCUP/2021Spring/LCP35.电动车游城市/Readme.md -------------------------------------------------------------------------------- /LCCUP/2021Spring/LCP35.电动车游城市/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/LCCUP/2021Spring/LCP35.电动车游城市/code.cpp -------------------------------------------------------------------------------- /LCCUP/2021Spring/LCP36.最多牌组数/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/LCCUP/2021Spring/LCP36.最多牌组数/Readme.md -------------------------------------------------------------------------------- /LCCUP/2021Spring/LCP36.最多牌组数/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/LCCUP/2021Spring/LCP36.最多牌组数/code.cpp -------------------------------------------------------------------------------- /Linked_List/025.Reverse-Nodes-in-k-Group/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Linked_List/025.Reverse-Nodes-in-k-Group/Readme.md -------------------------------------------------------------------------------- /Linked_List/061.Rotate-List/061.Rotate-List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Linked_List/061.Rotate-List/061.Rotate-List.cpp -------------------------------------------------------------------------------- /Linked_List/061.Rotate-List/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Linked_List/061.Rotate-List/Readme.md -------------------------------------------------------------------------------- /Linked_List/086.Partition-List/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Linked_List/086.Partition-List/Readme.md -------------------------------------------------------------------------------- /Linked_List/092.Reverse-Linked-List-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Linked_List/092.Reverse-Linked-List-II/Readme.md -------------------------------------------------------------------------------- /Linked_List/142.Linked-List-Cycle-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Linked_List/142.Linked-List-Cycle-II/Readme.md -------------------------------------------------------------------------------- /Linked_List/143.Reorder-List/143.Reorder-List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Linked_List/143.Reorder-List/143.Reorder-List.cpp -------------------------------------------------------------------------------- /Linked_List/143.Reorder-List/143.Reorder-List.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Linked_List/143.Reorder-List/143.Reorder-List.py -------------------------------------------------------------------------------- /Linked_List/143.Reorder-List/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Linked_List/143.Reorder-List/Readme.md -------------------------------------------------------------------------------- /Linked_List/206.Reverse-Linked-List/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Linked_List/206.Reverse-Linked-List/Readme.md -------------------------------------------------------------------------------- /Linked_List/369.Plus-One-Linked-List/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Linked_List/369.Plus-One-Linked-List/Readme.md -------------------------------------------------------------------------------- /Linked_List/457.Circular-Array-Loop/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Linked_List/457.Circular-Array-Loop/Readme.md -------------------------------------------------------------------------------- /Math/046.Permutations/046.Permutations.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/046.Permutations/046.Permutations.cpp -------------------------------------------------------------------------------- /Math/046.Permutations/046.Permutations.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/046.Permutations/046.Permutations.py -------------------------------------------------------------------------------- /Math/046.Permutations/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/046.Permutations/Readme.md -------------------------------------------------------------------------------- /Math/047.Permutations-II/047.Permutations-II.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/047.Permutations-II/047.Permutations-II.py -------------------------------------------------------------------------------- /Math/047.Permutations-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/047.Permutations-II/Readme.md -------------------------------------------------------------------------------- /Math/060.Permutation-Sequence/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/060.Permutation-Sequence/Readme.md -------------------------------------------------------------------------------- /Math/077.Combinations/077.Combinations_iterative.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/077.Combinations/077.Combinations_iterative.py -------------------------------------------------------------------------------- /Math/077.Combinations/077.Combinations_recursive.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/077.Combinations/077.Combinations_recursive.py -------------------------------------------------------------------------------- /Math/077.Combinations/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/077.Combinations/Readme.md -------------------------------------------------------------------------------- /Math/089.Gray-Code/089.Gray-Code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/089.Gray-Code/089.Gray-Code.cpp -------------------------------------------------------------------------------- /Math/089.Gray-Code/089.Gray-Code_v2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/089.Gray-Code/089.Gray-Code_v2.cpp -------------------------------------------------------------------------------- /Math/089.Gray-Code/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/089.Gray-Code/Readme.md -------------------------------------------------------------------------------- /Math/1012.Numbers-With-Repeated-Digits/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/1012.Numbers-With-Repeated-Digits/Readme.md -------------------------------------------------------------------------------- /Math/1015.Smallest-Integer-Divisible-by-K/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/1015.Smallest-Integer-Divisible-by-K/Readme.md -------------------------------------------------------------------------------- /Math/1017.Convert-to-Base--2/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/1017.Convert-to-Base--2/Readme.md -------------------------------------------------------------------------------- /Math/1025.Divisor-Game/1025.Divisor-Game_v1.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/1025.Divisor-Game/1025.Divisor-Game_v1.cpp -------------------------------------------------------------------------------- /Math/1025.Divisor-Game/1025.Divisor-Game_v2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/1025.Divisor-Game/1025.Divisor-Game_v2.cpp -------------------------------------------------------------------------------- /Math/1025.Divisor-Game/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/1025.Divisor-Game/Readme.md -------------------------------------------------------------------------------- /Math/1073.Adding-Two-Negabinary-Numbers/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/1073.Adding-Two-Negabinary-Numbers/Readme.md -------------------------------------------------------------------------------- /Math/1103.Distribute-Candies-to-People/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/1103.Distribute-Candies-to-People/Readme.md -------------------------------------------------------------------------------- /Math/1250.Check-If-It-Is-a-Good-Array/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/1250.Check-If-It-Is-a-Good-Array/Readme.md -------------------------------------------------------------------------------- /Math/1286.Iterator-for-Combination/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/1286.Iterator-for-Combination/Readme.md -------------------------------------------------------------------------------- /Math/1641.Count-Sorted-Vowel-Strings/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/1641.Count-Sorted-Vowel-Strings/Readme.md -------------------------------------------------------------------------------- /Math/1643.Kth-Smallest-Instructions/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/1643.Kth-Smallest-Instructions/Readme.md -------------------------------------------------------------------------------- /Math/1739.Building-Boxes/1739.Building-Boxes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/1739.Building-Boxes/1739.Building-Boxes.cpp -------------------------------------------------------------------------------- /Math/1739.Building-Boxes/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/1739.Building-Boxes/Readme.md -------------------------------------------------------------------------------- /Math/204.Count-Primes/204.Count-Primes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/204.Count-Primes/204.Count-Primes.cpp -------------------------------------------------------------------------------- /Math/204.Count-Primes/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/204.Count-Primes/Readme.md -------------------------------------------------------------------------------- /Math/2221.Find-Triangular-Sum-of-an-Array/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/2221.Find-Triangular-Sum-of-an-Array/Readme.md -------------------------------------------------------------------------------- /Math/223.Rectangle-Area/223.Rectangle-Area.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/223.Rectangle-Area/223.Rectangle-Area.cpp -------------------------------------------------------------------------------- /Math/223.Rectangle-Area/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/223.Rectangle-Area/Readme.md -------------------------------------------------------------------------------- /Math/233.Number-of-Digit-One/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/233.Number-of-Digit-One/Readme.md -------------------------------------------------------------------------------- /Math/2514.Count-Anagrams/2514.Count-Anagrams.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/2514.Count-Anagrams/2514.Count-Anagrams.cpp -------------------------------------------------------------------------------- /Math/2514.Count-Anagrams/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/2514.Count-Anagrams/Readme.md -------------------------------------------------------------------------------- /Math/2543.Check-if-Point-Is-Reachable/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/2543.Check-if-Point-Is-Reachable/Readme.md -------------------------------------------------------------------------------- /Math/2607.Make-K-Subarray-Sums-Equal/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/2607.Make-K-Subarray-Sums-Equal/Readme.md -------------------------------------------------------------------------------- /Math/296.Best-Meeting-Point/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/296.Best-Meeting-Point/Readme.md -------------------------------------------------------------------------------- /Math/3086.Minimum-Moves-to-Pick-K-Ones/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/3086.Minimum-Moves-to-Pick-K-Ones/Readme.md -------------------------------------------------------------------------------- /Math/3102.Minimize-Manhattan-Distances/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/3102.Minimize-Manhattan-Distances/Readme.md -------------------------------------------------------------------------------- /Math/335.Self-Crossing/335.Self-Crossing.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/335.Self-Crossing/335.Self-Crossing.cpp -------------------------------------------------------------------------------- /Math/335.Self-Crossing/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/335.Self-Crossing/Readme.md -------------------------------------------------------------------------------- /Math/335.Self-Crossing/Readme2.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/335.Self-Crossing/Readme2.md -------------------------------------------------------------------------------- /Math/343.Integer-Break/343.Integer-Break.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/343.Integer-Break/343.Integer-Break.cpp -------------------------------------------------------------------------------- /Math/343.Integer-Break/343.Integer-Break_dp.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/343.Integer-Break/343.Integer-Break_dp.cpp -------------------------------------------------------------------------------- /Math/343.Integer-Break/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/343.Integer-Break/Readme.md -------------------------------------------------------------------------------- /Math/365.Water-and-Jug-Problem/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/365.Water-and-Jug-Problem/Readme.md -------------------------------------------------------------------------------- /Math/3681.Maximum-XOR-of-Subsequences/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/3681.Maximum-XOR-of-Subsequences/Readme.md -------------------------------------------------------------------------------- /Math/3700.Number-of-ZigZag-Arrays-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/3700.Number-of-ZigZag-Arrays-II/Readme.md -------------------------------------------------------------------------------- /Math/382.Linked-List-Random-Node/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/382.Linked-List-Random-Node/Readme.md -------------------------------------------------------------------------------- /Math/391.Perfect-Rectangle/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/391.Perfect-Rectangle/Readme.md -------------------------------------------------------------------------------- /Math/400.n-th-digit/400.n-th-digit.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/400.n-th-digit/400.n-th-digit.cpp -------------------------------------------------------------------------------- /Math/400.n-th-digit/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/400.n-th-digit/Readme.md -------------------------------------------------------------------------------- /Math/441.Arranging-Coins/441.Arranging-Coins.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/441.Arranging-Coins/441.Arranging-Coins.cpp -------------------------------------------------------------------------------- /Math/441.Arranging-Coins/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/441.Arranging-Coins/Readme.md -------------------------------------------------------------------------------- /Math/458.Poor-Pigs/458.Poor-Pigs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/458.Poor-Pigs/458.Poor-Pigs.cpp -------------------------------------------------------------------------------- /Math/458.Poor-Pigs/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/458.Poor-Pigs/Readme.md -------------------------------------------------------------------------------- /Math/470.Implement-Rand10--Using-Rand7/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/470.Implement-Rand10--Using-Rand7/Readme.md -------------------------------------------------------------------------------- /Math/519.Random-Flip-Matrix/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/519.Random-Flip-Matrix/Readme.md -------------------------------------------------------------------------------- /Math/528.Random-Pick-with-Weight/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/528.Random-Pick-with-Weight/Readme.md -------------------------------------------------------------------------------- /Math/587.Erect-the-Fence/587.Erect-the-Fence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/587.Erect-the-Fence/587.Erect-the-Fence.cpp -------------------------------------------------------------------------------- /Math/587.Erect-the-Fence/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/587.Erect-the-Fence/Readme.md -------------------------------------------------------------------------------- /Math/593.Valid-Square/593.Valid Square.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/593.Valid-Square/593.Valid Square.cpp -------------------------------------------------------------------------------- /Math/593.Valid-Square/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/593.Valid-Square/Readme.md -------------------------------------------------------------------------------- /Math/628.Maximum-Product-of-Three-Numbers/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/628.Maximum-Product-of-Three-Numbers/Readme.md -------------------------------------------------------------------------------- /Math/672.Bulb-Switcher-II/672.Bulb-Switcher-II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/672.Bulb-Switcher-II/672.Bulb-Switcher-II.cpp -------------------------------------------------------------------------------- /Math/672.Bulb-Switcher-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/672.Bulb-Switcher-II/Readme.md -------------------------------------------------------------------------------- /Math/710.Random-Pick-with-Blacklist/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/710.Random-Pick-with-Blacklist/Readme.md -------------------------------------------------------------------------------- /Math/754.Reach-a-Number/754.Reach-a-Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/754.Reach-a-Number/754.Reach-a-Number.cpp -------------------------------------------------------------------------------- /Math/754.Reach-a-Number/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/754.Reach-a-Number/Readme.md -------------------------------------------------------------------------------- /Math/829.Consecutive-Numbers-Sum/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/829.Consecutive-Numbers-Sum/Readme.md -------------------------------------------------------------------------------- /Math/858.Mirror-Reflection/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/858.Mirror-Reflection/Readme.md -------------------------------------------------------------------------------- /Math/878.Nth-Magical-Number/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/878.Nth-Magical-Number/Readme.md -------------------------------------------------------------------------------- /Math/883.Projection-Area-of-3D-Shapes/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/883.Projection-Area-of-3D-Shapes/Readme.md -------------------------------------------------------------------------------- /Math/891.Sum-of-Subsequence-Widths/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/891.Sum-of-Subsequence-Widths/Readme.md -------------------------------------------------------------------------------- /Math/899.Orderly-Queue/899.Orderly-Queue.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/899.Orderly-Queue/899.Orderly-Queue.cpp -------------------------------------------------------------------------------- /Math/899.Orderly-Queue/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/899.Orderly-Queue/Readme.md -------------------------------------------------------------------------------- /Math/963.Minimum-Area-Rectangle-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/963.Minimum-Area-Rectangle-II/Readme.md -------------------------------------------------------------------------------- /Math/972.Equal-Rational-Numbers/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Math/972.Equal-Rational-Numbers/Readme.md -------------------------------------------------------------------------------- /Others/007.Reverse-Integer/007.Reverse-Integer.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/007.Reverse-Integer/007.Reverse-Integer.cpp -------------------------------------------------------------------------------- /Others/007.Reverse-Integer/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/007.Reverse-Integer/Readme.md -------------------------------------------------------------------------------- /Others/042.Trapping-Rain-Water/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/042.Trapping-Rain-Water/Readme.md -------------------------------------------------------------------------------- /Others/048.Rotate-Image/048.Rotate-Image.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/048.Rotate-Image/048.Rotate-Image.py -------------------------------------------------------------------------------- /Others/048.Rotate-Image/048.Rotate-Image_v2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/048.Rotate-Image/048.Rotate-Image_v2.cpp -------------------------------------------------------------------------------- /Others/048.Rotate-Image/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/048.Rotate-Image/Readme.md -------------------------------------------------------------------------------- /Others/056.Merge-Intervals/056.Merge-Intervals.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/056.Merge-Intervals/056.Merge-Intervals.cpp -------------------------------------------------------------------------------- /Others/056.Merge-Intervals/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/056.Merge-Intervals/Readme.md -------------------------------------------------------------------------------- /Others/057.Insert-Interval/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/057.Insert-Interval/Readme.md -------------------------------------------------------------------------------- /Others/065.Valid-Number/065.Valid-Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/065.Valid-Number/065.Valid-Number.cpp -------------------------------------------------------------------------------- /Others/065.Valid-Number/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/065.Valid-Number/Readme.md -------------------------------------------------------------------------------- /Others/090.Subsets-II/090.Subsets-II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/090.Subsets-II/090.Subsets-II.cpp -------------------------------------------------------------------------------- /Others/090.Subsets-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/090.Subsets-II/Readme.md -------------------------------------------------------------------------------- /Others/1067.Digit-Count-in-Range/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/1067.Digit-Count-in-Range/Readme.md -------------------------------------------------------------------------------- /Others/1094.Car-Pooling/1094.Car-Pooling.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/1094.Car-Pooling/1094.Car-Pooling.cpp -------------------------------------------------------------------------------- /Others/1094.Car-Pooling/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/1094.Car-Pooling/Readme.md -------------------------------------------------------------------------------- /Others/1109.Corporate-Flight-Bookings/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/1109.Corporate-Flight-Bookings/Readme.md -------------------------------------------------------------------------------- /Others/1183.Maximum-Number-of-Ones/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/1183.Maximum-Number-of-Ones/Readme.md -------------------------------------------------------------------------------- /Others/1224.Maximum-Equal-Frequency/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/1224.Maximum-Equal-Frequency/Readme.md -------------------------------------------------------------------------------- /Others/1706.Where-Will-the-Ball-Fall/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/1706.Where-Will-the-Ball-Fall/Readme.md -------------------------------------------------------------------------------- /Others/1826.Faulty-Sensor/1826.Faulty-Sensor.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/1826.Faulty-Sensor/1826.Faulty-Sensor.cpp -------------------------------------------------------------------------------- /Others/1826.Faulty-Sensor/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/1826.Faulty-Sensor/Readme.md -------------------------------------------------------------------------------- /Others/1861.Rotating-the-Box/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/1861.Rotating-the-Box/Readme.md -------------------------------------------------------------------------------- /Others/1862.Sum-of-Floored-Pairs/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/1862.Sum-of-Floored-Pairs/Readme.md -------------------------------------------------------------------------------- /Others/1871.Jump-Game-VII/1871.Jump-Game-VII.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/1871.Jump-Game-VII/1871.Jump-Game-VII.cpp -------------------------------------------------------------------------------- /Others/1871.Jump-Game-VII/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/1871.Jump-Game-VII/Readme.md -------------------------------------------------------------------------------- /Others/1943.Describe-the-Painting/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/1943.Describe-the-Painting/Readme.md -------------------------------------------------------------------------------- /Others/2013.Detect-Squares/2013.Detect-Squares.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/2013.Detect-Squares/2013.Detect-Squares.cpp -------------------------------------------------------------------------------- /Others/2013.Detect-Squares/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/2013.Detect-Squares/Readme.md -------------------------------------------------------------------------------- /Others/2081.Sum-of-k-Mirror-Numbers/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/2081.Sum-of-k-Mirror-Numbers/Readme.md -------------------------------------------------------------------------------- /Others/2132.Stamping-the-Grid/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/2132.Stamping-the-Grid/Readme.md -------------------------------------------------------------------------------- /Others/2211.Count-Collisions-on-a-Road/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/2211.Count-Collisions-on-a-Road/Readme.md -------------------------------------------------------------------------------- /Others/2376.Count-Special-Integers/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/2376.Count-Special-Integers/Readme.md -------------------------------------------------------------------------------- /Others/2381.Shifting-Letters-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/2381.Shifting-Letters-II/Readme.md -------------------------------------------------------------------------------- /Others/240.Search-a-2D-Matrix-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/240.Search-a-2D-Matrix-II/Readme.md -------------------------------------------------------------------------------- /Others/2417.Closest-Fair-Integer/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/2417.Closest-Fair-Integer/Readme.md -------------------------------------------------------------------------------- /Others/2453.Destroy-Sequential-Targets/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/2453.Destroy-Sequential-Targets/Readme.md -------------------------------------------------------------------------------- /Others/252.Meeting-Rooms/252.Meeting-Rooms.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/252.Meeting-Rooms/252.Meeting-Rooms.cpp -------------------------------------------------------------------------------- /Others/252.Meeting-Rooms/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/252.Meeting-Rooms/Readme.md -------------------------------------------------------------------------------- /Others/253.Meeting-Rooms-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/253.Meeting-Rooms-II/Readme.md -------------------------------------------------------------------------------- /Others/2536.Increment-Submatrices-by-One/Readme.md: -------------------------------------------------------------------------------- 1 | ### 2536.Increment-Submatrices-by-One 2 | 3 | 此题就是二维差分数组的模板题。套用模板即可。 4 | -------------------------------------------------------------------------------- /Others/2552.Count-Increasing-Quadruplets/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/2552.Count-Increasing-Quadruplets/Readme.md -------------------------------------------------------------------------------- /Others/2615.Sum-of-Distances/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/2615.Sum-of-Distances/Readme.md -------------------------------------------------------------------------------- /Others/2647.Color-the-Triangle-Red/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/2647.Color-the-Triangle-Red/Readme.md -------------------------------------------------------------------------------- /Others/2681.Power-of-Heroes/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/2681.Power-of-Heroes/Readme.md -------------------------------------------------------------------------------- /Others/2718.Sum-of-Matrix-After-Queries/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/2718.Sum-of-Matrix-After-Queries/Readme.md -------------------------------------------------------------------------------- /Others/2731.Movement-of-Robots/Readmd.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/2731.Movement-of-Robots/Readmd.md -------------------------------------------------------------------------------- /Others/2768.Number-of-Black-Blocks/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/2768.Number-of-Black-Blocks/Readme.md -------------------------------------------------------------------------------- /Others/277.Find-the-Celebrity/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/277.Find-the-Celebrity/Readme.md -------------------------------------------------------------------------------- /Others/2898.Maximum-Linear-Stock-Score/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/2898.Maximum-Linear-Stock-Score/Readme.md -------------------------------------------------------------------------------- /Others/311.Sparse-Matrix-Multiplication/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/311.Sparse-Matrix-Multiplication/Readme.md -------------------------------------------------------------------------------- /Others/3169.Count-Days-Without-Meetings/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/3169.Count-Days-Without-Meetings/Readme.md -------------------------------------------------------------------------------- /Others/324.Wiggle-Sort-II/324.Wiggle-Sort-II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/324.Wiggle-Sort-II/324.Wiggle-Sort-II.cpp -------------------------------------------------------------------------------- /Others/324.Wiggle-Sort-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/324.Wiggle-Sort-II/Readme.md -------------------------------------------------------------------------------- /Others/3404.Count-Special-Subsequences/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/3404.Count-Special-Subsequences/Readme.md -------------------------------------------------------------------------------- /Others/347.Top-K-Frequent-Elements/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/347.Top-K-Frequent-Elements/Readme.md -------------------------------------------------------------------------------- /Others/348.Design-Tic-Tac-Toe/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/348.Design-Tic-Tac-Toe/Readme.md -------------------------------------------------------------------------------- /Others/3640.Trionic-Array-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/3640.Trionic-Array-II/Readme.md -------------------------------------------------------------------------------- /Others/420.Strong-Password-Checker/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/420.Strong-Password-Checker/Readme.md -------------------------------------------------------------------------------- /Others/466.Count-The-Repetitions/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/466.Count-The-Repetitions/Readme.md -------------------------------------------------------------------------------- /Others/479.Largest-Palindrome-Product/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/479.Largest-Palindrome-Product/Readme.md -------------------------------------------------------------------------------- /Others/723.Candy-Crush/723.Candy-Crush.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/723.Candy-Crush/723.Candy-Crush.cpp -------------------------------------------------------------------------------- /Others/723.Candy-Crush/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/723.Candy-Crush/Readme.md -------------------------------------------------------------------------------- /Others/732.My-Calendar-III/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/732.My-Calendar-III/Readme.md -------------------------------------------------------------------------------- /Others/759.Employee-Free-Time/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/759.Employee-Free-Time/Readme.md -------------------------------------------------------------------------------- /Others/775.Global-and-Local-Inversions/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/775.Global-and-Local-Inversions/Readme.md -------------------------------------------------------------------------------- /Others/782.Transform-to-Chessboard/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/782.Transform-to-Chessboard/Readme.md -------------------------------------------------------------------------------- /Others/794.Valid-Tic-Tac-Toe-State/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/794.Valid-Tic-Tac-Toe-State/Readme.md -------------------------------------------------------------------------------- /Others/810.Chalkboard-XOR-Game/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/810.Chalkboard-XOR-Game/Readme.md -------------------------------------------------------------------------------- /Others/825.Friends-Of-Appropriate-Ages/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/825.Friends-Of-Appropriate-Ages/Readme.md -------------------------------------------------------------------------------- /Others/835.Image-Overlap/835.Image-Overlap.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/835.Image-Overlap/835.Image-Overlap.cpp -------------------------------------------------------------------------------- /Others/835.Image-Overlap/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/835.Image-Overlap/Readme.md -------------------------------------------------------------------------------- /Others/843.Guess-the-Word/843.Guess-the-Word.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/843.Guess-the-Word/843.Guess-the-Word.cpp -------------------------------------------------------------------------------- /Others/843.Guess-the-Word/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/843.Guess-the-Word/Readme.md -------------------------------------------------------------------------------- /Others/850.Rectangle-Area-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/850.Rectangle-Area-II/Readme.md -------------------------------------------------------------------------------- /Others/853.Car-Fleet/853.Car-Fleet.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/853.Car-Fleet/853.Car-Fleet.cpp -------------------------------------------------------------------------------- /Others/853.Car-Fleet/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/853.Car-Fleet/Readme.md -------------------------------------------------------------------------------- /Others/866.Prime-Palindrome/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/866.Prime-Palindrome/Readme.md -------------------------------------------------------------------------------- /Others/906.Super-Palindromes/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/906.Super-Palindromes/Readme.md -------------------------------------------------------------------------------- /Others/927.Three-Equal-Parts/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/927.Three-Equal-Parts/Readme.md -------------------------------------------------------------------------------- /Others/973.K-Closest-Points-to-Origin/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/973.K-Closest-Points-to-Origin/Readme.md -------------------------------------------------------------------------------- /Others/978.Longest-Turbulent-Subarray/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Others/978.Longest-Turbulent-Subarray/Readme.md -------------------------------------------------------------------------------- /Priority_Queue/1057.Campus-Bikes/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Priority_Queue/1057.Campus-Bikes/Readme.md -------------------------------------------------------------------------------- /Priority_Queue/1834.Single-Threaded-CPU/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Priority_Queue/1834.Single-Threaded-CPU/Readme.md -------------------------------------------------------------------------------- /Priority_Queue/2402.Meeting-Rooms-III/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Priority_Queue/2402.Meeting-Rooms-III/Readme.md -------------------------------------------------------------------------------- /Priority_Queue/502.IPO/502.IPO.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Priority_Queue/502.IPO/502.IPO.cpp -------------------------------------------------------------------------------- /Priority_Queue/502.IPO/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Priority_Queue/502.IPO/Readme.md -------------------------------------------------------------------------------- /Priority_Queue/621.Task-Scheduler/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Priority_Queue/621.Task-Scheduler/Readme.md -------------------------------------------------------------------------------- /Priority_Queue/630.Course-Schedule-III/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Priority_Queue/630.Course-Schedule-III/Readme.md -------------------------------------------------------------------------------- /Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Readme.md -------------------------------------------------------------------------------- /Recursion/087.Scramble-String/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/087.Scramble-String/Readme.md -------------------------------------------------------------------------------- /Recursion/1088.Confusing-Number-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/1088.Confusing-Number-II/Readme.md -------------------------------------------------------------------------------- /Recursion/1140.Stone-Game-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/1140.Stone-Game-II/Readme.md -------------------------------------------------------------------------------- /Recursion/133.Clone-Graph/133.Clone Graph_BFS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/133.Clone-Graph/133.Clone Graph_BFS.cpp -------------------------------------------------------------------------------- /Recursion/133.Clone-Graph/133.Clone Graph_DFS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/133.Clone-Graph/133.Clone Graph_DFS.cpp -------------------------------------------------------------------------------- /Recursion/133.Clone-Graph/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/133.Clone-Graph/Readme.md -------------------------------------------------------------------------------- /Recursion/1406.Stone-Game-III/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/1406.Stone-Game-III/Readme.md -------------------------------------------------------------------------------- /Recursion/1510.Stone-Game-IV/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/1510.Stone-Game-IV/Readme.md -------------------------------------------------------------------------------- /Recursion/2029.Stone-Game-IX/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/2029.Stone-Game-IX/Readme.md -------------------------------------------------------------------------------- /Recursion/2719.Count-of-Integers/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/2719.Count-of-Integers/Readme.md -------------------------------------------------------------------------------- /Recursion/337.House-Robber-III/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/337.House-Robber-III/Readme.md -------------------------------------------------------------------------------- /Recursion/3490.Count-Beautiful-Numbers/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/3490.Count-Beautiful-Numbers/Readme.md -------------------------------------------------------------------------------- /Recursion/390.Elimination-Game/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/390.Elimination-Game/Readme.md -------------------------------------------------------------------------------- /Recursion/397.Integer-Replacement/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/397.Integer-Replacement/Readme.md -------------------------------------------------------------------------------- /Recursion/464.Can-I-Win/464.Can-I-Win.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/464.Can-I-Win/464.Can-I-Win.cpp -------------------------------------------------------------------------------- /Recursion/464.Can-I-Win/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/464.Can-I-Win/Readme.md -------------------------------------------------------------------------------- /Recursion/679.24-Game/679.24-Game_v1.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/679.24-Game/679.24-Game_v1.cpp -------------------------------------------------------------------------------- /Recursion/679.24-Game/679.24-Game_v2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/679.24-Game/679.24-Game_v2.cpp -------------------------------------------------------------------------------- /Recursion/679.24-Game/679.24-Game_v3.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/679.24-Game/679.24-Game_v3.cpp -------------------------------------------------------------------------------- /Recursion/679.24-Game/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/679.24-Game/Readme.md -------------------------------------------------------------------------------- /Recursion/779.K-th-Symbol-in-Grammar/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/779.K-th-Symbol-in-Grammar/Readme.md -------------------------------------------------------------------------------- /Recursion/780.Reaching-Points/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/780.Reaching-Points/Readme.md -------------------------------------------------------------------------------- /Recursion/808.Soup-Servings/808.Soup-Servings.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/808.Soup-Servings/808.Soup-Servings.cpp -------------------------------------------------------------------------------- /Recursion/808.Soup-Servings/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/808.Soup-Servings/Readme.md -------------------------------------------------------------------------------- /Recursion/877.Stone-Game/877.Stone-Game.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/877.Stone-Game/877.Stone-Game.cpp -------------------------------------------------------------------------------- /Recursion/877.Stone-Game/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/877.Stone-Game/Readme.md -------------------------------------------------------------------------------- /Recursion/880.Decoded-String-at-Index/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/880.Decoded-String-at-Index/Readme.md -------------------------------------------------------------------------------- /Recursion/991.Broken-Calculator/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Recursion/991.Broken-Calculator/Readme.md -------------------------------------------------------------------------------- /SQL/Date/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/SQL/Date/Readme.md -------------------------------------------------------------------------------- /SQL/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/SQL/README.md -------------------------------------------------------------------------------- /SQL/Window_Function/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/SQL/Window_Function/README.md -------------------------------------------------------------------------------- /Segment_Tree/218.The-Skyline-Problem/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Segment_Tree/218.The-Skyline-Problem/Readme.md -------------------------------------------------------------------------------- /Segment_Tree/2659.Make-Array-Empty/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Segment_Tree/2659.Make-Array-Empty/Readme.md -------------------------------------------------------------------------------- /Segment_Tree/3187.Peaks-in-Array/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Segment_Tree/3187.Peaks-in-Array/Readme.md -------------------------------------------------------------------------------- /Segment_Tree/370.Range-Addition/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Segment_Tree/370.Range-Addition/Readme.md -------------------------------------------------------------------------------- /Segment_Tree/699.Falling-Squares/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Segment_Tree/699.Falling-Squares/Readme.md -------------------------------------------------------------------------------- /Segment_Tree/715.Range-Module/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Segment_Tree/715.Range-Module/Readme.md -------------------------------------------------------------------------------- /Simulation/2532.Time-to-Cross-a-Bridge/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Simulation/2532.Time-to-Cross-a-Bridge/Readme.md -------------------------------------------------------------------------------- /Sorted_Container/1847.Closest-Room/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Sorted_Container/1847.Closest-Room/Readme.md -------------------------------------------------------------------------------- /Sorted_Container/729.My-Calendar-I/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Sorted_Container/729.My-Calendar-I/Readme.md -------------------------------------------------------------------------------- /Sorted_Container/855.Exam-Room/855.Exam-Room.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Sorted_Container/855.Exam-Room/855.Exam-Room.cpp -------------------------------------------------------------------------------- /Sorted_Container/855.Exam-Room/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Sorted_Container/855.Exam-Room/Readme.md -------------------------------------------------------------------------------- /Sorted_Container/975.Odd-Even-Jump/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Sorted_Container/975.Odd-Even-Jump/Readme.md -------------------------------------------------------------------------------- /Stack/032.Longest-Valid-Parentheses/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/032.Longest-Valid-Parentheses/Readme.md -------------------------------------------------------------------------------- /Stack/071.Simplify-Path/071.Simplify-Path.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/071.Simplify-Path/071.Simplify-Path.cpp -------------------------------------------------------------------------------- /Stack/071.Simplify-Path/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/071.Simplify-Path/Readme.md -------------------------------------------------------------------------------- /Stack/085.Maximal-Rectangle/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/085.Maximal-Rectangle/Readme.md -------------------------------------------------------------------------------- /Stack/1063.Number-of-Valid-Subarrays/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/1063.Number-of-Valid-Subarrays/Readme.md -------------------------------------------------------------------------------- /Stack/1087.Brace-Expansion/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/1087.Brace-Expansion/Readme.md -------------------------------------------------------------------------------- /Stack/1096.Brace-Expansion-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/1096.Brace-Expansion-II/Readme.md -------------------------------------------------------------------------------- /Stack/1106.Parsing-A-Boolean-Expression/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/1106.Parsing-A-Boolean-Expression/Readme.md -------------------------------------------------------------------------------- /Stack/155.Min-Stack/155.Min Stack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/155.Min-Stack/155.Min Stack.cpp -------------------------------------------------------------------------------- /Stack/155.Min-Stack/155.Min-Stack_v2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/155.Min-Stack/155.Min-Stack_v2.cpp -------------------------------------------------------------------------------- /Stack/155.Min-Stack/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/155.Min-Stack/Readme.md -------------------------------------------------------------------------------- /Stack/173.Binary-Search-Tree-Iterator/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/173.Binary-Search-Tree-Iterator/Readme.md -------------------------------------------------------------------------------- /Stack/1856.Maximum-Subarray-Min-Product/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/1856.Maximum-Subarray-Min-Product/Readme.md -------------------------------------------------------------------------------- /Stack/2104.Sum-of-Subarray-Ranges/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/2104.Sum-of-Subarray-Ranges/Readme.md -------------------------------------------------------------------------------- /Stack/224.Basic-Calculator/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/224.Basic-Calculator/Readme.md -------------------------------------------------------------------------------- /Stack/224.Basic-Calculator/basic_calculator.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/224.Basic-Calculator/basic_calculator.java -------------------------------------------------------------------------------- /Stack/225.Implement-Stack-using-Queues/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/225.Implement-Stack-using-Queues/Readme.md -------------------------------------------------------------------------------- /Stack/227.Basic-Calculator-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/227.Basic-Calculator-II/Readme.md -------------------------------------------------------------------------------- /Stack/232.Implement-Queue-using-Stacks/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/232.Implement-Queue-using-Stacks/Readme.md -------------------------------------------------------------------------------- /Stack/2454.Next-Greater-Element-IV/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/2454.Next-Greater-Element-IV/Readme.md -------------------------------------------------------------------------------- /Stack/2751.Robot-Collisions/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/2751.Robot-Collisions/Readme.md -------------------------------------------------------------------------------- /Stack/2866.Beautiful-Towers-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/2866.Beautiful-Towers-II/Readme.md -------------------------------------------------------------------------------- /Stack/316.Remove-Duplicate-Letters/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/316.Remove-Duplicate-Letters/Readme.md -------------------------------------------------------------------------------- /Stack/321.Create-Maximum-Number/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/321.Create-Maximum-Number/Readme.md -------------------------------------------------------------------------------- /Stack/341.Flatten-Nested-List-Iterator/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/341.Flatten-Nested-List-Iterator/Readme.md -------------------------------------------------------------------------------- /Stack/3676.Count-Bowl-Subarrays/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/3676.Count-Bowl-Subarrays/Readme.md -------------------------------------------------------------------------------- /Stack/385.Mini-Parser/385.Mini Parser.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/385.Mini-Parser/385.Mini Parser.cpp -------------------------------------------------------------------------------- /Stack/385.Mini-Parser/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/385.Mini-Parser/Readme.md -------------------------------------------------------------------------------- /Stack/402.Remove-K-Digits/402.Remove K Digits.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/402.Remove-K-Digits/402.Remove K Digits.cpp -------------------------------------------------------------------------------- /Stack/402.Remove-K-Digits/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/402.Remove-K-Digits/Readme.md -------------------------------------------------------------------------------- /Stack/439.Ternary-Expression-Parser/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/439.Ternary-Expression-Parser/Readme.md -------------------------------------------------------------------------------- /Stack/456.132-Pattern/456.132-Pattern.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/456.132-Pattern/456.132-Pattern.cpp -------------------------------------------------------------------------------- /Stack/456.132-Pattern/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/456.132-Pattern/Readme.md -------------------------------------------------------------------------------- /Stack/496.Next-Greater-Element-I/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/496.Next-Greater-Element-I/Readme.md -------------------------------------------------------------------------------- /Stack/503.Next-Greater-Element-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/503.Next-Greater-Element-II/Readme.md -------------------------------------------------------------------------------- /Stack/591.Tag-Validator/591.Tag Validator.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/591.Tag-Validator/591.Tag Validator.cpp -------------------------------------------------------------------------------- /Stack/591.Tag-Validator/591.Tag-Validator_s2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/591.Tag-Validator/591.Tag-Validator_s2.cpp -------------------------------------------------------------------------------- /Stack/591.Tag-Validator/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/591.Tag-Validator/Readme.md -------------------------------------------------------------------------------- /Stack/636.Exclusive-Time-of-Functions/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/636.Exclusive-Time-of-Functions/Readme.md -------------------------------------------------------------------------------- /Stack/654.Maximum-Binary-Tree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/654.Maximum-Binary-Tree/Readme.md -------------------------------------------------------------------------------- /Stack/726.Number-of-Atoms/726.Number-of-Atoms.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/726.Number-of-Atoms/726.Number-of-Atoms.cpp -------------------------------------------------------------------------------- /Stack/726.Number-of-Atoms/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/726.Number-of-Atoms/Readme.md -------------------------------------------------------------------------------- /Stack/739.Daily-Temperatures/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/739.Daily-Temperatures/Readme.md -------------------------------------------------------------------------------- /Stack/768.Max-Chunks-To-Make-Sorted-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/768.Max-Chunks-To-Make-Sorted-II/Readme.md -------------------------------------------------------------------------------- /Stack/772.Basic-Calculator-III/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/772.Basic-Calculator-III/Readme.md -------------------------------------------------------------------------------- /Stack/856.Score-of-Parentheses/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/856.Score-of-Parentheses/Readme.md -------------------------------------------------------------------------------- /Stack/901.Online-Stock-Span/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/901.Online-Stock-Span/Readme.md -------------------------------------------------------------------------------- /Stack/907.Sum-of-Subarray-Minimums/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/907.Sum-of-Subarray-Minimums/Readme.md -------------------------------------------------------------------------------- /Stack/946.Validate-Stack-Sequences/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/946.Validate-Stack-Sequences/Readme.md -------------------------------------------------------------------------------- /Stack/962.Maximum-Width-Ramp/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Stack/962.Maximum-Width-Ramp/Readme.md -------------------------------------------------------------------------------- /String/006.ZigZag-Conversion/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/006.ZigZag-Conversion/Readme.md -------------------------------------------------------------------------------- /String/028.Implement-strStr/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/028.Implement-strStr/Readme.md -------------------------------------------------------------------------------- /String/068.Text-Justification/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/068.Text-Justification/Readme.md -------------------------------------------------------------------------------- /String/1044.Longest-Duplicate-Substring/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/1044.Longest-Duplicate-Substring/Readme.md -------------------------------------------------------------------------------- /String/1062.Longest-Repeating-Substring/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/1062.Longest-Repeating-Substring/Readme.md -------------------------------------------------------------------------------- /String/1367.Linked-List-in-Binary-Tree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/1367.Linked-List-in-Binary-Tree/Readme.md -------------------------------------------------------------------------------- /String/1392.Longest-Happy-Prefix/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/1392.Longest-Happy-Prefix/Readme.md -------------------------------------------------------------------------------- /String/1923.Longest-Common-Subpath/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/1923.Longest-Common-Subpath/Readme.md -------------------------------------------------------------------------------- /String/214.Shortest-Palindrome/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/214.Shortest-Palindrome/Readme.md -------------------------------------------------------------------------------- /String/320.Generalized-Abbreviation/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/320.Generalized-Abbreviation/Readme.md -------------------------------------------------------------------------------- /String/336.Palindrome-Pairs/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/336.Palindrome-Pairs/Readme.md -------------------------------------------------------------------------------- /String/388.Longest-Absolute-File-Path/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/388.Longest-Absolute-File-Path/Readme.md -------------------------------------------------------------------------------- /String/408.Valid-Word-Abbreviation/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/408.Valid-Word-Abbreviation/Readme.md -------------------------------------------------------------------------------- /String/418.Sentence-Screen-Fitting/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/418.Sentence-Screen-Fitting/Readme.md -------------------------------------------------------------------------------- /String/459.Repeated-Substring-Pattern/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/459.Repeated-Substring-Pattern/Readme.md -------------------------------------------------------------------------------- /String/527.Word-Abbreviation/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/527.Word-Abbreviation/Readme.md -------------------------------------------------------------------------------- /String/564.Find-the-Closest-Palindrome/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/564.Find-the-Closest-Palindrome/Readme.md -------------------------------------------------------------------------------- /String/647.Palindromic-Substrings/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/647.Palindromic-Substrings/Readme.md -------------------------------------------------------------------------------- /String/722.Remove-Comments/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/722.Remove-Comments/Readme.md -------------------------------------------------------------------------------- /String/736.Parse-Lisp-Expression/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/736.Parse-Lisp-Expression/Readme.md -------------------------------------------------------------------------------- /String/816.Ambiguous-Coordinates/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/816.Ambiguous-Coordinates/Readme.md -------------------------------------------------------------------------------- /String/844.Backspace-String-Compare/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/String/844.Backspace-String-Compare/Readme.md -------------------------------------------------------------------------------- /Template/Binary_Index_Tree/BIT.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Binary_Index_Tree/BIT.cpp -------------------------------------------------------------------------------- /Template/Binary_Lift/binary_lift.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Binary_Lift/binary_lift.cpp -------------------------------------------------------------------------------- /Template/Bit_manipulation/Count_bit_1_numbers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Bit_manipulation/Count_bit_1_numbers.cpp -------------------------------------------------------------------------------- /Template/Bit_manipulation/Gospers-Hack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Bit_manipulation/Gospers-Hack.cpp -------------------------------------------------------------------------------- /Template/Bit_manipulation/Iterate_Subsets.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Bit_manipulation/Iterate_Subsets.cpp -------------------------------------------------------------------------------- /Template/Bit_manipulation/bitset.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Bit_manipulation/bitset.cpp -------------------------------------------------------------------------------- /Template/CPP_LANG/Hash.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/CPP_LANG/Hash.cpp -------------------------------------------------------------------------------- /Template/CPP_LANG/Struct.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/CPP_LANG/Struct.cpp -------------------------------------------------------------------------------- /Template/CPP_LANG/fill_memset.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/CPP_LANG/fill_memset.cpp -------------------------------------------------------------------------------- /Template/CPP_LANG/istringstream.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/CPP_LANG/istringstream.cpp -------------------------------------------------------------------------------- /Template/Combination-Number/comb.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Combination-Number/comb.cpp -------------------------------------------------------------------------------- /Template/Diff_Array_2D/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Diff_Array_2D/Readme.md -------------------------------------------------------------------------------- /Template/Diff_Array_2D/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Diff_Array_2D/code.cpp -------------------------------------------------------------------------------- /Template/Fast_IO/Fast_IO.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Fast_IO/Fast_IO.cpp -------------------------------------------------------------------------------- /Template/Graph/Hungarian.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Graph/Hungarian.cpp -------------------------------------------------------------------------------- /Template/Graph/Judge_Circle.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Graph/Judge_Circle.cpp -------------------------------------------------------------------------------- /Template/Graph/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Graph/Readme.md -------------------------------------------------------------------------------- /Template/Inverse_Element/Inverse_Element.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Inverse_Element/Inverse_Element.cpp -------------------------------------------------------------------------------- /Template/Inverse_Element/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Inverse_Element/Readme.md -------------------------------------------------------------------------------- /Template/Math/Combination-Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Math/Combination-Number.cpp -------------------------------------------------------------------------------- /Template/Math/Lucas.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Math/Lucas.cpp -------------------------------------------------------------------------------- /Template/Math/Matrix_Multiplication.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Math/Matrix_Multiplication.cpp -------------------------------------------------------------------------------- /Template/Math/Primes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Math/Primes.cpp -------------------------------------------------------------------------------- /Template/Math/QuickPow.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Math/QuickPow.cpp -------------------------------------------------------------------------------- /Template/RB_Tree/ordered_set.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/RB_Tree/ordered_set.cpp -------------------------------------------------------------------------------- /Template/Random/random.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Random/random.cpp -------------------------------------------------------------------------------- /Template/SegmentTree/range_bitwise_and.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/SegmentTree/range_bitwise_and.cpp -------------------------------------------------------------------------------- /Template/SegmentTree/range_max.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/SegmentTree/range_max.cpp -------------------------------------------------------------------------------- /Template/SegmentTree/range_min.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/SegmentTree/range_min.cpp -------------------------------------------------------------------------------- /Template/SegmentTree/range_module.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/SegmentTree/range_module.cpp -------------------------------------------------------------------------------- /Template/SegmentTree/range_sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/SegmentTree/range_sum.cpp -------------------------------------------------------------------------------- /Template/SegmentTree/range_sum_increase_by.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/SegmentTree/range_sum_increase_by.cpp -------------------------------------------------------------------------------- /Template/Sub_Rect_Sum_2D/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Sub_Rect_Sum_2D/code.cpp -------------------------------------------------------------------------------- /Template/Union_Find/union_find.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Template/Union_Find/union_find.cpp -------------------------------------------------------------------------------- /Thinking/2860.Happy-Students/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Thinking/2860.Happy-Students/Readme.md -------------------------------------------------------------------------------- /Thinking/2939.Maximum-Xor-Product/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Thinking/2939.Maximum-Xor-Product/Readme.md -------------------------------------------------------------------------------- /Thinking/3660.Jump-Game-IX/3660.Jump-Game-IX.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Thinking/3660.Jump-Game-IX/3660.Jump-Game-IX.cpp -------------------------------------------------------------------------------- /Thinking/3660.Jump-Game-IX/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Thinking/3660.Jump-Game-IX/Readme.md -------------------------------------------------------------------------------- /Tree/094.Binary-Tree-Inorder-Traversal/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/094.Binary-Tree-Inorder-Traversal/Readme.md -------------------------------------------------------------------------------- /Tree/095.Unique-Binary-Search-Trees-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/095.Unique-Binary-Search-Trees-II/Readme.md -------------------------------------------------------------------------------- /Tree/098.Validate-Binary-Search-Tree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/098.Validate-Binary-Search-Tree/Readme.md -------------------------------------------------------------------------------- /Tree/099.Recover-Binary-Search-Tree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/099.Recover-Binary-Search-Tree/Readme.md -------------------------------------------------------------------------------- /Tree/110.Balanced-Binary-Tree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/110.Balanced-Binary-Tree/Readme.md -------------------------------------------------------------------------------- /Tree/124.Binary-Tree-Maximum-Path-Sum/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/124.Binary-Tree-Maximum-Path-Sum/Readme.md -------------------------------------------------------------------------------- /Tree/144.Binary-Tree-Preorder-Traversal/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/144.Binary-Tree-Preorder-Traversal/Readme.md -------------------------------------------------------------------------------- /Tree/1516.Move-Sub-Tree-of-N-Ary-Tree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/1516.Move-Sub-Tree-of-N-Ary-Tree/Readme.md -------------------------------------------------------------------------------- /Tree/1522.Diameter-of-N-Ary-Tree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/1522.Diameter-of-N-Ary-Tree/Readme.md -------------------------------------------------------------------------------- /Tree/156.Binary-Tree-Upside-Down/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/156.Binary-Tree-Upside-Down/Readme.md -------------------------------------------------------------------------------- /Tree/1644.Lowest-Common-Ancestor-of-a-Binary-Tree-II/Readme.md: -------------------------------------------------------------------------------- 1 | ### 1644.Lowest-Common-Ancestor-of-a-Binary-Tree-II 2 | 3 | LC.236的递归解法完全可以适用于本题。 4 | -------------------------------------------------------------------------------- /Tree/1660.Correct-a-Binary-Tree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/1660.Correct-a-Binary-Tree/Readme.md -------------------------------------------------------------------------------- /Tree/222.Count-Complete-Tree-Nodes/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/222.Count-Complete-Tree-Nodes/Readme.md -------------------------------------------------------------------------------- /Tree/226.Invert-Binary-Tree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/226.Invert-Binary-Tree/Readme.md -------------------------------------------------------------------------------- /Tree/2277.Closest-Node-to-Path-in-Tree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/2277.Closest-Node-to-Path-in-Tree/Readme.md -------------------------------------------------------------------------------- /Tree/285.Inorder-Successor-in-BST/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/285.Inorder-Successor-in-BST/Readme.md -------------------------------------------------------------------------------- /Tree/333.Largest-BST-Subtree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/333.Largest-BST-Subtree/Readme.md -------------------------------------------------------------------------------- /Tree/437.Path-Sum-III/437.Path Sum III.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/437.Path-Sum-III/437.Path Sum III.cpp -------------------------------------------------------------------------------- /Tree/437.Path-Sum-III/437.Path-Sum-III_v2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/437.Path-Sum-III/437.Path-Sum-III_v2.cpp -------------------------------------------------------------------------------- /Tree/437.Path-Sum-III/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/437.Path-Sum-III/Readme.md -------------------------------------------------------------------------------- /Tree/449.Serialize-and-Deserialize-BST/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/449.Serialize-and-Deserialize-BST/Readme.md -------------------------------------------------------------------------------- /Tree/450.Delete-Node-in-a-BST/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/450.Delete-Node-in-a-BST/Readme.md -------------------------------------------------------------------------------- /Tree/543.Diameter-of-Binary-Tree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/543.Diameter-of-Binary-Tree/Readme.md -------------------------------------------------------------------------------- /Tree/545.Boundary-of-Binary-Tree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/545.Boundary-of-Binary-Tree/Readme.md -------------------------------------------------------------------------------- /Tree/558.Quad-Tree-Intersection/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/558.Quad-Tree-Intersection/Readme.md -------------------------------------------------------------------------------- /Tree/572.Subtree-of-Another-Tree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/572.Subtree-of-Another-Tree/Readme.md -------------------------------------------------------------------------------- /Tree/652.Find-Duplicate-Subtrees/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/652.Find-Duplicate-Subtrees/Readme.md -------------------------------------------------------------------------------- /Tree/655.Print-Binary-Tree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/655.Print-Binary-Tree/Readme.md -------------------------------------------------------------------------------- /Tree/662.Maximum-Width-of-Binary-Tree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/662.Maximum-Width-of-Binary-Tree/Readme.md -------------------------------------------------------------------------------- /Tree/687.Longest-Univalue-Path/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/687.Longest-Univalue-Path/Readme.md -------------------------------------------------------------------------------- /Tree/742.Closest-Leaf-in-a-Binary-Tree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/742.Closest-Leaf-in-a-Binary-Tree/Readme.md -------------------------------------------------------------------------------- /Tree/834.Sum-of-Distances-in-Tree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/834.Sum-of-Distances-in-Tree/Readme.md -------------------------------------------------------------------------------- /Tree/897.Increasing-Order-Search-Tree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Tree/897.Increasing-Order-Search-Tree/Readme.md -------------------------------------------------------------------------------- /Trie/1268.Search-Suggestions-System/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/1268.Search-Suggestions-System/Readme.md -------------------------------------------------------------------------------- /Trie/139.Word-Break/139.Word-Break_DP.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/139.Word-Break/139.Word-Break_DP.cpp -------------------------------------------------------------------------------- /Trie/139.Word-Break/139.Word-Break_DP.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/139.Word-Break/139.Word-Break_DP.py -------------------------------------------------------------------------------- /Trie/139.Word-Break/139.Word-Break_Trie.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/139.Word-Break/139.Word-Break_Trie.cpp -------------------------------------------------------------------------------- /Trie/139.Word-Break/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/139.Word-Break/Readme.md -------------------------------------------------------------------------------- /Trie/140.Word-Break-II/140.Word-Break-II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/140.Word-Break-II/140.Word-Break-II.cpp -------------------------------------------------------------------------------- /Trie/140.Word-Break-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/140.Word-Break-II/Readme.md -------------------------------------------------------------------------------- /Trie/208.Implement-Trie--Prefix-Tree/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/208.Implement-Trie--Prefix-Tree/Readme.md -------------------------------------------------------------------------------- /Trie/211.Add-and-Search-Word/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/211.Add-and-Search-Word/Readme.md -------------------------------------------------------------------------------- /Trie/212.Word-Search-II/212.Word-Search-II_v1.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/212.Word-Search-II/212.Word-Search-II_v1.cpp -------------------------------------------------------------------------------- /Trie/212.Word-Search-II/212.Word-Search-II_v2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/212.Word-Search-II/212.Word-Search-II_v2.cpp -------------------------------------------------------------------------------- /Trie/212.Word-Search-II/212.Word-Search-II_v3.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/212.Word-Search-II/212.Word-Search-II_v3.cpp -------------------------------------------------------------------------------- /Trie/212.Word-Search-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/212.Word-Search-II/Readme.md -------------------------------------------------------------------------------- /Trie/2935.Maximum-Strong-Pair-XOR-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/2935.Maximum-Strong-Pair-XOR-II/Readme.md -------------------------------------------------------------------------------- /Trie/3093.Longest-Common-Suffix-Queries/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/3093.Longest-Common-Suffix-Queries/Readme.md -------------------------------------------------------------------------------- /Trie/3632.Subarrays-with-XOR-at-Least-K/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/3632.Subarrays-with-XOR-at-Least-K/Readme.md -------------------------------------------------------------------------------- /Trie/472.Concatenated-Words/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/472.Concatenated-Words/Readme.md -------------------------------------------------------------------------------- /Trie/588.Design-In-Memory-File-System/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/588.Design-In-Memory-File-System/Readme.md -------------------------------------------------------------------------------- /Trie/648.Replace-Words/648.Replace-Words.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/648.Replace-Words/648.Replace-Words.cpp -------------------------------------------------------------------------------- /Trie/648.Replace-Words/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/648.Replace-Words/Readme.md -------------------------------------------------------------------------------- /Trie/676.Implement-Magic-Dictionary/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/676.Implement-Magic-Dictionary/Readme.md -------------------------------------------------------------------------------- /Trie/677.Map-Sum-Pairs/677.Map-Sum-Pairs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/677.Map-Sum-Pairs/677.Map-Sum-Pairs.cpp -------------------------------------------------------------------------------- /Trie/677.Map-Sum-Pairs/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/677.Map-Sum-Pairs/Readme.md -------------------------------------------------------------------------------- /Trie/745.Prefix-and-Suffix-Search/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Trie/745.Prefix-and-Suffix-Search/Readme.md -------------------------------------------------------------------------------- /Two_Pointers/015.3Sum/15-3Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Two_Pointers/015.3Sum/15-3Sum.cpp -------------------------------------------------------------------------------- /Two_Pointers/015.3Sum/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Two_Pointers/015.3Sum/Readme.md -------------------------------------------------------------------------------- /Two_Pointers/016.3Sum-Closest/16.3Sum_Closest.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Two_Pointers/016.3Sum-Closest/16.3Sum_Closest.cpp -------------------------------------------------------------------------------- /Two_Pointers/016.3Sum-Closest/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Two_Pointers/016.3Sum-Closest/Readme.md -------------------------------------------------------------------------------- /Two_Pointers/018.4Sum/18. 4Sum_s1.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Two_Pointers/018.4Sum/18. 4Sum_s1.cpp -------------------------------------------------------------------------------- /Two_Pointers/018.4Sum/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Two_Pointers/018.4Sum/Readme.md -------------------------------------------------------------------------------- /Two_Pointers/075.Sort-Colors/75. Sort Colors.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Two_Pointers/075.Sort-Colors/75. Sort Colors.cpp -------------------------------------------------------------------------------- /Two_Pointers/075.Sort-Colors/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Two_Pointers/075.Sort-Colors/Readme.md -------------------------------------------------------------------------------- /Two_Pointers/088.Merge-Sorted-Array/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Two_Pointers/088.Merge-Sorted-Array/Readme.md -------------------------------------------------------------------------------- /Two_Pointers/1229.Meeting-Scheduler/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Two_Pointers/1229.Meeting-Scheduler/Readme.md -------------------------------------------------------------------------------- /Two_Pointers/141.Linked-List-Cycle/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Two_Pointers/141.Linked-List-Cycle/Readme.md -------------------------------------------------------------------------------- /Two_Pointers/1537.Get-the-Maximum-Score/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Two_Pointers/1537.Get-the-Maximum-Score/Readme.md -------------------------------------------------------------------------------- /Two_Pointers/2401.Longest-Nice-Subarray/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Two_Pointers/2401.Longest-Nice-Subarray/Readme.md -------------------------------------------------------------------------------- /Two_Pointers/2564.Substring-XOR-Queries/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Two_Pointers/2564.Substring-XOR-Queries/Readme.md -------------------------------------------------------------------------------- /Two_Pointers/259.3Sum-Smaller/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Two_Pointers/259.3Sum-Smaller/Readme.md -------------------------------------------------------------------------------- /Two_Pointers/283.Move-Zeroes/ 283.Move Zeroes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Two_Pointers/283.Move-Zeroes/ 283.Move Zeroes.cpp -------------------------------------------------------------------------------- /Two_Pointers/283.Move-Zeroes/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Two_Pointers/283.Move-Zeroes/Readme.md -------------------------------------------------------------------------------- /Two_Pointers/360.Sort-Transformed-Array/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Two_Pointers/360.Sort-Transformed-Array/Readme.md -------------------------------------------------------------------------------- /Two_Pointers/611.Valid-Triangle-Number/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Two_Pointers/611.Valid-Triangle-Number/Readme.md -------------------------------------------------------------------------------- /Two_Pointers/923.3Sum-With-Multiplicity/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Two_Pointers/923.3Sum-With-Multiplicity/Readme.md -------------------------------------------------------------------------------- /Union_Find/130.Surrounded-Regions/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Union_Find/130.Surrounded-Regions/Readme.md -------------------------------------------------------------------------------- /Union_Find/1998.GCD-Sort-of-an-Array/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Union_Find/1998.GCD-Sort-of-an-Array/Readme.md -------------------------------------------------------------------------------- /Union_Find/2157.Groups-of-Strings/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Union_Find/2157.Groups-of-Strings/Readme.md -------------------------------------------------------------------------------- /Union_Find/2421.Number-of-Good-Paths/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Union_Find/2421.Number-of-Good-Paths/Readme.md -------------------------------------------------------------------------------- /Union_Find/305.Number-of-Islands-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Union_Find/305.Number-of-Islands-II/Readme.md -------------------------------------------------------------------------------- /Union_Find/547.Friend-Circles/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Union_Find/547.Friend-Circles/Readme.md -------------------------------------------------------------------------------- /Union_Find/684.Redundant-Connection/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Union_Find/684.Redundant-Connection/Readme.md -------------------------------------------------------------------------------- /Union_Find/685.Redundant-Connection-II/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Union_Find/685.Redundant-Connection-II/Readme.md -------------------------------------------------------------------------------- /Union_Find/721.Accounts-Merge/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Union_Find/721.Accounts-Merge/Readme.md -------------------------------------------------------------------------------- /Union_Find/765.Couples-Holding-Hands/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Union_Find/765.Couples-Holding-Hands/Readme.md -------------------------------------------------------------------------------- /Union_Find/924.Minimize-Malware-Spread/Readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/Union_Find/924.Minimize-Malware-Spread/Readme.md -------------------------------------------------------------------------------- /tests/BFS/1036.Escape-a-Large-Maze/CMakeLists.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/tests/BFS/1036.Escape-a-Large-Maze/CMakeLists.txt -------------------------------------------------------------------------------- /tests/BFS/CMakeLists.txt: -------------------------------------------------------------------------------- 1 | add_subdirectory(1036.Escape-a-Large-Maze) -------------------------------------------------------------------------------- /tests/CMakeLists.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/tests/CMakeLists.txt -------------------------------------------------------------------------------- /tests/Divide_Conquer/CMakeLists.txt: -------------------------------------------------------------------------------- 1 | add_subdirectory(315.Count-of-Smaller-Numbers-After-Self) -------------------------------------------------------------------------------- /tests/Dynamic_Programming/CMakeLists.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wisdompeak/LeetCode/HEAD/tests/Dynamic_Programming/CMakeLists.txt --------------------------------------------------------------------------------