main
leetcode-tcsh
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2000-2099\2033.Minimum Operations to Make a Uni-Value Grid\Solution.go
 1 -
A
solution\0700-0799\0799.Champagne Tower\Solution.go
 1 -
A
solution\0300-0399\0349.Intersection of Two Arrays\Solution.java
5 1 -
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.cpp
7 1 -
A
solution\0700-0799\0799.Champagne Tower\Solution.ts
3 1 -
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.go
 1 -
A
solution\0500-0599\0543.Diameter of Binary Tree\Solution.go
 1 -
A
solution\2300-2399\2319.Check if Matrix Is X-Matrix\Solution.ts
6 1 -
A
solution\0800-0899\0801.Minimum Swaps To Make Sequences Increasing\Solution.go
 1 -
A
solution\0400-0499\0415.Add Strings\Solution.js
13 1 -
A
solution\2000-2099\2033.Minimum Operations to Make a Uni-Value Grid\Solution.java
5 1 -
A
solution\2000-2099\2034.Stock Price Fluctuation\Solution.cpp
7 1 -
A
solution\0400-0499\0482.License Key Formatting\Solution.java
5 1 -
A
solution\0600-0699\0685.Redundant Connection II\Solution.py
11 1 -
A
solution\2000-2099\2034.Stock Price Fluctuation\Solution.go
 1 -
A
solution\2000-2099\2034.Stock Price Fluctuation\Solution.py
8 1 -
A
solution\0600-0699\0686.Repeated String Match\Solution.cpp
4 1 -
A
solution\2000-2099\2035.Partition Array Into Two Arrays to Minimize Sum Difference\Solution.cpp
12 1 -
A
solution\2000-2099\2035.Partition Array Into Two Arrays to Minimize Sum Difference\Solution.go
 1 -
A
solution\0300-0399\0385.Mini Parser\Solution.go
 1 -