main
leetcode-dart
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0873.Length of Longest Fibonacci Subsequence\Solution.js
6 1 -
A
solution\0800-0899\0879.Profitable Schemes\Solution.java
6 1 -
A
solution\0400-0499\0442.Find All Duplicates in an Array\Solution.java
6 1 -
A
solution\2300-2399\2392.Build a Matrix With Conditions\Solution.py
6 1 -
A
solution\0400-0499\0443.String Compression\Solution.cpp
6 1 -
A
solution\0500-0599\0592.Fraction Addition and Subtraction\Solution.py
6 1 -
A
solution\0400-0499\0443.String Compression\Solution.java
6 1 -
A
solution\0400-0499\0443.String Compression\Solution.py
6 1 -
A
solution\2000-2099\2039.The Time When the Network Becomes Idle\Solution.java
6 1 -
A
solution\0500-0599\0599.Minimum Index Sum of Two Lists\Solution.cpp
6 1 -
A
solution\2300-2399\2389.Longest Subsequence With Limited Sum\Solution.java
6 1 -
A
solution\2000-2099\2039.The Time When the Network Becomes Idle\Solution.py
6 1 -
A
solution\0500-0599\0599.Minimum Index Sum of Two Lists\Solution.java
6 1 -
A
solution\2300-2399\2386.Find the K-Sum of an Array\Solution.py
6 1 -
A
solution\2000-2099\2038.Remove Colored Pieces if Both Neighbors are the Same Color\Solution.java
6 1 -
A
solution\2000-2099\2039.The Time When the Network Becomes Idle\Solution.cpp
6 1 -
A
solution\2300-2399\2386.Find the K-Sum of an Array\Solution.java
6 1 -
A
solution\0300-0399\0379.Design Phone Directory\Solution.java
6 1 1
A
solution\2400-2499\2403.Minimum Time to Kill All Monsters\Solution.cpp
6 1 -
A
solution\0300-0399\0379.Design Phone Directory\Solution.py
6 1 -