Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-umka
1,187
issues
4,998
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\1000-1099\1017.Convert to Base -2\Solution.ts
4
1
1
A
solution\0600-0699\0654.Maximum Binary Tree\Solution.ts
4
1
1
A
solution\0400-0499\0462.Minimum Moves to Equal Array Elements II\Solution.ts
3
1
1
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.ts
4
1
1
A
solution\1000-1099\1012.Numbers With Repeated Digits\Solution.ts
19
1
1
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.ts
7
1
1
A
solution\1000-1099\1014.Best Sightseeing Pair\Solution.ts
2
1
1
A
solution\1000-1099\1004.Max Consecutive Ones III\Solution.py
5
1
1
A
solution\1000-1099\1004.Max Consecutive Ones III\Solution.ts
5
1
1
A
solution\0600-0699\0683.K Empty Slots\Solution.java
14
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\0652.Find Duplicate Subtrees\Solution.ts
5
1
1
A
solution\0600-0699\0641.Design Circular Deque\Solution.ts
20
1
1
A
solution\0600-0699\0640.Solve the Equation\Solution.ts
15
1
1
A
solution\0600-0699\0641.Design Circular Deque\Solution.java
16
1
1
A
solution\0600-0699\0637.Average of Levels in Binary Tree\Solution.js
5
1
1
A
solution\0600-0699\0629.K Inverse Pairs Array\Solution.ts
4
1
1
A
solution\0600-0699\0646.Maximum Length of Pair Chain\Solution.ts
4
1
1
A
solution\0600-0699\0636.Exclusive Time of Functions\Solution.ts
5
1
1
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!