Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-elvish
436
issues
2
pull requests
3,660
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0807.Max Increase to Keep City Skyline\Solution.java
5
1
-
A
solution\2100-2199\2130.Maximum Twin Sum of a Linked List\Solution.py
5
1
-
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.ts
5
1
2
A
solution\2400-2499\2400.Number of Ways to Reach a Position After Exactly k Steps\Solution.ts
5
1
-
A
solution\2100-2199\2164.Sort Even and Odd Indices Independently\Solution.java
5
1
-
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.java
5
1
-
A
solution\0400-0499\0429.N-ary Tree Level Order Traversal\Solution.cpp
5
1
-
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.java
5
1
-
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.cpp
5
1
-
A
solution\2300-2399\2389.Longest Subsequence With Limited Sum\Solution.ts
5
1
-
A
solution\0800-0899\0819.Most Common Word\Solution.ts
5
1
-
A
solution\0800-0899\0821.Shortest Distance to a Character\Solution.cpp
5
1
-
A
solution\0800-0899\0821.Shortest Distance to a Character\Solution.java
5
1
-
A
solution\2300-2399\2387.Median of a Row Wise Sorted Matrix\Solution.cpp
5
1
-
A
solution\0800-0899\0821.Shortest Distance to a Character\Solution.py
5
1
-
A
solution\0300-0399\0312.Burst Balloons\Solution.py
5
1
1
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.cpp
5
1
-
A
solution\0300-0399\0369.Plus One Linked List\Solution.cpp
5
1
-
A
solution\2000-2099\2033.Minimum Operations to Make a Uni-Value Grid\Solution.java
5
1
-
A
solution\0800-0899\0826.Most Profit Assigning Work\Solution.cpp
5
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!