main
leetcode-umka
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0700-0799\0771.Jewels and Stones\Solution.c
4 1 -
A
solution\0400-0499\0447.Number of Boomerangs\Solution.java
4 1 -
A
solution\0400-0499\0423.Reconstruct Original Digits from English\Solution.java
4 1 -
A
solution\2400-2499\2443.Sum of Number and Its Reverse\Solution.java
4 1 -
A
solution\2200-2299\2293.Min Max Game\Solution.ts
4 1 1
A
solution\0400-0499\0447.Number of Boomerangs\Solution.py
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.c
4 1 -
A
solution\2200-2299\2294.Partition Array Such That Maximum Difference Is K\Solution.ts
4 1 1
A
solution\0400-0499\0401.Binary Watch\Solution.py
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.cpp
4 1 -
A
solution\0700-0799\0776.Split BST\Solution.java
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.java
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.py
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.ts
4 1 1
A
solution\2100-2199\2114.Maximum Number of Words Found in Sentences\Solution.ts
4 1 1
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.cpp
4 1 -
A
solution\2400-2499\2429.Minimize XOR\Solution.ts
4 1 2
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.java
4 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.py
4 1 -
A
solution\2000-2099\2042.Check if Numbers Are Ascending in a Sentence\Solution.py
4 1 -