Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-idris
393
issues
2
pull requests
4,706
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0700-0799\0708.Insert into a Sorted Circular Linked List\Solution.py
7
1
-
A
solution\0400-0499\0450.Delete Node in a BST\Solution.java
7
1
-
A
solution\0400-0499\0450.Delete Node in a BST\Solution.py
7
1
-
A
solution\0900-0999\0909.Snakes and Ladders\Solution.py
7
1
-
A
solution\0900-0999\0917.Reverse Only Letters\Solution.py
7
1
-
A
solution\0800-0899\0892.Surface Area of 3D Shapes\Solution.java
6
1
-
A
solution\0800-0899\0890.Find and Replace Pattern\Solution.java
6
1
-
A
solution\0600-0699\0625.Minimum Factorization\Solution.cpp
6
1
-
A
solution\0800-0899\0892.Surface Area of 3D Shapes\Solution.py
6
1
-
A
solution\2300-2399\2338.Count the Number of Ideal Arrays\Solution.py
6
1
-
A
solution\0600-0699\0628.Maximum Product of Three Numbers\Solution.ts
6
1
-
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.java
6
1
1
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.py
6
1
-
A
solution\2000-2099\2070.Most Beautiful Item for Each Query\Solution.java
6
1
-
A
solution\0300-0399\0318.Maximum Product of Word Lengths\Solution.cpp
6
1
-
A
solution\0400-0499\0454.4Sum II\Solution.ts
6
1
-
A
solution\2300-2399\2344.Minimum Deletions to Make Array Divisible\Solution.cpp
6
1
-
A
solution\2300-2399\2328.Number of Increasing Paths in a Grid\Solution.ts
6
1
-
A
solution\0600-0699\0635.Design Log Storage System\Solution.cpp
6
1
-
A
solution\0300-0399\0341.Flatten Nested List Iterator\Solution.java
6
1
1
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!