main
leetcode-free-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2000-2099\2042.Check if Numbers Are Ascending in a Sentence\Solution.c
8 1 -
A
solution\0600-0699\0689.Maximum Sum of 3 Non-Overlapping Subarrays\Solution.java
6 1 -
A
solution\2000-2099\2042.Check if Numbers Are Ascending in a Sentence\Solution.go
 1 -
A
solution\0400-0499\0485.Max Consecutive Ones\Solution.go
 1 -
A
solution\0800-0899\0873.Length of Longest Fibonacci Subsequence\Solution.java
8 1 -
A
solution\0600-0699\0690.Employee Importance\Solution.java
4 1 -
A
solution\0300-0399\0335.Self Crossing\Solution.py
12 1 -
A
solution\0300-0399\0322.Coin Change\Solution.js
3 1 -
A
solution\0300-0399\0364.Nested List Weight Sum II\Solution.py
1 1 -
A
solution\0400-0499\0433.Minimum Genetic Mutation\Solution.py
6 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.cpp
4 1 -
A
solution\0800-0899\0873.Length of Longest Fibonacci Subsequence\Solution.js
6 1 -
A
solution\0800-0899\0873.Length of Longest Fibonacci Subsequence\Solution.py
9 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.go
 1 -
A
solution\0800-0899\0874.Walking Robot Simulation\Solution.cpp
8 1 -
A
solution\0800-0899\0874.Walking Robot Simulation\Solution.go
 1 -
A
solution\0400-0499\0433.Minimum Genetic Mutation\Solution.ts
7 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.java
4 1 -
A
solution\0800-0899\0874.Walking Robot Simulation\Solution.java
7 1 -
A
solution\0800-0899\0874.Walking Robot Simulation\Solution.py
7 1 -