Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-c--
312
issues
2
pull requests
4,754
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0452.Minimum Number of Arrows to Burst Balloons\Solution.java
3
1
-
A
solution\0400-0499\0452.Minimum Number of Arrows to Burst Balloons\Solution.py
3
1
-
A
solution\2000-2099\2057.Smallest Index With Equal Value\Solution.java
3
1
-
A
solution\0500-0599\0599.Minimum Index Sum of Two Lists\Solution.ts
3
1
-
A
solution\0300-0399\0383.Ransom Note\Solution.cs
3
1
-
A
solution\2400-2499\2473.Minimum Cost to Buy Apples\Solution.py
3
1
-
A
solution\2000-2099\2049.Count Nodes With the Highest Score\Solution.py
3
1
-
A
solution\0300-0399\0347.Top K Frequent Elements\Solution.java
3
1
-
A
solution\2000-2099\2048.Next Greater Numerically Balanced Number\Solution.py
3
1
-
A
solution\2000-2099\2046.Sort Linked List Already Sorted Using Absolute Values\Solution.py
3
1
-
A
solution\2400-2499\2475.Number of Unequal Triplets in Array\Solution.ts
3
1
-
A
solution\2000-2099\2046.Sort Linked List Already Sorted Using Absolute Values\Solution.java
3
1
-
A
solution\0800-0899\0867.Transpose Matrix\Solution.java
3
1
-
A
solution\0800-0899\0868.Binary Gap\Solution.ts
3
1
-
A
solution\0600-0699\0605.Can Place Flowers\Solution.py
3
1
-
A
solution\0800-0899\0869.Reordered Power of 2\Solution.py
3
1
-
A
solution\0300-0399\0383.Ransom Note\Solution.py
3
1
-
A
solution\0800-0899\0870.Advantage Shuffle\Solution.ts
3
1
-
A
solution\0300-0399\0347.Top K Frequent Elements\Solution.ts
3
1
-
A
solution\2000-2099\2037.Minimum Number of Moves to Seat Everyone\Solution.c
3
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!