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\0800-0899\0889.Construct Binary Tree from Preorder and Postorder Traversal\Solution.cpp
5
1
-
A
solution\2300-2399\2389.Longest Subsequence With Limited Sum\Solution.ts
5
1
-
A
solution\0800-0899\0889.Construct Binary Tree from Preorder and Postorder Traversal\Solution.py
5
1
-
A
solution\0800-0899\0890.Find and Replace Pattern\Solution.cpp
5
1
-
A
solution\0600-0699\0605.Can Place Flowers\Solution.cpp
5
1
-
A
solution\0400-0499\0440.K-th Smallest in Lexicographical Order\Solution.java
5
1
-
A
solution\0600-0699\0605.Can Place Flowers\Solution.java
5
1
-
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.cpp
5
1
-
A
solution\0300-0399\0373.Find K Pairs with Smallest Sums\Solution.java
5
1
-
A
solution\0600-0699\0606.Construct String from Binary Tree\Solution.java
5
1
-
A
solution\0800-0899\0893.Groups of Special-Equivalent Strings\Solution.cpp
5
1
-
A
solution\0600-0699\0609.Find Duplicate File in System\Solution.java
5
1
-
A
solution\2300-2399\2385.Amount of Time for Binary Tree to Be Infected\Solution.py
5
1
-
A
solution\0300-0399\0373.Find K Pairs with Smallest Sums\Solution.py
5
1
-
A
solution\0400-0499\0442.Find All Duplicates in an Array\Solution.cpp
5
1
-
A
solution\2200-2299\2239.Find Closest Number to Zero\Solution.cpp
5
1
-
A
solution\0900-0999\0954.Array of Doubled Pairs\Solution.java
5
1
-
A
solution\0300-0399\0334.Increasing Triplet Subsequence\Solution.cpp
5
1
-
A
solution\2200-2299\2239.Find Closest Number to Zero\Solution.java
5
1
-
A
solution\0800-0899\0896.Monotonic Array\Solution.js
5
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!