main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0864.Shortest Path to Get All Keys\Solution.java
18 1 1
A
solution\0800-0899\0864.Shortest Path to Get All Keys\Solution.py
17 1 1
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.py
4 1 1
A
solution\0300-0399\0307.Range Sum Query - Mutable\Solution.cs
11 1 1
A
solution\0600-0699\0600.Non-negative Integers without Consecutive Ones\Solution.py
2 1 1
A
solution\2400-2499\2448.Minimum Cost to Make Array Equal\Solution.py
3 1 1
A
solution\0600-0699\0616.Add Bold Tag in String\Solution.cpp
17 1 1
A
solution\0600-0699\0616.Add Bold Tag in String\Solution.go
 1 1
A
solution\0600-0699\0616.Add Bold Tag in String\Solution.py
16 1 1
A
solution\0600-0699\0621.Task Scheduler\Solution.cs
3 1 1
A
solution\0400-0499\0447.Number of Boomerangs\Solution.ts
4 1 1
A
solution\0300-0399\0379.Design Phone Directory\Solution.java
6 1 1
A
solution\0600-0699\0622.Design Circular Queue\Solution.java
11 1 1
A
solution\0400-0499\0449.Serialize and Deserialize BST\Solution.java
11 1 1
A
solution\0800-0899\0895.Maximum Frequency Stack\Solution.java
4 1 1
A
solution\0400-0499\0449.Serialize and Deserialize BST\Solution.py
4 1 1
A
solution\2400-2499\2484.Count Palindromic Subsequences\Solution.py
16 1 1
A
solution\0800-0899\0899.Orderly Queue\Solutioin.java
4 1 1
A
solution\2400-2499\2493.Divide Nodes Into the Maximum Number of Groups\Solution.cpp
16 1 1
A
solution\0900-0999\0900.RLE Iterator\Solution.java
4 1 1