Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-idris
404
issues
2
pull requests
4,412
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0700-0799\0788.Rotated Digits\Solution.py
2
1
1
A
solution\0700-0799\0790.Domino and Tromino Tiling\Solution.cpp
2
1
-
A
solution\0700-0799\0790.Domino and Tromino Tiling\Solution.java
2
1
-
A
solution\2200-2299\2219.Maximum Sum Score of Array\Solution.js
2
1
-
A
solution\2200-2299\2219.Maximum Sum Score of Array\Solution.ts
2
1
-
A
solution\2200-2299\2220.Minimum Bit Flips to Convert Number\Solution.cpp
2
1
-
A
solution\2200-2299\2220.Minimum Bit Flips to Convert Number\Solution.java
2
1
-
A
solution\2200-2299\2224.Minimum Number of Operations to Convert Time\Solution.cpp
2
1
-
A
solution\2200-2299\2224.Minimum Number of Operations to Convert Time\Solution.java
2
1
-
A
solution\0700-0799\0797.All Paths From Source to Target\Solution.js
2
1
-
A
solution\2200-2299\2240.Number of Ways to Buy Pens and Pencils\Solution.cpp
2
1
-
A
solution\2200-2299\2240.Number of Ways to Buy Pens and Pencils\Solution.java
2
1
-
A
solution\2200-2299\2243.Calculate Digit Sum of a String\Solution.ts
2
1
-
A
solution\2600-2699\2602.Minimum Operations to Make All Array Elements Equal\Solution.py
2
1
-
A
solution\2600-2699\2600.K Items With the Maximum Sum\Solution.ts
2
1
-
A
solution\2500-2599\2588.Count the Number of Beautiful Subarrays\Solution.java
2
1
-
A
solution\2500-2599\2587.Rearrange Array to Maximize Prefix Score\Solution.ts
2
1
-
A
solution\2500-2599\2574.Left and Right Sum Differences\Solution.cpp
2
1
-
A
solution\0800-0899\0808.Soup Servings\Solution.py
2
1
-
A
solution\0300-0399\0366.Find Leaves of Binary Tree\Solution.py
2
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!