Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-brainfuck
384
issues
2
pull requests
4,998
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0900-0999\0914.X of a Kind in a Deck of Cards\Solution.java
7
1
-
A
solution\2300-2399\2398.Maximum Number of Robots Within Budget\Solution.java
7
1
-
A
solution\2000-2099\2048.Next Greater Numerically Balanced Number\Solution.java
7
1
-
A
solution\0900-0999\0988.Smallest String Starting From Leaf\Solution.cpp
7
1
-
A
solution\0900-0999\0912.Sort an Array\Solution.java
7
1
-
A
solution\2300-2399\2347.Best Poker Hand\Solution.cpp
7
1
-
A
solution\2000-2099\2049.Count Nodes With the Highest Score\Solution.cpp
7
1
-
A
solution\0900-0999\0917.Reverse Only Letters\Solution.py
7
1
-
A
solution\0500-0599\0514.Freedom Trail\Solution.cpp
7
1
-
A
solution\0300-0399\0358.Rearrange String k Distance Apart\Solution.cpp
7
1
-
A
solution\0300-0399\0316.Remove Duplicate Letters\Solution.cpp
7
1
-
A
solution\0900-0999\0909.Snakes and Ladders\Solution.py
7
1
-
A
solution\0800-0899\0808.Soup Servings\Solution.cpp
7
1
-
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.java
7
1
-
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.cpp
7
1
-
A
solution\0400-0499\0410.Split Array Largest Sum\Solution.cpp
7
1
-
A
solution\0600-0699\0665.Non-decreasing Array\Solution.java
7
1
-
A
solution\0400-0499\0410.Split Array Largest Sum\Solution.java
7
1
-
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.c
7
1
-
A
solution\2000-2099\2038.Remove Colored Pieces if Both Neighbors are the Same Color\Solution.cpp
7
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!