main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2500-2599\2514.Count Anagrams\Solution.py
3 1 -
A
solution\2200-2299\2294.Partition Array Such That Maximum Difference Is K\Solution.py
3 1 -
A
solution\2500-2599\2517.Maximum Tastiness of Candy Basket\Solution.py
3 1 -
A
solution\0700-0799\0769.Max Chunks To Make Sorted\Solution.py
3 1 -
A
solution\0700-0799\0771.Jewels and Stones\Solution.cpp
3 1 -
A
solution\0700-0799\0771.Jewels and Stones\Solution.java
3 1 -
A
solution\2200-2299\2266.Count Number of Texts\Solution.py
3 1 -
A
solution\0700-0799\0775.Global and Local Inversions\Solution.py
3 1 -
A
solution\0700-0799\0776.Split BST\Solution.js
3 1 -
A
solution\2200-2299\2264.Largest 3-Same-Digit Number in String\Solution.py
3 1 -
A
solution\0500-0599\0530.Minimum Absolute Difference in BST\Solution.cpp
3 1 -
A
solution\2400-2499\2448.Minimum Cost to Make Array Equal\Solution.py
3 1 1
A
solution\2200-2299\2264.Largest 3-Same-Digit Number in String\Solution.cpp
3 1 -
A
solution\0500-0599\0530.Minimum Absolute Difference in BST\Solution.java
3 1 -
A
solution\0400-0499\0413.Arithmetic Slices\Solution.java
3 1 -
A
solution\0700-0799\0781.Rabbits in Forest\Solution.java
3 1 -
A
solution\0400-0499\0413.Arithmetic Slices\Solution.ts
3 1 -
A
solution\0700-0799\0783.Minimum Distance Between BST Nodes\Solution.cpp
3 1 -
A
solution\2400-2499\2447.Number of Subarrays With GCD Equal to K\Solution.cpp
3 1 -
A
solution\0700-0799\0783.Minimum Distance Between BST Nodes\Solution.java
3 1 -