Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-idris
404
issues
2
pull requests
3,836
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\0700-0799\0792.Number of Matching Subsequences\Solution.py
5
1
-
A
solution\2300-2399\2385.Amount of Time for Binary Tree to Be Infected\Solution.py
5
1
-
A
solution\2200-2299\2222.Number of Ways to Select Buildings\Solution.cpp
5
1
-
A
solution\0400-0499\0426.Convert Binary Search Tree to Sorted Doubly Linked List\Solution.java
5
1
-
A
solution\2200-2299\2222.Number of Ways to Select Buildings\Solution.java
5
1
-
A
solution\2300-2399\2387.Median of a Row Wise Sorted Matrix\Solution.cpp
5
1
-
A
solution\2100-2199\2120.Execution of All Suffix Instructions Staying in a Grid\Solution.py
5
1
-
A
solution\0500-0599\0552.Student Attendance Record II\Solution.py
5
1
-
A
solution\0800-0899\0802.Find Eventual Safe States\Solution.js
5
1
-
A
solution\2200-2299\2225.Find Players With Zero or One Losses\Solution.cpp
5
1
-
A
solution\0800-0899\0807.Max Increase to Keep City Skyline\Solution.cpp
5
1
-
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.ts
5
1
2
A
solution\0800-0899\0807.Max Increase to Keep City Skyline\Solution.java
5
1
-
A
solution\2300-2399\2381.Shifting Letters II\Solution.cpp
5
1
-
A
solution\2100-2199\2150.Find All Lonely Numbers in the Array\Solution.ts
5
1
-
A
solution\0400-0499\0429.N-ary Tree Level Order Traversal\Solution.cpp
5
1
-
A
solution\2100-2199\2125.Number of Laser Beams in a Bank\Solution.java
5
1
-
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.cpp
5
1
-
A
solution\0300-0399\0369.Plus One Linked List\Solution.cpp
5
1
-
A
solution\2300-2399\2381.Shifting Letters II\Solution.java
5
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!