main
leetcode-free-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0623.Add One Row to Tree\Solution.ts
6 1 -
A
solution\0600-0699\0625.Minimum Factorization\Solution.cpp
6 1 -
A
solution\0900-0999\0923.3Sum With Multiplicity\Solution.cpp
6 1 -
A
solution\2500-2599\2521.Distinct Prime Factors of Product of Array\Solution.cpp
6 1 -
A
solution\2400-2499\2447.Number of Subarrays With GCD Equal to K\Solution.java
6 1 -
A
solution\0900-0999\0923.3Sum With Multiplicity\Solution.java
6 1 -
A
solution\2200-2299\2271.Maximum White Tiles Covered by a Carpet\Solution.java
6 1 -
A
solution\0600-0699\0628.Maximum Product of Three Numbers\Solution.ts
6 1 -
A
solution\0900-0999\0926.Flip String to Monotone Increasing\Solution.java
6 1 -
A
solution\0900-0999\0926.Flip String to Monotone Increasing\Solution.py
6 1 -
A
solution\0900-0999\0927.Three Equal Parts\Solution.py
6 1 -
A
solution\2300-2399\2338.Count the Number of Ideal Arrays\Solution.py
6 1 -
A
solution\0900-0999\0930.Binary Subarrays With Sum\Solution.cpp
6 1 -
A
solution\0900-0999\0930.Binary Subarrays With Sum\Solution.java
6 1 -
A
solution\0900-0999\0930.Binary Subarrays With Sum\Solution.py
6 1 -
A
solution\0900-0999\0931.Minimum Falling Path Sum\Solution.cpp
6 1 -
A
solution\0900-0999\0931.Minimum Falling Path Sum\Solution.java
6 1 -
A
solution\0600-0699\0635.Design Log Storage System\Solution.cpp
6 1 -
A
solution\2500-2599\2518.Number of Great Partitions\Solution.py
6 1 -
A
solution\0900-0999\0938.Range Sum of BST\Solution.cpp
6 1 -