main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0500-0599\0539.Minimum Time Difference\Solution.cpp
4 1 -
A
solution\2200-2299\2289.Steps to Make Array Non-decreasing\Solution.java
4 1 -
A
solution\0500-0599\0539.Minimum Time Difference\Solution.java
4 1 -
A
solution\0700-0799\0784.Letter Case Permutation\Solution.java
4 1 -
A
solution\0700-0799\0785.Is Graph Bipartite\Solution.py
4 1 -
A
solution\0700-0799\0786.K-th Smallest Prime Fraction\Solution.cpp
4 1 -
A
solution\0700-0799\0787.Cheapest Flights Within K Stops\Solution.cpp
4 1 -
A
solution\0300-0399\0325.Maximum Size Subarray Sum Equals k\Solution.java
4 1 -
A
solution\0700-0799\0787.Cheapest Flights Within K Stops\Solution.java
4 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.java
4 1 -
A
solution\0400-0499\0423.Reconstruct Original Digits from English\Solution.cpp
4 1 -
A
solution\2200-2299\2287.Rearrange Characters to Make Target String\Solution.ts
4 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.cpp
4 1 -
A
solution\2400-2499\2468.Split Message Based on Limit\Solution.cpp
4 1 -
A
solution\0300-0399\0312.Burst Balloons\Solution.cpp
4 1 -
A
solution\0400-0499\0423.Reconstruct Original Digits from English\Solution.java
4 1 -
A
solution\0700-0799\0791.Custom Sort String\Solution.ts
4 1 -
A
solution\2200-2299\2279.Maximum Bags With Full Capacity of Rocks\Solution.java
4 1 -
A
solution\2400-2499\2458.Height of Binary Tree After Subtree Removal Queries\Solution.cpp
4 1 -
A
solution\0700-0799\0797.All Paths From Source to Target\Solution.cpp
4 1 -