main
leetcode-assembly
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0900-0999\0914.X of a Kind in a Deck of Cards\Solution.py
1 1 -
A
solution\2500-2599\2535.Difference Between Element Sum and Digit Sum of an Array\Solution.ts
1 1 -
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.py
1 1 -
A
solution\0300-0399\0364.Nested List Weight Sum II\Solution.py
1 1 -
A
solution\2500-2599\2529.Maximum Count of Positive Integer and Negative Integer\Solution.py
1 1 -
A
solution\0600-0699\0653.Two Sum IV - Input is a BST\Solution.py
1 1 -
A
solution\2500-2599\2527.Find Xor-Beauty of Array\Solution.py
1 1 -
A
solution\0600-0699\0654.Maximum Binary Tree\Solution.py
1 1 -
A
solution\2500-2599\2513.Minimize the Maximum of Two Arrays\Solution.py
1 1 -
A
solution\0400-0499\0400.Nth Digit\Solution.cs
1 1 1
A
solution\0900-0999\0933.Number of Recent Calls\Solution.cs
1 1 2
A
solution\0900-0999\0933.Number of Recent Calls\Solution.js
1 1 -
A
solution\0900-0999\0933.Number of Recent Calls\Solution.ts
1 1 -
A
solution\0900-0999\0937.Reorder Data in Log Files\Solution.py
1 1 -
A
solution\0900-0999\0938.Range Sum of BST\Solution.py
1 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.ts
1 1 -
A
solution\0400-0499\0489.Robot Room Cleaner\Solution.py
1 1 -
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.py
1 1 -
A
solution\0900-0999\0951.Flip Equivalent Binary Trees\Solution.py
1 1 -
A
solution\0400-0499\0491.Non-decreasing Subsequences\Solution.py
1 1 -