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\2300-2399\2373.Largest Local Values in a Matrix\Solution.ts
4
1
-
A
solution\0800-0899\0862.Shortest Subarray with Sum at Least K\Solution.go
1
-
A
solution\2300-2399\2374.Node With Highest Edge Score\Solution.go
1
-
A
solution\0500-0599\0593.Valid Square\Solution.py
4
1
-
A
solution\2300-2399\2374.Node With Highest Edge Score\Solution.ts
3
1
-
A
solution\0800-0899\0863.All Nodes Distance K in Binary Tree\Solution.cpp
0
1
-
A
solution\2300-2399\2375.Construct Smallest Number From DI String\Solution.go
1
-
A
solution\0300-0399\0378.Kth Smallest Element in a Sorted Matrix\Solution.cpp
9
1
-
A
solution\2400-2499\2444.Count Subarrays With Fixed Bounds\Solution.go
1
-
A
solution\2400-2499\2444.Count Subarrays With Fixed Bounds\Solution.cpp
6
1
-
A
solution\2400-2499\2415.Reverse Odd Levels of Binary Tree\Solution.py
8
1
-
A
solution\2400-2499\2404.Most Frequent Even Element\Solution.ts
7
1
-
A
solution\2400-2499\2402.Meeting Rooms III\Solution.cpp
9
1
-
A
solution\2300-2399\2397.Maximum Rows Covered by Columns\Solution.go
1
-
A
solution\2300-2399\2393.Count Strictly Increasing Subarrays\Solution.go
1
-
A
solution\2300-2399\2392.Build a Matrix With Conditions\Solution.cpp
14
1
-
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.java
4
1
-
A
solution\0300-0399\0323.Number of Connected Components in an Undirected Graph\Solution.go
1
-
A
solution\0700-0799\0704.Binary Search\Solution.go
1
-
A
solution\2000-2099\2032.Two Out of Three\Solution.go
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!