Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-beef
323
issues
2
pull requests
4,998
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2267.Check if There Is a Valid Parentheses String Path\Solution.py
1
1
-
A
solution\0700-0799\0786.K-th Smallest Prime Fraction\Solution.java
6
1
-
A
solution\2200-2299\2268.Minimum Number of Keypresses\Solution.go
1
-
A
solution\0500-0599\0540.Single Element in a Sorted Array\Solution.java
3
1
-
A
solution\2200-2299\2268.Minimum Number of Keypresses\Solution.py
3
1
-
A
solution\0700-0799\0787.Cheapest Flights Within K Stops\Solution.go
1
-
A
solution\2200-2299\2269.Find the K-Beauty of a Number\Solution.go
1
-
A
solution\0400-0499\0427.Construct Quad Tree\Solution.py
1
1
-
A
solution\2300-2399\2321.Maximum Score Of Spliced Array\Solution.py
1
1
-
A
solution\2300-2399\2321.Maximum Score Of Spliced Array\Solution.java
5
1
-
A
solution\2200-2299\2294.Partition Array Such That Maximum Difference Is K\Solution.ts
2
1
-
A
solution\2200-2299\2288.Apply Discount to Prices\Solution.ts
1
1
-
A
solution\2200-2299\2285.Maximum Total Importance of Roads\Solution.cpp
3
1
-
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.java
4
1
-
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.c
5
1
-
A
solution\2200-2299\2274.Maximum Consecutive Floors Without Special Floors\Solution.java
2
1
-
A
solution\0300-0399\0322.Coin Change\Solution.js
3
1
-
A
solution\0400-0499\0448.Find All Numbers Disappeared in an Array\Solution.ts
4
1
-
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.py
4
1
-
A
solution\0800-0899\0866.Prime Palindrome\Solution.go
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!