Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-f-sharp
376
issues
2
pull requests
4,998
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2100-2199\2169.Count Operations to Obtain Zero\Solution.ts
2
1
-
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.cpp
2
1
-
A
solution\1000-1099\1018.Binary Prefix Divisible By 5\Solution.java
2
1
-
A
solution\2100-2199\2160.Minimum Sum of Four Digit Number After Splitting Digits\Solution.java
2
1
-
A
solution\2100-2199\2160.Minimum Sum of Four Digit Number After Splitting Digits\Solution.cpp
2
1
-
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.ts
2
1
-
A
solution\2100-2199\2154.Keep Multiplying Found Values by Two\Solution.py
2
1
-
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.ts
2
1
-
A
solution\2100-2199\2160.Minimum Sum of Four Digit Number After Splitting Digits\Solution.py
2
1
-
A
solution\0300-0399\0309.Best Time to Buy and Sell Stock with Cooldown\Solution.java
2
1
-
A
solution\2100-2199\2151.Maximum Good People Based on Statements\Solution.py
2
1
-
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.ts
2
1
-
A
solution\0500-0599\0598.Range Addition II\Solution.java
2
1
-
A
solution\0500-0599\0598.Range Addition II\Solution.py
2
1
-
A
solution\2300-2399\2365.Task Scheduler II\Solution.cpp
2
1
-
A
solution\0900-0999\0998.Maximum Binary Tree II\Solution.ts
2
1
-
A
solution\2300-2399\2364.Count Number of Bad Pairs\Solution.java
2
1
-
A
solution\2100-2199\2148.Count Elements With Strictly Smaller and Greater Elements\Solution.py
2
1
-
A
solution\0600-0699\0600.Non-negative Integers without Consecutive Ones\Solution.py
2
1
1
A
solution\2300-2399\2365.Task Scheduler II\Solution.java
2
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!