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\0600-0699\0689.Maximum Sum of 3 Non-Overlapping Subarrays\Solution.py
6
1
-
A
solution\2600-2699\2615.Sum of Distances\Solution.java
6
1
-
A
solution\2600-2699\2616.Minimize the Maximum Difference of Pairs\Solution.cpp
6
1
-
A
solution\0400-0499\0400.Nth Digit\Solution.go
1
-
A
solution\2600-2699\2616.Minimize the Maximum Difference of Pairs\Solution.java
6
1
-
A
solution\0900-0999\0991.Broken Calculator\Solution.go
1
-
A
solution\2600-2699\2617.Minimum Number of Visited Cells in a Grid\Solution.cpp
14
1
-
A
solution\2400-2499\2432.The Employee That Worked on the Longest Task\Solution.cpp
5
1
-
A
solution\0800-0899\0890.Find and Replace Pattern\Solution.cpp
5
1
-
A
solution\2400-2499\2432.The Employee That Worked on the Longest Task\Solution.go
1
-
A
solution\2400-2499\2432.The Employee That Worked on the Longest Task\Solution.java
5
1
-
A
solution\0400-0499\0495.Teemo Attacking\Solution.cpp
2
1
-
A
solution\0600-0699\0641.Design Circular Deque\Solution.cpp
16
1
-
A
solution\0800-0899\0890.Find and Replace Pattern\Solution.go
1
-
A
solution\2400-2499\2432.The Employee That Worked on the Longest Task\Solution.py
5
1
-
A
solution\0800-0899\0890.Find and Replace Pattern\Solution.java
6
1
-
A
solution\2400-2499\2433.Find The Original Array of Prefix Xor\Solution.c
2
1
-
A
solution\2400-2499\2433.Find The Original Array of Prefix Xor\Solution.cpp
2
1
-
A
solution\0600-0699\0641.Design Circular Deque\Solution.go
1
-
A
solution\0800-0899\0890.Find and Replace Pattern\Solution.py
3
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!