Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-idris
404
issues
3
pull requests
3,836
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0883.Projection Area of 3D Shapes\Solution.java
4
1
-
A
solution\0800-0899\0884.Uncommon Words from Two Sentences\Solution.js
4
1
-
A
solution\0400-0499\0448.Find All Numbers Disappeared in an Array\Solution.ts
4
1
-
A
solution\0800-0899\0884.Uncommon Words from Two Sentences\Solution.ts
4
1
-
A
solution\2200-2299\2233.Maximum Product After K Increments\Solution.java
4
1
-
A
solution\0600-0699\0622.Design Circular Queue\Solution.ts
4
1
-
A
solution\2200-2299\2226.Maximum Candies Allocated to K Children\Solution.java
4
1
-
A
solution\0400-0499\0449.Serialize and Deserialize BST\Solution.py
4
1
1
A
solution\2400-2499\2412.Minimum Money Required Before Transactions\Solution.java
4
1
-
A
solution\2200-2299\2225.Find Players With Zero or One Losses\Solution.java
4
1
-
A
solution\2200-2299\2216.Minimum Deletions to Make Array Beautiful\Solution.ts
4
1
-
A
solution\2200-2299\2216.Minimum Deletions to Make Array Beautiful\Solution.java
4
1
-
A
solution\2200-2299\2216.Minimum Deletions to Make Array Beautiful\Solution.py
4
1
-
A
solution\0400-0499\0451.Sort Characters By Frequency\Solution.cpp
4
1
-
A
solution\2400-2499\2476.Closest Nodes Queries in a Binary Search Tree\Solution.py
4
1
-
A
solution\0800-0899\0895.Maximum Frequency Stack\Solution.java
4
1
1
A
solution\0600-0699\0629.K Inverse Pairs Array\Solution.cpp
4
1
-
A
solution\0800-0899\0895.Maximum Frequency Stack\Solution.py
4
1
-
A
solution\0600-0699\0629.K Inverse Pairs Array\Solution.java
4
1
-
A
solution\0400-0499\0451.Sort Characters By Frequency\Solution.java
4
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!