Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-simula
1,196
issues
4,998
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0500-0599\0582.Kill Process\Solution.java
4
1
-
A
solution\2200-2299\2258.Escape the Spreading Fire\Solution.py
4
1
-
A
solution\2400-2499\2457.Minimum Addition to Make Integer Beautiful\Solution.cpp
4
1
-
A
solution\2200-2299\2260.Minimum Consecutive Cards to Pick Up\Solution.cpp
4
1
-
A
solution\2100-2199\2169.Count Operations to Obtain Zero\Solution.java
4
1
-
A
solution\0800-0899\0806.Number of Lines To Write String\Solution.cpp
4
1
-
A
solution\2200-2299\2256.Minimum Average Difference\Solution.py
4
1
-
A
solution\2100-2199\2169.Count Operations to Obtain Zero\Solution.cpp
4
1
-
A
solution\2300-2399\2327.Number of People Aware of a Secret\Solution.py
4
1
-
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.c
4
1
-
A
solution\0800-0899\0812.Largest Triangle Area\Solution.cpp
4
1
-
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.cpp
4
1
-
A
solution\0800-0899\0812.Largest Triangle Area\Solution.java
4
1
-
A
solution\2100-2199\2169.Count Operations to Obtain Zero\Solution.py
4
1
-
A
solution\0800-0899\0812.Largest Triangle Area\Solution.py
4
1
-
A
solution\2400-2499\2448.Minimum Cost to Make Array Equal\Solution.java
4
1
-
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.java
4
1
-
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.py
4
1
-
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.ts
4
1
1
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.cpp
4
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!