main
leetcode-c--
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0396.Rotate Function\Solution.go
 1 -
A
solution\0600-0699\0665.Non-decreasing Array\Solution.py
4 1 -
A
solution\0400-0499\0491.Non-decreasing Subsequences\Solution.go
 1 -
A
solution\0600-0699\0666.Path Sum IV\Solution.cpp
0 1 -
A
solution\0300-0399\0355.Design Twitter\Solution.py
7 1 -
A
solution\0600-0699\0666.Path Sum IV\Solution.java
6 1 -
A
solution\0300-0399\0396.Rotate Function\Solution.py
3 1 -
A
solution\0600-0699\0667.Beautiful Arrangement II\Solution.cpp
0 1 -
A
solution\0300-0399\0356.Line Reflection\Solution.java
4 1 -
A
solution\0600-0699\0681.Next Closest Time\Solution.py
5 1 -
A
solution\0600-0699\0681.Next Closest Time\Solution.java
15 1 -
A
solution\0600-0699\0674.Longest Continuous Increasing Subsequence\Solution.py
3 1 -
A
solution\0600-0699\0673.Number of Longest Increasing Subsequence\Solution.java
8 1 -
A
solution\0600-0699\0670.Maximum Swap\Solution.ts
6 1 -
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.c
4 1 -
A
solution\0300-0399\0314.Binary Tree Vertical Order Traversal\Solution.cpp
7 1 -
A
solution\0300-0399\0349.Intersection of Two Arrays\Solution.java
5 1 -
A
solution\0300-0399\0386.Lexicographical Numbers\Solution.cpp
6 1 -
A
solution\0400-0499\0464.Can I Win\Solution.java
8 1 -
A
solution\0600-0699\0625.Minimum Factorization\Solution.java
7 1 -