main
leetcode-fortran
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0483.Smallest Good Base\Solution.py
5 1 1
A
solution\0900-0999\0981.Time Based Key-Value Store\Solution.java
5 1 1
A
solution\0600-0699\0666.Path Sum IV\Solution.py
2 1 1
A
solution\0300-0399\0346.Moving Average from Data Stream\Solution.java
2 1 1
A
solution\0400-0499\0487.Max Consecutive Ones II\Solution.py
5 1 1
A
solution\1000-1099\1000.Minimum Cost to Merge Stones\Solution.py
9 1 1
A
solution\1000-1099\1004.Max Consecutive Ones III\Solution.py
5 1 1
A
solution\1000-1099\1004.Max Consecutive Ones III\Solution.ts
5 1 1
A
solution\1000-1099\1007.Minimum Domino Rotations For Equal Row\Solution.py
20 1 1
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.ts
7 1 1
A
solution\0600-0699\0676.Implement Magic Dictionary\Solution.java
11 1 1
A
solution\1000-1099\1011.Capacity To Ship Packages Within D Days\Solution.ts
7 1 1
A
solution\1000-1099\1012.Numbers With Repeated Digits\Solution.ts
19 1 1
A
solution\0400-0499\0493.Reverse Pairs\Solution.java
10 1 1
A
solution\1000-1099\1014.Best Sightseeing Pair\Solution.ts
2 1 1
A
solution\1000-1099\1015.Smallest Integer Divisible by K\Solution.ts
3 1 1
A
solution\1000-1099\1017.Convert to Base -2\Solution.ts
4 1 1
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.js
6 1 1
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.ts
6 1 1
A
solution\2000-2099\2024.Maximize the Confusion of an Exam\Solution.py
1 1 1