Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-ion
378
issues
2
pull requests
3,911
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2420.Find All Good Indices\Solution.java
8
1
-
A
solution\2400-2499\2415.Reverse Odd Levels of Binary Tree\Solution.py
8
1
-
A
solution\2400-2499\2415.Reverse Odd Levels of Binary Tree\Solution.java
8
1
-
A
solution\2300-2399\2397.Maximum Rows Covered by Columns\Solution.java
8
1
-
A
solution\2000-2099\2093.Minimum Cost to Reach City With Discounts\Solution.py
8
1
-
A
solution\0900-0999\0983.Minimum Cost For Tickets\Solution.java
8
1
-
A
solution\0600-0699\0673.Number of Longest Increasing Subsequence\Solution.py
8
1
-
A
solution\2300-2399\2360.Longest Cycle in a Graph\Solution.py
8
1
-
A
solution\2300-2399\2360.Longest Cycle in a Graph\Solution.java
8
1
-
A
solution\2000-2099\2086.Minimum Number of Food Buckets to Feed the Hamsters\Solution.cpp
8
1
-
A
solution\0600-0699\0673.Number of Longest Increasing Subsequence\Solution.java
8
1
-
A
solution\2300-2399\2347.Best Poker Hand\Solution.java
8
1
-
A
solution\2300-2399\2355.Maximum Number of Books You Can Take\Solution.java
8
1
-
A
solution\2300-2399\2347.Best Poker Hand\Solution.c
8
1
-
A
solution\2300-2399\2355.Maximum Number of Books You Can Take\Solution.py
8
1
-
B
solution\2000-2099\2065.Maximum Path Quality of a Graph\Solution.ts
8
1
11
A
solution\0300-0399\0381.Insert Delete GetRandom O(1) - Duplicates allowed\Solution.java
8
1
1
A
solution\2000-2099\2061.Number of Spaces Cleaning Robot Cleaned\Solution.cpp
8
1
-
A
solution\0900-0999\0967.Numbers With Same Consecutive Differences\Solution.java
8
1
-
A
solution\2000-2099\2059.Minimum Operations to Convert Number\Solution.java
8
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!