main
leetcode-matlab
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2100-2199\2171.Removing Minimum Number of Magic Beans\Solution.go
 1 -
A
solution\0700-0799\0775.Global and Local Inversions\Solution.go
 1 -
A
solution\2100-2199\2174.Remove All Ones With Row and Column Flips II\Solution.cpp
0 1 -
A
solution\0500-0599\0538.Convert BST to Greater Tree\Solution.cpp
8 1 -
A
solution\2100-2199\2174.Remove All Ones With Row and Column Flips II\Solution.java
13 1 -
A
solution\0700-0799\0776.Split BST\Solution.go
 1 -
A
solution\2100-2199\2176.Count Equal and Divisible Pairs in an Array\Solution.cpp
0 1 -
A
solution\0400-0499\0421.Maximum XOR of Two Numbers in an Array\Solution.cpp
10 1 -
A
solution\2200-2299\2262.Total Appeal of A String\Solution.cpp
2 1 -
A
solution\2200-2299\2261.K Divisible Elements Subarrays\Solution.ts
4 1 -
A
solution\2200-2299\2225.Find Players With Zero or One Losses\Solution.java
4 1 -
A
solution\2200-2299\2212.Maximum Points in an Archery Competition\Solution.go
 1 -
A
solution\2200-2299\2209.Minimum White Tiles After Covering With Carpets\Solution.cpp
6 1 -
A
solution\2200-2299\2202.Maximize the Topmost Element After K Moves\Solution.go
 1 -
A
solution\2200-2299\2200.Find All K-Distant Indices in an Array\Solution.cpp
5 1 -
A
solution\2100-2199\2196.Create Binary Tree From Descriptions\Solution.ts
9 1 -
A
solution\0700-0799\0776.Split BST\Solution.js
3 1 -
A
solution\0400-0499\0402.Remove K Digits\Solution.java
9 1 -
A
solution\0700-0799\0705.Design HashSet\Solution.go
 1 -
A
solution\2000-2099\2029.Stone Game IX\Solution.java
7 1 -