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\2200-2299\2260.Minimum Consecutive Cards to Pick Up\Solution.ts
4
1
1
A
solution\2200-2299\2269.Find the K-Beauty of a Number\Solution.ts
4
1
1
A
solution\0500-0599\0503.Next Greater Element II\Solution.js
4
1
1
A
solution\0500-0599\0503.Next Greater Element II\Solution.ts
4
1
1
A
solution\2200-2299\2245.Maximum Trailing Zeros in a Cornered Path\Solution.ts
11
1
1
A
solution\0600-0699\0629.K Inverse Pairs Array\Solution.ts
4
1
1
A
solution\0400-0499\0487.Max Consecutive Ones II\Solution.py
5
1
1
A
solution\2200-2299\2235.Add Two Integers\Solution.ts
1
1
1
A
solution\2200-2299\2236.Root Equals Sum of Children\Solution.ts
1
1
1
A
solution\0600-0699\0623.Add One Row to Tree\Solution.ts
7
1
1
A
solution\0600-0699\0628.Maximum Product of Three Numbers\Solution.ts
7
1
1
A
solution\0600-0699\0622.Design Circular Queue\Solution.ts
11
1
1
A
solution\0600-0699\0621.Task Scheduler\Solution.cs
5
1
1
A
solution\0600-0699\0617.Merge Two Binary Trees\Solution.js
3
1
1
A
solution\0600-0699\0636.Exclusive Time of Functions\Solution.ts
5
1
1
A
solution\0600-0699\0622.Design Circular Queue\Solution.java
11
1
1
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.ts
8
1
1
A
solution\0300-0399\0392.Is Subsequence\Solution.ts
4
1
1
A
solution\0600-0699\0606.Construct String from Binary Tree\Solution.ts
6
1
1
A
solution\0600-0699\0600.Non-negative Integers without Consecutive Ones\Solution.py
2
1
1
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!