main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0500-0599\0505.The Maze II\Solution.cpp
10 1 -
A
solution\2100-2199\2162.Minimum Cost to Set Cooking Time\Solution.java
10 1 1
A
solution\2300-2399\2385.Amount of Time for Binary Tree to Be Infected\Solution.java
10 1 -
A
solution\0700-0799\0767.Reorganize String\Solution.java
10 1 -
A
solution\2300-2399\2384.Largest Palindromic Number\Solution.cpp
10 1 -
A
solution\2300-2399\2382.Maximum Segment Sum After Removals\Solution.java
10 1 -
A
solution\0700-0799\0764.Largest Plus Sign\Solution.py
10 1 -
A
solution\2300-2399\2382.Maximum Segment Sum After Removals\Solution.cpp
10 1 -
A
solution\0700-0799\0755.Pour Water\Solution.java
10 1 -
A
solution\2300-2399\2376.Count Special Integers\Solution.cpp
10 1 -
A
solution\2100-2199\2120.Execution of All Suffix Instructions Staying in a Grid\Solution.ts
10 1 1
A
solution\1000-1099\1000.Minimum Cost to Merge Stones\Solution.java
10 1 -
A
solution\0700-0799\0755.Pour Water\Solution.cpp
10 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.java
10 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.ts
10 1 1
A
solution\0600-0699\0604.Design Compressed String Iterator\Solution.java
10 1 2
A
solution\0600-0699\0691.Stickers to Spell Word\Solution.cpp
10 1 -
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.ts
10 1 1
A
solution\0600-0699\0691.Stickers to Spell Word\Solution.java
10 1 -
A
solution\0500-0599\0522.Longest Uncommon Subsequence II\Solution.cpp
10 1 -