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\0600-0699\0609.Find Duplicate File in System\Solution.py
5
1
-
A
solution\2000-2099\2075.Decode the Slanted Ciphertext\Solution.cpp
5
1
-
A
solution\0400-0499\0442.Find All Duplicates in an Array\Solution.cpp
5
1
-
A
solution\2000-2099\2074.Reverse Nodes in Even Length Groups\Solution.ts
5
1
4
A
solution\0400-0499\0442.Find All Duplicates in an Array\Solution.py
5
1
-
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.cpp
5
1
-
A
solution\2300-2399\2349.Design a Number Container System\Solution.py
5
1
-
A
solution\2000-2099\2073.Time Needed to Buy Tickets\Solution.ts
5
1
4
A
solution\0300-0399\0324.Wiggle Sort II\Solution.js
5
1
-
A
solution\0200-0299\0299.Bulls and Cows\Solution.cpp
5
1
-
A
solution\0800-0899\0893.Groups of Special-Equivalent Strings\Solution.cpp
5
1
-
A
solution\0600-0699\0623.Add One Row to Tree\Solution.cpp
5
1
-
A
solution\0600-0699\0623.Add One Row to Tree\Solution.java
5
1
-
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.py
5
1
-
A
solution\2300-2399\2331.Evaluate Boolean Binary Tree\Solution.py
5
1
1
A
solution\2000-2099\2068.Check Whether Two Strings are Almost Equivalent\Solution.java
5
1
-
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.cpp
5
1
-
A
solution\2300-2399\2327.Number of People Aware of a Secret\Solution.ts
5
1
-
A
solution\2300-2399\2327.Number of People Aware of a Secret\Solution.java
5
1
-
A
solution\0800-0899\0870.Advantage Shuffle\Solution.cpp
5
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!