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\2000-2099\2058.Find the Minimum and Maximum Number of Nodes Between Critical Points\Solution.java
6
1
-
A
solution\2000-2099\2058.Find the Minimum and Maximum Number of Nodes Between Critical Points\Solution.py
6
1
-
A
solution\0700-0799\0712.Minimum ASCII Delete Sum for Two Strings\Solution.java
6
1
-
A
solution\0700-0799\0716.Max Stack\Solution.cpp
6
1
-
A
solution\2000-2099\2070.Most Beautiful Item for Each Query\Solution.java
6
1
-
A
solution\2400-2499\2437.Number of Valid Clock Times\Solution.java
6
1
-
A
solution\2000-2099\2075.Decode the Slanted Ciphertext\Solution.java
6
1
-
A
solution\2300-2399\2386.Find the K-Sum of an Array\Solution.java
6
1
-
A
solution\0700-0799\0719.Find K-th Smallest Pair Distance\Solution.cpp
6
1
-
A
solution\0700-0799\0719.Find K-th Smallest Pair Distance\Solution.ts
6
1
2
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.cpp
6
1
-
A
solution\2400-2499\2437.Number of Valid Clock Times\Solution.cpp
6
1
-
A
solution\0400-0499\0404.Sum of Left Leaves\Solution.c
6
1
-
A
solution\2000-2099\2085.Count Common Words With One Occurrence\Solution.java
6
1
-
A
solution\2300-2399\2386.Find the K-Sum of an Array\Solution.py
6
1
-
A
solution\0300-0399\0386.Lexicographical Numbers\Solution.cpp
6
1
-
A
solution\2500-2599\2547.Minimum Cost to Split an Array\Solution.cpp
6
1
-
A
solution\0500-0599\0538.Convert BST to Greater Tree\Solution.java
6
1
-
A
solution\0500-0599\0538.Convert BST to Greater Tree\Solution.py
6
1
-
A
solution\0700-0799\0729.My Calendar I\Solution.java
6
1
1
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!