main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2343.Query Kth Smallest Trimmed Number\Solution.java
4 1 -
A
solution\0700-0799\0791.Custom Sort String\Solution.ts
4 1 -
A
solution\2400-2499\2443.Sum of Number and Its Reverse\Solution.cpp
4 1 -
A
solution\0500-0599\0539.Minimum Time Difference\Solution.cpp
4 1 -
A
solution\2400-2499\2443.Sum of Number and Its Reverse\Solution.c
4 1 -
A
solution\0400-0499\0416.Partition Equal Subset Sum\Solution.cpp
4 1 -
A
solution\0500-0599\0539.Minimum Time Difference\Solution.java
4 1 -
A
solution\2400-2499\2443.Sum of Number and Its Reverse\Solution.java
4 1 -
A
solution\2300-2399\2342.Max Sum of a Pair With Equal Sum of Digits\Solution.java
4 1 -
A
solution\0500-0599\0539.Minimum Time Difference\Solution.py
4 1 -
A
solution\2000-2099\2099.Find Subsequence of Length K With the Largest Sum\Solution.java
4 1 -
A
solution\2300-2399\2342.Max Sum of a Pair With Equal Sum of Digits\Solution.py
4 1 -
A
solution\2100-2199\2109.Adding Spaces to a String\Solution.java
4 1 -
A
solution\0500-0599\0540.Single Element in a Sorted Array\Solution.c
4 1 -
A
solution\0500-0599\0540.Single Element in a Sorted Array\Solution.cpp
4 1 -
A
solution\2200-2299\2273.Find Resultant Array After Removing Anagrams\Solution.py
4 1 -
A
solution\0700-0799\0795.Number of Subarrays with Bounded Maximum\Solution.java
4 1 -
A
solution\2400-2499\2442.Count Number of Distinct Integers After Reverse Operations\Solution.java
4 1 -
A
solution\0700-0799\0797.All Paths From Source to Target\Solution.cpp
4 1 -
A
solution\0700-0799\0797.All Paths From Source to Target\Solution.java
4 1 -