Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode
1,317
issues
0
pull requests
4,781
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.ts
8
1
5
A
solution\2000-2099\2058.Find the Minimum and Maximum Number of Nodes Between Critical Points\Solution.py
6
1
-
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.go
1
-
A
solution\2000-2099\2058.Find the Minimum and Maximum Number of Nodes Between Critical Points\Solution.cpp
7
1
-
A
solution\2000-2099\2057.Smallest Index With Equal Value\Solution.ts
3
1
1
A
solution\2000-2099\2053.Kth Distinct String in an Array\Solution.py
4
1
-
A
solution\2000-2099\2053.Kth Distinct String in an Array\Solution.java
5
1
-
A
solution\2000-2099\2053.Kth Distinct String in an Array\Solution.go
1
-
A
solution\2000-2099\2053.Kth Distinct String in an Array\Solution.cpp
5
1
-
A
solution\2000-2099\2049.Count Nodes With the Highest Score\Solution.ts
9
1
5
A
solution\2000-2099\2049.Count Nodes With the Highest Score\Solution.py
3
1
-
A
solution\2000-2099\2049.Count Nodes With the Highest Score\Solution.java
8
1
-
A
solution\2000-2099\2048.Next Greater Numerically Balanced Number\Solution.ts
8
1
2
A
solution\2000-2099\2048.Next Greater Numerically Balanced Number\Solution.py
3
1
-
A
solution\2000-2099\2048.Next Greater Numerically Balanced Number\Solution.java
7
1
-
A
solution\2000-2099\2048.Next Greater Numerically Balanced Number\Solution.go
1
-
A
solution\2000-2099\2048.Next Greater Numerically Balanced Number\Solution.cpp
7
1
-
A
solution\2000-2099\2047.Number of Valid Words in a Sentence\Solution.ts
12
1
6
A
solution\2000-2099\2047.Number of Valid Words in a Sentence\Solution.py
2
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!