Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-rect
405
issues
2
pull requests
4,998
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2381.Shifting Letters II\Solution.py
5
1
-
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.ts
5
1
-
A
solution\0400-0499\0438.Find All Anagrams in a String\Solution.java
5
1
-
A
solution\0800-0899\0822.Card Flipping Game\Solution.py
5
1
-
A
solution\2200-2299\2202.Maximize the Topmost Element After K Moves\Solution.py
5
1
-
A
solution\0800-0899\0821.Shortest Distance to a Character\Solution.java
5
1
-
A
solution\0800-0899\0821.Shortest Distance to a Character\Solution.py
5
1
-
A
solution\0800-0899\0821.Shortest Distance to a Character\Solution.cpp
5
1
-
A
solution\2000-2099\2070.Most Beautiful Item for Each Query\Solution.py
5
1
-
A
solution\0800-0899\0819.Most Common Word\Solution.ts
5
1
-
A
solution\0300-0399\0304.Range Sum Query 2D - Immutable\Solution.py
5
1
-
A
solution\0400-0499\0440.K-th Smallest in Lexicographical Order\Solution.java
5
1
-
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.java
4
1
-
A
solution\2100-2199\2169.Count Operations to Obtain Zero\Solution.java
4
1
-
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.py
4
1
-
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.java
4
1
-
A
solution\2100-2199\2169.Count Operations to Obtain Zero\Solution.py
4
1
-
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.py
4
1
-
A
solution\2000-2099\2042.Check if Numbers Are Ascending in a Sentence\Solution.ts
4
1
1
A
solution\2000-2099\2042.Check if Numbers Are Ascending in a Sentence\Solution.java
4
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!