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\0900-0999\0908.Smallest Range I\Solution.cpp
1
1
-
A
solution\2400-2499\2463.Minimum Total Distance Traveled\Solution.py
1
1
-
A
solution\0400-0499\0429.N-ary Tree Level Order Traversal\Solution.go
1
-
A
solution\2400-2499\2464.Minimum Subarrays in a Valid Split\Solution.go
1
-
A
solution\0900-0999\0908.Smallest Range I\Solution.java
2
1
-
A
solution\2400-2499\2464.Minimum Subarrays in a Valid Split\Solution.py
2
1
-
A
solution\0600-0699\0651.4 Keys Keyboard\Solution.py
3
1
-
A
solution\2600-2699\2654.Minimum Number of Operations to Make All Array Elements Equal to 1\Solution.go
1
-
A
solution\2600-2699\2654.Minimum Number of Operations to Make All Array Elements Equal to 1\Solution.cpp
8
1
-
A
solution\2500-2599\2566.Maximum Difference by Remapping a Digit\Solution.cpp
7
1
-
A
solution\2500-2599\2537.Count the Number of Good Subarrays\Solution.cpp
4
1
-
A
solution\2500-2599\2517.Maximum Tastiness of Candy Basket\Solution.java
6
1
-
A
solution\2500-2599\2510.Check if There is a Path With Equal Number of 0's And 1's\Solution.cpp
9
1
-
A
solution\2500-2599\2505.Bitwise OR of All Subsequence Sums\Solution.py
6
1
-
A
solution\2500-2599\2502.Design Memory Allocator\Solution.py
6
1
-
A
solution\2400-2499\2486.Append Characters to String to Make Subsequence\Solution.py
5
1
-
A
solution\2400-2499\2475.Number of Unequal Triplets in Array\Solution.java
3
1
-
A
solution\0300-0399\0371.Sum of Two Integers\Solution.cpp
2
1
-
A
solution\0800-0899\0893.Groups of Special-Equivalent Strings\Solution.cpp
5
1
-
A
solution\2400-2499\2437.Number of Valid Clock Times\Solution.go
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!