Name		Name	Last commit message	Last commit date
Latest commit History 1,233 Commits
CodeInterviews-SwordOffer-II		CodeInterviews-SwordOffer-II
CodeInterviews-SwordOffer		CodeInterviews-SwordOffer
Interview		Interview
LeetCodeProblem		LeetCodeProblem
N0001-1000		N0001-1000
N0657-Robot-Return-to-Origin		N0657-Robot-Return-to-Origin
N0756-Pyramid-Transition-Matrix		N0756-Pyramid-Transition-Matrix
N0865-Smallest-Subtree-with-all-the-Deepest-Nodes		N0865-Smallest-Subtree-with-all-the-Deepest-Nodes
N0955-Delete-Columns-to-Make-Sorted-II		N0955-Delete-Columns-to-Make-Sorted-II
N0960-Delete-Columns-to-Make-Sorted-III		N0960-Delete-Columns-to-Make-Sorted-III
N1001-2000		N1001-2000
N1009-Complement-of-Base-10-Integer		N1009-Complement-of-Base-10-Integer
N1292-Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Threshold		N1292-Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Threshold
N1320-Minimum-Distance-to-Type-a-Word-Using-Two-Fingers		N1320-Minimum-Distance-to-Type-a-Word-Using-Two-Fingers
N1390-Four-Divisors		N1390-Four-Divisors
N1391-Check-if-There-is-a-Valid-Path-in-a-Grid		N1391-Check-if-There-is-a-Valid-Path-in-a-Grid
N1411-Number-of-Ways-to-Paint-N-×-3-Grid		N1411-Number-of-Ways-to-Paint-N-×-3-Grid
N1536-Minimum-Swaps-to-Arrange-a-Binary-Grid		N1536-Minimum-Swaps-to-Arrange-a-Binary-Grid
N1559-Detect-Cycles-in-2D-Grid		N1559-Detect-Cycles-in-2D-Grid
N1594-Maximum-Non-Negative-Product-in-a-Matrix		N1594-Maximum-Non-Negative-Product-in-a-Matrix
N1622-Fancy-Sequence		N1622-Fancy-Sequence
N1722-Minimize-Hamming-Distance-After-Swap-Operations		N1722-Minimize-Hamming-Distance-After-Swap-Operations
N1848-Minimum-Distance-to-the-Target-Element		N1848-Minimum-Distance-to-the-Target-Element
N1855-Maximum-Distance-Between-a-Pair-of-Values		N1855-Maximum-Distance-Between-a-Pair-of-Values
N1878-Get-Biggest-Three-Rhombus-Sums-in-a-Grid		N1878-Get-Biggest-Three-Rhombus-Sums-in-a-Grid
N1886-Determine-Whether-Matrix-Can-Be-Obtained-By-Rotation		N1886-Determine-Whether-Matrix-Can-Be-Obtained-By-Rotation
N1888-Minimum-Number-of-Flips-to-Make-the-Binary-String-Alternating		N1888-Minimum-Number-of-Flips-to-Make-the-Binary-String-Alternating
N1895-Largest-Magic-Square		N1895-Largest-Magic-Square
N1925-Count-Square-Sum-Triples		N1925-Count-Square-Sum-Triples
N1984-Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores		N1984-Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores
N2001-3000		N2001-3000
N2069-Walking-Robot-Simulation-II		N2069-Walking-Robot-Simulation-II
N2075-Decode-the-Slanted-Ciphertext		N2075-Decode-the-Slanted-Ciphertext
N2078-Two-Furthest-Houses-With-Different-Colors		N2078-Two-Furthest-Houses-With-Different-Colors
N2087-Minimum-Cost-Homecoming-of-a-Robot-in-a-Grid		N2087-Minimum-Cost-Homecoming-of-a-Robot-in-a-Grid
N2110-Number-of-Smooth-Descent-Periods-of-a-Stock		N2110-Number-of-Smooth-Descent-Periods-of-a-Stock
N2154-Keep-Multiplying-Found-Values-by-Two		N2154-Keep-Multiplying-Found-Values-by-Two
N2211-Count-Collisions-on-a-Road		N2211-Count-Collisions-on-a-Road
N2452-Words-Within-Two-Edits-of-Dictionary		N2452-Words-Within-Two-Edits-of-Dictionary
N2515-Shortest-Distance-to-Target-String-in-a-Circular-Array		N2515-Shortest-Distance-to-Target-String-in-a-Circular-Array
N2536-Increment-Submatrices-by-One		N2536-Increment-Submatrices-by-One
N2573-Find-the-String-with-LCP		N2573-Find-the-String-with-LCP
N2615-Sum-of-Distances		N2615-Sum-of-Distances
N2839-Check-if-Strings-Can-be-Made-Equal-With-Operations-I		N2839-Check-if-Strings-Can-be-Made-Equal-With-Operations-I
N2840-Check-if-Strings-Can-be-Made-Equal-With-Operations-II		N2840-Check-if-Strings-Can-be-Made-Equal-With-Operations-II
N2906-Construct-Product-Matrix		N2906-Construct-Product-Matrix
N2943-Maximize-Area-of-Square-Hole-in-Grid		N2943-Maximize-Area-of-Square-Hole-in-Grid
N2946-Matrix-Similarity-After-Cyclic-Shifts		N2946-Matrix-Similarity-After-Cyclic-Shifts
N2975-Maximum-Square-Area-by-Removing-Fences-From-a-Field		N2975-Maximum-Square-Area-by-Removing-Fences-From-a-Field
N2977-Minimum-Cost-to-Convert-String-II		N2977-Minimum-Cost-to-Convert-String-II
N3001-4000		N3001-4000
N3010-Divide-an-Array-Into-Subarrays-With-Minimum-Cost-I		N3010-Divide-an-Array-Into-Subarrays-With-Minimum-Cost-I
N3013-Divide-an-Array-Into-Subarrays-With-Minimum-Cost-II		N3013-Divide-an-Array-Into-Subarrays-With-Minimum-Cost-II
N3047-Find-the-Largest-Area-of-Square-Inside-Two-Rectangles		N3047-Find-the-Largest-Area-of-Square-Inside-Two-Rectangles
N3070-Count-Submatrices-with-Top-Left-Element-and-Sum-Less-Than-k		N3070-Count-Submatrices-with-Top-Left-Element-and-Sum-Less-Than-k
N3074-Apple-Redistribution-into-Boxes		N3074-Apple-Redistribution-into-Boxes
N3190-Find-Minimum-Operations-to-Make-All-Elements-Divisible-by-Three		N3190-Find-Minimum-Operations-to-Make-All-Elements-Divisible-by-Three
N3212-Count-Submatrices-With-Equal-Frequency-of-X-and-Y		N3212-Count-Submatrices-With-Equal-Frequency-of-X-and-Y
N3225-Maximum-Score-From-Grid-Operations		N3225-Maximum-Score-From-Grid-Operations
N3228-Maximum-Number-of-Operations-to-Move-Ones-to-the-End		N3228-Maximum-Number-of-Operations-to-Move-Ones-to-the-End
N3296-Minimum-Number-of-Seconds-to-Make-Mountain-Height-Zero		N3296-Minimum-Number-of-Seconds-to-Make-Mountain-Height-Zero
N3314-Construct-the-Minimum-Bitwise-Array-I		N3314-Construct-the-Minimum-Bitwise-Array-I
N3315-Construct-the-Minimum-Bitwise-Array-II		N3315-Construct-the-Minimum-Bitwise-Array-II
N3379-Transformed-Array		N3379-Transformed-Array
N3418-Maximum-Amount-of-Money-Robot-Can-Earn		N3418-Maximum-Amount-of-Money-Robot-Can-Earn
N3432-Count-Partitions-with-Even-Sum-Difference		N3432-Count-Partitions-with-Even-Sum-Difference
N3433-Count-Mentions-Per-User		N3433-Count-Mentions-Per-User
N3453-Separate-Squares-I		N3453-Separate-Squares-I
N3454-Separate-Squares-II		N3454-Separate-Squares-II
N3464-Maximize-the-Distance-Between-Points-on-a-Square		N3464-Maximize-the-Distance-Between-Points-on-a-Square
N3474-Lexicographically-Smallest-Generated-String		N3474-Lexicographically-Smallest-Generated-String
N3488-Closest-Equal-Element-Queries		N3488-Closest-Equal-Element-Queries
N3507-Minimum-Pair-Removal-to-Sort-Array-I		N3507-Minimum-Pair-Removal-to-Sort-Array-I
N3510-Minimum-Pair-Removal-to-Sort-Array-II		N3510-Minimum-Pair-Removal-to-Sort-Array-II
N3531-Count-Covered-Buildings		N3531-Count-Covered-Buildings
N3542-Minimum-Operations-to-Convert-All-Elements-to-Zero		N3542-Minimum-Operations-to-Convert-All-Elements-to-Zero
N3546-Equal-Sum-Grid-Partition-I		N3546-Equal-Sum-Grid-Partition-I
N3548-Equal-Sum-Grid-Partition-II		N3548-Equal-Sum-Grid-Partition-II
N3562-Maximum-Profit-from-Trading-Stocks-with-Discounts		N3562-Maximum-Profit-from-Trading-Stocks-with-Discounts
N3567-Minimum-Absolute-Difference-in-Sliding-Submatrix		N3567-Minimum-Absolute-Difference-in-Sliding-Submatrix
N3573-Best-Time-to-Buy-and-Sell-Stock-V		N3573-Best-Time-to-Buy-and-Sell-Stock-V
N3577-Count-the-Number-of-Computer-Unlocking-Permutations		N3577-Count-the-Number-of-Computer-Unlocking-Permutations
N3578-Count-Partitions-With-Max-Min-Difference-at-Most-K		N3578-Count-Partitions-With-Max-Min-Difference-at-Most-K
N3583-Count-Special-Triplets		N3583-Count-Special-Triplets
N3600-Maximize-Spanning-Tree-Stability-with-Upgrades		N3600-Maximize-Spanning-Tree-Stability-with-Upgrades
N3606-Coupon-Code-Validator		N3606-Coupon-Code-Validator
N3623-Count-Number-of-Trapezoids-I		N3623-Count-Number-of-Trapezoids-I
N3625-Count-Number-of-Trapezoids-II		N3625-Count-Number-of-Trapezoids-II
N3634-Minimum-Removals-to-Balance-Array		N3634-Minimum-Removals-to-Balance-Array
N3637-Trionic-Array-I		N3637-Trionic-Array-I
N3640-Trionic-Array-II		N3640-Trionic-Array-II
N3643-Flip-Square-Submatrix-Vertically		N3643-Flip-Square-Submatrix-Vertically
N3650-Minimum-Cost-Path-with-Edge-Reversals		N3650-Minimum-Cost-Path-with-Edge-Reversals
N3651-Minimum-Cost-Path-with-Teleportations		N3651-Minimum-Cost-Path-with-Teleportations
N3652-Best-Time-to-Buy-and-Sell-Stock-using-Strategy		N3652-Best-Time-to-Buy-and-Sell-Stock-using-Strategy
N3653-XOR-After-Range-Multiplication-Queries-I		N3653-XOR-After-Range-Multiplication-Queries-I
N3655-XOR-After-Range-Multiplication-Queries-II		N3655-XOR-After-Range-Multiplication-Queries-II
N3661-Maximum-Walls-Destroyed-by-Robots		N3661-Maximum-Walls-Destroyed-by-Robots
N3666-Minimum-Operations-to-Equalize-Binary-String		N3666-Minimum-Operations-to-Equalize-Binary-String
N3713-Longest-Balanced-Substring-I		N3713-Longest-Balanced-Substring-I

Folders and files

Latest commit

History

Repository files navigation

leetcode

About

Resources

License

Uh oh!

Stars

Watchers

Forks

Uh oh!

Contributors

Uh oh!

Languages