Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-pharo
418
issues
3
pull requests
3,755
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0316.Remove Duplicate Letters\Solution.cpp
7
1
-
A
solution\0800-0899\0801.Minimum Swaps To Make Sequences Increasing\Solution.cpp
7
1
-
A
solution\2200-2299\2263.Make Array Non-decreasing or Non-increasing\Solution.java
7
1
-
A
solution\0800-0899\0802.Find Eventual Safe States\Solution.cpp
7
1
-
A
solution\0800-0899\0802.Find Eventual Safe States\Solution.java
7
1
-
A
solution\2300-2399\2397.Maximum Rows Covered by Columns\Solution.py
7
1
-
A
solution\2200-2299\2271.Maximum White Tiles Covered by a Carpet\Solution.cpp
7
1
-
A
solution\2200-2299\2272.Substring With Largest Variance\Solution.cpp
7
1
-
A
solution\2200-2299\2272.Substring With Largest Variance\Solution.java
7
1
-
A
solution\2200-2299\2272.Substring With Largest Variance\Solution.py
7
1
-
A
solution\0800-0899\0808.Soup Servings\Solution.cpp
7
1
-
A
solution\0300-0399\0311.Sparse Matrix Multiplication\Solution.cpp
7
1
-
A
solution\0400-0499\0433.Minimum Genetic Mutation\Solution.cpp
7
1
-
A
solution\0800-0899\0813.Largest Sum of Averages\Solution.java
7
1
-
A
solution\0400-0499\0433.Minimum Genetic Mutation\Solution.java
7
1
-
A
solution\0800-0899\0816.Ambiguous Coordinates\Solution.cpp
7
1
-
A
solution\2200-2299\2296.Design a Text Editor\Solution.java
7
1
1
A
solution\2300-2399\2398.Maximum Number of Robots Within Budget\Solutio.py
7
1
-
A
solution\2500-2599\2547.Minimum Cost to Split an Array\Solution.java
7
1
-
A
solution\0400-0499\0433.Minimum Genetic Mutation\Solution.ts
7
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!