main
leetcode-free-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0900-0999\0950.Reveal Cards In Increasing Order\Solution.cpp
3 1 -
A
solution\0600-0699\0650.2 Keys Keyboard\Solution.cpp
6 1 -
A
solution\0900-0999\0950.Reveal Cards In Increasing Order\Solution.java
4 1 -
A
solution\0400-0499\0456.132 Pattern\Solution.cpp
5 1 -
A
solution\0900-0999\0951.Flip Equivalent Binary Trees\Solution.cpp
8 1 -
A
solution\0600-0699\0650.2 Keys Keyboard\Solution.py
1 1 -
A
solution\0900-0999\0951.Flip Equivalent Binary Trees\Solution.java
11 1 -
A
solution\0300-0399\0328.Odd Even Linked List\Solution.cpp
4 1 -
A
solution\0800-0899\0870.Advantage Shuffle\Solution.py
4 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\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 -