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\0900-0999\0948.Bag of Tokens\Solution.java
4
1
-
A
solution\0900-0999\0948.Bag of Tokens\Solution.py
4
1
-
A
solution\2100-2199\2134.Minimum Swaps to Group All 1's Together II\Solution.py
4
1
-
A
solution\0900-0999\0950.Reveal Cards In Increasing Order\Solution.java
4
1
-
A
solution\2300-2399\2353.Design a Food Rating System\Solution.py
4
1
-
A
solution\2100-2199\2108.Find First Palindromic String in the Array\Solution.ts
4
1
-
A
solution\0400-0499\0456.132 Pattern\Solution.ts
4
1
-
A
solution\2200-2299\2206.Divide Array Into Equal Pairs\Solution.cpp
4
1
-
A
solution\2300-2399\2353.Design a Food Rating System\Solution.cpp
4
1
-
A
solution\2200-2299\2289.Steps to Make Array Non-decreasing\Solution.ts
4
1
-
A
solution\2200-2299\2279.Maximum Bags With Full Capacity of Rocks\Solution.cpp
4
1
-
A
solution\2600-2699\2653.Sliding Subarray Beauty\Solution.ts
4
1
-
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.cpp
4
1
-
A
solution\2100-2199\2190.Most Frequent Number Following Key In an Array\Solution.java
4
1
-
A
solution\0900-0999\0958.Check Completeness of a Binary Tree\Solution.cpp
4
1
-
A
solution\2400-2499\2447.Number of Subarrays With GCD Equal to K\Solution.py
4
1
-
A
solution\2200-2299\2225.Find Players With Zero or One Losses\Solution.java
4
1
-
A
solution\0900-0999\0958.Check Completeness of a Binary Tree\Solution.java
4
1
-
A
solution\2200-2299\2233.Maximum Product After K Increments\Solution.java
4
1
-
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.java
4
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!