• Features
  • Pricing
  • Contact
    Login with:
  • Features
  • Pricing
  • Contact
Login with:
main
leetcode-modula
Repository badge with A rating
View on GitHub

  • 407 issues
  • 2 pull requests
  • 3,756 files
  • 1 active branch

CodeFactor Rating A

  • {{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0640.Solve the Equation\Solution.ts
17 1 -
A
solution\2400-2499\2498.Frog Jump II\Solution.go
1 -
A
solution\0900-0999\0923.3Sum With Multiplicity\Solution.java
6 1 -
A
solution\2400-2499\2499.Minimum Total Cost to Make Arrays Unequal\Solution.go
1 -
A
solution\0300-0399\0341.Flatten Nested List Iterator\Solution.ts
3 1 -
A
solution\2400-2499\2499.Minimum Total Cost to Make Arrays Unequal\Solution.py
11 1 -
A
solution\0900-0999\0924.Minimize Malware Spread\Solution.go
1 -
A
solution\2500-2599\2500.Delete Greatest Value in Each Row\Solution.go
1 -
A
solution\0600-0699\0641.Design Circular Deque\Solution.go
1 -
A
solution\0700-0799\0702.Search in a Sorted Array of Unknown Size\Solution.go
1 -
A
solution\2000-2099\2043.Simple Bank System\Solution.cpp
10 1 -
A
solution\0500-0599\0500.Keyboard Row\Solution.cpp
5 1 -
A
solution\0700-0799\0702.Search in a Sorted Array of Unknown Size\Solution.py
4 1 -
A
solution\2000-2099\2043.Simple Bank System\Solution.go
1 -
A
solution\0700-0799\0703.Kth Largest Element in a Stream\Solution.go
1 -
A
solution\2000-2099\2043.Simple Bank System\Solution.py
10 1 -
A
solution\0400-0499\0403.Frog Jump\Solution.java
8 1 -
A
solution\0500-0599\0500.Keyboard Row\Solution.cs
4 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.cpp
5 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.go
1 -
  • Previous Page
  • Next Page
  • Security
  • Terms
  • Privacy
  • Contact
© 2026 CodeFactor

We use cookies in order to offer you the most relevant information. See our Privacy Policy.