main
leetcode-coffeescript
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2477.Minimum Fuel Cost to Report to the Capital\Solution.py
2 1 -
A
solution\2400-2499\2464.Minimum Subarrays in a Valid Split\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\0900-0999\0967.Numbers With Same Consecutive Differences\Solution.py
2 1 -
A
solution\2400-2499\2450.Number of Distinct Binary Strings After Applying Operations\Solution.cpp
2 1 -
A
solution\0600-0699\0634.Find the Derangement of An Array\Solution.cpp
2 1 -
A
solution\2400-2499\2441.Largest Positive Integer That Exists With Its Negative\Solution.ts
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\2400-2499\2450.Number of Distinct Binary Strings After Applying Operations\Solution.java
2 1 -
A
solution\2400-2499\2429.Minimize XOR\Solution.ts
2 1 -
A
solution\0400-0499\0464.Can I Win\Solution.py
2 1 -
A
solution\2100-2199\2134.Minimum Swaps to Group All 1's Together II\Solution.ts
2 1 -
A
solution\0600-0699\0643.Maximum Average Subarray I\Solution.ts
2 1 -
A
solution\2400-2499\2427.Number of Common Factors\Solution.cpp
2 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.cpp
2 1 -
A
solution\0800-0899\0824.Goat Latin\Solution.ts
2 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.java
2 1 -
A
solution\2400-2499\2418.Sort the People\Solution.ts
2 1 -