Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-nushell
381
issues
2
pull requests
4,280
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2417.Closest Fair Integer\Solution.java
6
1
-
A
solution\0500-0599\0508.Most Frequent Subtree Sum\Solution.java
6
1
-
A
solution\2300-2399\2382.Maximum Segment Sum After Removals\Solution.py
6
1
-
A
solution\2300-2399\2384.Largest Palindromic Number\Solution.py
6
1
-
A
solution\2100-2199\2193.Minimum Number of Moves to Make Palindrome\Solution.cpp
6
1
-
A
solution\2100-2199\2193.Minimum Number of Moves to Make Palindrome\Solution.java
6
1
-
A
solution\2100-2199\2193.Minimum Number of Moves to Make Palindrome\Solution.py
6
1
-
A
solution\2400-2499\2454.Next Greater Element IV\Solution.java
6
1
-
A
solution\2400-2499\2454.Next Greater Element IV\Solution.py
6
1
-
A
solution\2400-2499\2454.Next Greater Element IV\Solution.cpp
6
1
-
A
solution\2400-2499\2415.Reverse Odd Levels of Binary Tree\Solution.ts
6
1
-
A
solution\0500-0599\0515.Find Largest Value in Each Tree Row\Solution.cpp
6
1
-
A
solution\2200-2299\2202.Maximize the Topmost Element After K Moves\Solution.cpp
6
1
-
A
solution\2200-2299\2202.Maximize the Topmost Element After K Moves\Solution.java
6
1
-
A
solution\0500-0599\0515.Find Largest Value in Each Tree Row\Solution.java
6
1
-
A
solution\0700-0799\0743.Network Delay Time\Solution.py
6
1
-
A
solution\0500-0599\0515.Find Largest Value in Each Tree Row\Solution.py
6
1
-
A
solution\2200-2299\2209.Minimum White Tiles After Covering With Carpets\Solution.cpp
6
1
-
A
solution\0700-0799\0745.Prefix and Suffix Search\Solution.cpp
6
1
-
A
solution\0500-0599\0516.Longest Palindromic Subsequence\Solution.cpp
6
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!