Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-rect
417
issues
2
pull requests
3,680
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2000-2099\2070.Most Beautiful Item for Each Query\Solution.cpp
7
1
-
A
solution\2300-2399\2398.Maximum Number of Robots Within Budget\Solution.java
7
1
-
A
solution\2000-2099\2086.Minimum Number of Food Buckets to Feed the Hamsters\Solution.java
7
1
-
A
solution\0800-0899\0816.Ambiguous Coordinates\Solution.cpp
7
1
-
A
solution\0300-0399\0311.Sparse Matrix Multiplication\Solution.cpp
7
1
-
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.ts
7
1
-
A
solution\2300-2399\2360.Longest Cycle in a Graph\Solution.ts
7
1
-
A
solution\0800-0899\0813.Largest Sum of Averages\Solution.java
7
1
-
A
solution\0500-0599\0526.Beautiful Arrangement\Solution.java
7
1
-
A
solution\0500-0599\0526.Beautiful Arrangement\Solution.ts
7
1
-
A
solution\0800-0899\0894.All Possible Full Binary Trees\Solution.java
7
1
-
A
solution\0800-0899\0808.Soup Servings\Solution.cpp
7
1
-
A
solution\0800-0899\0893.Groups of Special-Equivalent Strings\Solution.java
7
1
-
A
solution\2000-2099\2059.Minimum Operations to Convert Number\Solution.py
7
1
-
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.ts
7
1
-
A
solution\0300-0399\0360.Sort Transformed Array\Solution.java
7
1
-
A
solution\0800-0899\0802.Find Eventual Safe States\Solution.java
7
1
-
A
solution\0800-0899\0801.Minimum Swaps To Make Sequences Increasing\Solution.cpp
7
1
-
A
solution\0900-0999\0982.Triples with Bitwise AND Equal To Zero\Solution.java
7
1
-
A
solution\0800-0899\0863.All Nodes Distance K in Binary Tree\Solution.java
7
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!