Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-simula
1,196
issues
4,998
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0680.Valid Palindrome II\Solution.js
7
1
1
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.ts
6
1
1
A
solution\0600-0699\0665.Non-decreasing Array\Solution.ts
7
1
1
A
solution\0300-0399\0379.Design Phone Directory\Solution.java
6
1
1
A
solution\0600-0699\0654.Maximum Binary Tree\Solution.ts
4
1
1
A
solution\0600-0699\0655.Print Binary Tree\Solution.ts
6
1
1
A
solution\0600-0699\0653.Two Sum IV - Input is a BST\Solution.ts
5
1
1
A
solution\0600-0699\0656.Coin Path\Solution.ts
8
1
1
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.ts
5
1
1
A
solution\0400-0499\0475.Heaters\Solution.ts
6
1
1
A
solution\0600-0699\0646.Maximum Length of Pair Chain\Solution.ts
4
1
1
A
solution\0600-0699\0647.Palindromic Substrings\Solution.js
5
1
1
A
solution\0600-0699\0641.Design Circular Deque\Solution.ts
20
1
1
A
solution\0600-0699\0636.Exclusive Time of Functions\Solution.ts
5
1
1
A
solution\0600-0699\0637.Average of Levels in Binary Tree\Solution.js
5
1
1
A
solution\0400-0499\0415.Add Strings\Solution.ts
7
1
1
A
solution\0600-0699\0640.Solve the Equation\Solution.ts
15
1
1
A
solution\0600-0699\0629.K Inverse Pairs Array\Solution.ts
4
1
1
A
solution\0600-0699\0622.Design Circular Queue\Solution.ts
11
1
1
A
solution\0600-0699\0623.Add One Row to Tree\Solution.ts
7
1
1
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!