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\0400-0499\0423.Reconstruct Original Digits from English\Solution.cpp
4
1
-
A
solution\0800-0899\0867.Transpose Matrix\Solution.js
4
1
1
A
solution\0600-0699\0629.K Inverse Pairs Array\Solution.cpp
4
1
-
A
solution\0800-0899\0868.Binary Gap\Solution.cpp
4
1
-
A
solution\0800-0899\0868.Binary Gap\Solution.java
4
1
-
A
solution\0800-0899\0868.Binary Gap\Solution.py
4
1
-
A
solution\0600-0699\0629.K Inverse Pairs Array\Solution.java
4
1
-
A
solution\0800-0899\0868.Binary Gap\Solution.ts
4
1
1
A
solution\0600-0699\0629.K Inverse Pairs Array\Solution.py
4
1
-
A
solution\2400-2499\2468.Split Message Based on Limit\Solution.cpp
4
1
-
A
solution\2200-2299\2288.Apply Discount to Prices\Solution.ts
4
1
3
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\0800-0899\0870.Advantage Shuffle\Solution.java
4
1
-
A
solution\0800-0899\0870.Advantage Shuffle\Solution.py
4
1
-
A
solution\2400-2499\2458.Height of Binary Tree After Subtree Removal Queries\Solution.cpp
4
1
-
A
solution\2200-2299\2244.Minimum Rounds to Complete All Tasks\Solution.cpp
4
1
-
A
solution\2200-2299\2289.Steps to Make Array Non-decreasing\Solution.cpp
4
1
-
A
solution\0400-0499\0423.Reconstruct Original Digits from English\Solution.java
4
1
-
A
solution\0800-0899\0872.Leaf-Similar Trees\Solution.cpp
4
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!