main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0444.Sequence Reconstruction\Solution.cpp
9 1 -
A
solution\0600-0699\0632.Smallest Range Covering Elements from K Lists\Solution.py
9 1 -
A
solution\0900-0999\0909.Snakes and Ladders\Solution.cpp
9 1 -
A
solution\0900-0999\0909.Snakes and Ladders\Solution.java
9 1 -
A
solution\2500-2599\2596.Check Knight Tour Configuration\Solution.java
9 1 -
A
solution\0300-0399\0381.Insert Delete GetRandom O(1) - Duplicates allowed\Solution.py
9 1 1
A
solution\0900-0999\0916.Word Subsets\Solution.cpp
9 1 -
A
solution\0900-0999\0916.Word Subsets\Solution.java
9 1 -
A
solution\2500-2599\2596.Check Knight Tour Configuration\Solution.py
9 1 -
A
solution\2500-2599\2556.Disconnect Path in a Binary Matrix by at Most One Flip\Solution.java
9 1 -
A
solution\2500-2599\2528.Maximize the Minimum Powered City\Solution.cpp
9 1 -
A
solution\0300-0399\0315.Count of Smaller Numbers After Self\Solution.cpp
9 1 1
A
solution\0900-0999\0925.Long Pressed Name\Solution.cpp
9 1 -
A
solution\0400-0499\0457.Circular Array Loop\Solution.cpp
9 1 -
A
solution\0900-0999\0927.Three Equal Parts\Solution.cpp
9 1 -
A
solution\2500-2599\2593.Find Score of an Array After Marking All Elements\Solution.java
9 1 -
A
solution\2400-2499\2464.Minimum Subarrays in a Valid Split\Solution.java
9 1 -
A
solution\0400-0499\0457.Circular Array Loop\Solution.java
9 1 -
A
solution\0300-0399\0315.Count of Smaller Numbers After Self\Solution.py
9 1 -
A
solution\2500-2599\2512.Reward Top K Students\Solution.java
9 1 -