main
leetcode-free-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0621.Task Scheduler\Solution.py
2 1 -
A
solution\2400-2499\2442.Count Number of Distinct Integers After Reverse Operations\Solution.py
2 1 -
A
solution\0900-0999\0918.Maximum Sum Circular Subarray\Solution.ts
2 1 -
A
solution\0600-0699\0623.Add One Row to Tree\Solution.py
2 1 -
A
solution\0600-0699\0624.Maximum Distance in Arrays\Solution.cpp
2 1 -
A
solution\0600-0699\0624.Maximum Distance in Arrays\Solution.java
2 1 -
A
solution\0600-0699\0624.Maximum Distance in Arrays\Solution.py
2 1 -
A
solution\0900-0999\0926.Flip String to Monotone Increasing\Solution.js
2 1 -
A
solution\2500-2599\2538.Difference Between Maximum and Minimum Price Sum\Solution.py
2 1 -
A
solution\2400-2499\2433.Find The Original Array of Prefix Xor\Solution.py
2 1 -
A
solution\2400-2499\2433.Find The Original Array of Prefix Xor\Solution.java
2 1 -
A
solution\2400-2499\2433.Find The Original Array of Prefix Xor\Solution.cpp
2 1 -
A
solution\0600-0699\0634.Find the Derangement of An Array\Solution.cpp
2 1 -
A
solution\0600-0699\0634.Find the Derangement of An Array\Solution.py
2 1 -
A
solution\2400-2499\2429.Minimize XOR\Solution.ts
2 1 -
A
solution\0300-0399\0326.Power of Three\Solution.java
2 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.cpp
2 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.java
2 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.py
2 1 -
A
solution\2400-2499\2427.Number of Common Factors\Solution.cpp
2 1 -