Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-modula
398
issues
2
pull requests
4,998
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2000-2099\2093.Minimum Cost to Reach City With Discounts\Solution.py
8
1
-
A
solution\2300-2399\2397.Maximum Rows Covered by Columns\Solution.java
8
1
-
A
solution\0800-0899\0808.Soup Servings\Solution.java
8
1
-
A
solution\2400-2499\2421.Number of Good Paths\Solution.cpp
8
1
-
A
solution\0900-0999\0937.Reorder Data in Log Files\Solution.ts
8
1
-
A
solution\0300-0399\0306.Additive Number\Solution.py
8
1
-
A
solution\2100-2199\2115.Find All Possible Recipes from Given Supplies\Solution.java
8
1
-
A
solution\0700-0799\0708.Insert into a Sorted Circular Linked List\Solution.cpp
8
1
-
A
solution\0900-0999\0929.Unique Email Addresses\Solution.js
8
1
-
A
solution\0300-0399\0348.Design Tic-Tac-Toe\Solution.java
8
1
1
A
solution\0900-0999\0927.Three Equal Parts\Solution.js
8
1
1
A
solution\2300-2399\2360.Longest Cycle in a Graph\Solution.py
8
1
-
A
solution\0300-0399\0393.UTF-8 Validation\Solution.java
8
1
-
A
solution\2000-2099\2086.Minimum Number of Food Buckets to Feed the Hamsters\Solution.cpp
8
1
-
A
solution\0300-0399\0393.UTF-8 Validation\Solution.py
8
1
-
A
solution\0400-0499\0490.The Maze\Solution.py
8
1
-
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.cpp
8
1
-
A
solution\2300-2399\2355.Maximum Number of Books You Can Take\Solution.py
8
1
-
B
solution\2000-2099\2065.Maximum Path Quality of a Graph\Solution.ts
8
1
11
A
solution\2300-2399\2355.Maximum Number of Books You Can Take\Solution.java
8
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!