main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2465.Number of Distinct Averages\Solution.java
2 1 -
A
solution\2400-2499\2459.Sort Array by Moving Items to Empty Space\Solution.py
2 1 -
A
solution\0700-0799\0717.1-bit and 2-bit Characters\Solution.cpp
2 1 -
A
solution\0700-0799\0717.1-bit and 2-bit Characters\Solution.java
2 1 -
A
solution\0700-0799\0771.Jewels and Stones\Solution.ts
2 1 1
A
solution\2100-2199\2185.Counting Words With a Given Prefix\Solution.cpp
2 1 -
A
solution\2100-2199\2180.Count Integers With Even Digit Sum\Solution.py
2 1 -
A
solution\2100-2199\2180.Count Integers With Even Digit Sum\Solution.cpp
2 1 -
A
solution\2200-2299\2220.Minimum Bit Flips to Convert Number\Solution.cpp
2 1 -
A
solution\0700-0799\0789.Escape The Ghosts\Solution.ts
2 1 -
A
solution\0900-0999\0918.Maximum Sum Circular Subarray\Solution.ts
2 1 -
A
solution\0700-0799\0733.Flood Fill\Solution.ts
2 1 -
A
solution\2100-2199\2177.Find Three Consecutive Integers That Sum to a Given Number\Solution.cpp
2 1 -
A
solution\2400-2499\2433.Find The Original Array of Prefix Xor\Solution.cpp
2 1 -
A
solution\2100-2199\2171.Removing Minimum Number of Magic Beans\Solution.cpp
2 1 -
A
solution\2100-2199\2169.Count Operations to Obtain Zero\Solution.ts
2 1 -
A
solution\2400-2499\2433.Find The Original Array of Prefix Xor\Solution.java
2 1 -
A
solution\2100-2199\2177.Find Three Consecutive Integers That Sum to a Given Number\Solution.java
2 1 -
A
solution\2100-2199\2171.Removing Minimum Number of Magic Beans\Solution.py
2 1 -
A
solution\0700-0799\0788.Rotated Digits\Solution.py
2 1 1