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\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.ts
5
1
1
A
solution\2300-2399\2392.Build a Matrix With Conditions\Solution.ts
16
1
1
A
solution\0800-0899\0868.Binary Gap\Solution.ts
4
1
1
A
solution\2300-2399\2393.Count Strictly Increasing Subarrays\Solution.ts
4
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\0629.K Inverse Pairs Array\Solution.ts
4
1
1
A
solution\2300-2399\2395.Find Subarrays With Equal Sum\Solution.ts
3
1
1
A
solution\0800-0899\0870.Advantage Shuffle\Solution.ts
6
1
1
A
solution\2300-2399\2399.Check Distances Between Same Letters\Solution.ts
4
1
1
A
solution\2400-2499\2400.Number of Ways to Reach a Position After Exactly k Steps\Solution.ts
8
1
1
A
solution\2400-2499\2401.Longest Nice Subarray\Solution.ts
3
1
1
A
solution\0800-0899\0873.Length of Longest Fibonacci Subsequence\Solution.js
8
1
1
A
solution\2400-2499\2403.Minimum Time to Kill All Monsters\Solution.ts
9
1
1
A
solution\2400-2499\2404.Most Frequent Even Element\Solution.ts
8
1
1
A
solution\2400-2499\2405.Optimal Partition of String\Solution.ts
3
1
1
A
solution\2600-2699\2610.Convert an Array Into a 2D Array With Conditions\Solution.ts
5
1
1
A
solution\0300-0399\0381.Insert Delete GetRandom O(1) - Duplicates allowed\Solution.java
8
1
1
A
solution\0800-0899\0875.Koko Eating Bananas\Solution.ts
4
1
1
A
solution\2400-2499\2408.Design SQL\Solution.java
4
1
1
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!