Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-free-basic
400
issues
2
pull requests
4,688
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0900-0999\0968.Binary Tree Cameras\Solution.java
8
1
-
A
solution\0600-0699\0657.Robot Return to Origin\Solution.py
7
1
-
A
solution\0900-0999\0969.Pancake Sorting\Solution.cpp
6
1
-
A
solution\0300-0399\0376.Wiggle Subsequence\Solution.ts
3
1
-
A
solution\0400-0499\0433.Minimum Genetic Mutation\Solution.cpp
7
1
-
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.c
4
1
-
A
solution\0800-0899\0870.Advantage Shuffle\Solution.ts
3
1
-
A
solution\0600-0699\0658.Find K Closest Elements\Solution.cpp
4
1
-
A
solution\0900-0999\0969.Pancake Sorting\Solution.ts
5
1
-
A
solution\0400-0499\0462.Minimum Moves to Equal Array Elements II\Solution.cpp
2
1
-
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.cpp
5
1
-
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.cpp
4
1
-
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.go
1
-
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.java
7
1
-
A
solution\0300-0399\0364.Nested List Weight Sum II\Solution.js
5
1
-
A
solution\0400-0499\0433.Minimum Genetic Mutation\Solution.go
1
-
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.go
1
-
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.py
5
1
-
A
solution\0800-0899\0872.Leaf-Similar Trees\Solution.cpp
4
1
-
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.java
4
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!