main
leetcode-crystal
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0402.Remove K Digits\Solution.py
6 1 -
A
solution\0700-0799\0753.Cracking the Safe\Solution.java
4 1 -
A
solution\0500-0599\0516.Longest Palindromic Subsequence\Solution.go
 1 -
A
solution\0700-0799\0754.Reach a Number\Solution.go
 1 -
A
solution\0300-0399\0322.Coin Change\Solution.java
4 1 -
A
solution\0700-0799\0754.Reach a Number\Solution.py
4 1 -
A
solution\0500-0599\0516.Longest Palindromic Subsequence\Solution.py
6 1 -
A
solution\0700-0799\0755.Pour Water\Solution.go
 1 -
A
solution\0400-0499\0403.Frog Jump\Solution.java
8 1 -
A
solution\0300-0399\0325.Maximum Size Subarray Sum Equals k\Solution.java
4 1 -
A
solution\0300-0399\0360.Sort Transformed Array\Solution.cpp
10 1 -
A
solution\0400-0499\0421.Maximum XOR of Two Numbers in an Array\Solution.cpp
10 1 -
A
solution\0500-0599\0552.Student Attendance Record II\Solution.py
5 1 -
A
solution\0500-0599\0553.Optimal Division\Solution.go
 1 -
A
solution\0400-0499\0421.Maximum XOR of Two Numbers in an Array\Solution.go
 1 -
A
solution\0500-0599\0553.Optimal Division\Solution.java
4 1 -
A
solution\0500-0599\0553.Optimal Division\Solution.py
3 1 -
A
solution\0300-0399\0360.Sort Transformed Array\Solution.go
 1 -
A
solution\0400-0499\0421.Maximum XOR of Two Numbers in an Array\Solution.java
5 1 -
A
solution\0500-0599\0553.Optimal Division\Solution.ts
1 1 -