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\0907.Sum of Subarray Minimums\Solution.ts
5
1
-
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.py
5
1
-
A
solution\0800-0899\0849.Maximize Distance to Closest Person\Solution.cpp
5
1
-
A
solution\0800-0899\0849.Maximize Distance to Closest Person\Solution.java
5
1
-
A
solution\0800-0899\0849.Maximize Distance to Closest Person\Solution.py
5
1
-
A
solution\0900-0999\0900.RLE Iterator\Solution.cpp
5
1
-
A
solution\2300-2399\2354.Number of Excellent Pairs\Solution.py
5
1
-
A
solution\0800-0899\0851.Loud and Rich\Solution.ts
5
1
-
A
solution\2100-2199\2164.Sort Even and Odd Indices Independently\Solution.java
5
1
-
A
solution\0300-0399\0373.Find K Pairs with Smallest Sums\Solution.java
5
1
-
A
solution\2000-2099\2090.K Radius Subarray Averages\Solution.java
5
1
-
A
solution\2300-2399\2352.Equal Row and Column Pairs\Solution.cpp
5
1
-
A
solution\2300-2399\2349.Design a Number Container System\Solution.py
5
1
-
A
solution\0300-0399\0373.Find K Pairs with Smallest Sums\Solution.py
5
1
-
A
solution\0500-0599\0581.Shortest Unsorted Continuous Subarray\Solution.java
5
1
-
A
solution\0500-0599\0581.Shortest Unsorted Continuous Subarray\Solution.py
5
1
-
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.java
5
1
-
A
solution\0300-0399\0320.Generalized Abbreviation\Solution.java
5
1
-
A
solution\2300-2399\2354.Number of Excellent Pairs\Solution.cpp
5
1
-
A
solution\0800-0899\0856.Score of Parentheses\Solution.cpp
5
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!