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\0400-0499\0483.Smallest Good Base\Solution.py
5
1
1
A
solution\0600-0699\0611.Valid Triangle Number\Solution.ts
5
1
2
A
solution\2400-2499\2440.Create Components With Same Value\Solution.py
5
1
-
A
solution\2200-2299\2259.Remove Digit From Number to Maximize Result\Solution.cpp
5
1
-
A
solution\0800-0899\0849.Maximize Distance to Closest Person\Solution.cpp
5
1
-
A
solution\0800-0899\0849.Maximize Distance to Closest Person\Solution.java
5
1
-
A
solution\0800-0899\0849.Maximize Distance to Closest Person\Solution.py
5
1
-
A
solution\2300-2399\2363.Merge Similar Items\Solution.cpp
5
1
-
A
solution\0600-0699\0617.Merge Two Binary Trees\Solution.ts
5
1
3
A
solution\0600-0699\0621.Task Scheduler\Solution.cs
5
1
1
A
solution\2400-2499\2439.Minimize Maximum of Array\Solution.cpp
5
1
-
A
solution\0800-0899\0856.Score of Parentheses\Solution.cpp
5
1
-
A
solution\0400-0499\0486.Predict the Winner\Solution.cpp
5
1
-
A
solution\0800-0899\0857.Minimum Cost to Hire K Workers\Solution.java
5
1
1
A
solution\0600-0699\0623.Add One Row to Tree\Solution.cpp
5
1
-
A
solution\0600-0699\0623.Add One Row to Tree\Solution.java
5
1
-
A
solution\0400-0499\0487.Max Consecutive Ones II\Solution.cpp
5
1
-
A
solution\2400-2499\2436.Minimum Split Into Subarrays With GCD Greater Than One\Solution.java
5
1
-
A
solution\0400-0499\0487.Max Consecutive Ones II\Solution.java
5
1
-
A
solution\0400-0499\0421.Maximum XOR of Two Numbers in an Array\Solution.java
5
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!