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\1000-1099\1019.Next Greater Node In Linked List\Solution.java
6
1
-
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.js
6
1
1
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.py
6
1
-
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.ts
6
1
1
A
solution\2200-2299\2284.Sender With Largest Word Count\Solution.cpp
6
1
-
A
solution\0600-0699\0684.Redundant Connection\Solution.cpp
6
1
-
A
solution\0600-0699\0684.Redundant Connection\Solution.java
6
1
-
A
solution\0400-0499\0488.Zuma Game\Solution.py
6
1
-
A
solution\2500-2599\2517.Maximum Tastiness of Candy Basket\Solution.java
6
1
-
A
solution\2300-2399\2328.Number of Increasing Paths in a Grid\Solution.ts
6
1
-
A
solution\0400-0499\0489.Robot Room Cleaner\Solution.cpp
6
1
-
A
solution\0400-0499\0489.Robot Room Cleaner\Solution.java
6
1
-
A
solution\2400-2499\2454.Next Greater Element IV\Solution.py
6
1
-
A
solution\2500-2599\2517.Maximum Tastiness of Candy Basket\Solution.cpp
6
1
-
A
solution\2200-2299\2249.Count Lattice Points Inside a Circle\Solution.cpp
6
1
-
A
solution\2400-2499\2454.Next Greater Element IV\Solution.java
6
1
-
A
solution\0600-0699\0689.Maximum Sum of 3 Non-Overlapping Subarrays\Solution.cpp
6
1
-
A
solution\2400-2499\2453.Destroy Sequential Targets\Solution.java
6
1
-
A
solution\0400-0499\0491.Non-decreasing Subsequences\Solution.cpp
6
1
-
A
solution\2000-2099\2007.Find Original Array From Doubled Array\Solution.py
6
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!