Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-free-basic
402
issues
2
pull requests
4,998
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.cpp
6
1
-
A
solution\2300-2399\2354.Number of Excellent Pairs\Solution.java
6
1
-
A
solution\2300-2399\2349.Design a Number Container System\Solution.java
6
1
1
A
solution\2300-2399\2349.Design a Number Container System\Solution.cpp
6
1
-
A
solution\2300-2399\2345.Finding the Number of Visible Mountains\Solution.java
6
1
-
A
solution\2300-2399\2344.Minimum Deletions to Make Array Divisible\Solution.cpp
6
1
-
A
solution\0400-0499\0496.Next Greater Element I\Solution.cpp
6
1
-
A
solution\0300-0399\0390.Elimination Game\Solution.cpp
6
1
-
A
solution\0500-0599\0501.Find Mode in Binary Search Tree\Solution.cpp
6
1
-
A
solution\0500-0599\0502.IPO\Solution.cpp
6
1
-
A
solution\0700-0799\0712.Minimum ASCII Delete Sum for Two Strings\Solution.ts
6
1
-
A
solution\0500-0599\0502.IPO\Solution.java
6
1
-
A
solution\0500-0599\0502.IPO\Solution.py
6
1
-
A
solution\0700-0799\0748.Shortest Completing Word\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\2054.Two Best Non-Overlapping Events\Solution.java
6
1
-
A
solution\0200-0299\0296.Best Meeting Point\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\0900-0999\0930.Binary Subarrays With Sum\Solution.cpp
6
1
-
A
solution\0300-0399\0341.Flatten Nested List Iterator\Solution.java
6
1
1
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!