main
leetcode-umka
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2215.Find the Difference of Two Arrays\Solution.js
3 1 1
A
solution\2200-2299\2245.Maximum Trailing Zeros in a Cornered Path\Solution.ts
11 1 1
A
solution\2100-2199\2179.Count Good Triplets in an Array\Solution.java
9 1 1
A
solution\2100-2199\2180.Count Integers With Even Digit Sum\Solution.ts
2 1 1
A
solution\0600-0699\0658.Find K Closest Elements\Solution.ts
3 1 1
A
solution\0600-0699\0661.Image Smoother\Solution.ts
6 1 1
A
solution\0500-0599\0525.Contiguous Array\Solution.js
4 1 1
A
solution\2100-2199\2185.Counting Words With a Given Prefix\Solution.ts
3 1 1
A
solution\0600-0699\0665.Non-decreasing Array\Solution.ts
7 1 1
A
solution\0600-0699\0656.Coin Path\Solution.ts
8 1 1
A
solution\0400-0499\0461.Hamming Distance\Solution.ts
2 1 1
A
solution\0600-0699\0653.Two Sum IV - Input is a BST\Solution.ts
5 1 1
A
solution\0600-0699\0654.Maximum Binary Tree\Solution.ts
4 1 1
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.ts
5 1 1
A
solution\0600-0699\0666.Path Sum IV\Solution.py
2 1 1
A
solution\0600-0699\0655.Print Binary Tree\Solution.ts
6 1 1
A
solution\0600-0699\0647.Palindromic Substrings\Solution.js
5 1 1
A
solution\0500-0599\0526.Beautiful Arrangement\Solution.ts
10 1 1
A
solution\0600-0699\0641.Design Circular Deque\Solution.java
16 1 1
A
solution\0600-0699\0641.Design Circular Deque\Solution.ts
20 1 1