main
leetcode-chez
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2100-2199\2195.Append K Integers With Minimal Sum\Solution.go
 1 -
A
solution\0700-0799\0782.Transform to Chessboard\Solution.go
 1 -
A
solution\2100-2199\2195.Append K Integers With Minimal Sum\Solution.py
4 1 -
A
solution\0500-0599\0542.01 Matrix\Solution.py
10 1 -
A
solution\2100-2199\2196.Create Binary Tree From Descriptions\Solution.go
 1 -
A
solution\0700-0799\0782.Transform to Chessboard\Solution.py
8 1 -
A
solution\2100-2199\2196.Create Binary Tree From Descriptions\Solution.py
7 1 -
A
solution\0400-0499\0421.Maximum XOR of Two Numbers in an Array\Solution.go
 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.cpp
0 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.c
5 1 -
A
solution\2200-2299\2248.Intersection of Multiple Arrays\Solution.ts
4 1 -
A
solution\2200-2299\2231.Largest Number After Digit Swaps by Parity\Solution.ts
5 1 -
A
solution\2200-2299\2226.Maximum Candies Allocated to K Children\Solution.java
4 1 -
A
solution\2200-2299\2222.Number of Ways to Select Buildings\Solution.py
3 1 -
A
solution\2200-2299\2217.Find Palindrome With Fixed Length\Solution.java
3 1 -
A
solution\2200-2299\2216.Minimum Deletions to Make Array Beautiful\Solution.py
4 1 -
A
solution\2200-2299\2200.Find All K-Distant Indices in an Array\Solution.ts
5 1 -
A
solution\0300-0399\0349.Intersection of Two Arrays\Solution.cpp
5 1 -
A
solution\0400-0499\0498.Diagonal Traverse\Solution.go
 1 -
A
solution\2000-2099\2021.Brightest Position on Street\Solution.js
 1 -