main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0863.All Nodes Distance K in Binary Tree\Solution.py
1 1 -
A
solution\2400-2499\2408.Design SQL\Solution.cpp
4 1 -
A
solution\0500-0599\0588.Design In-Memory File System\Solution.py
16 1 -
A
solution\0800-0899\0864.Shortest Path to Get All Keys\Solution.cpp
0 1 -
A
solution\2400-2499\2408.Design SQL\Solution.go
 1 -
A
solution\2400-2499\2409.Count Days Spent Together\Solution.cpp
5 1 -
A
solution\0800-0899\0864.Shortest Path to Get All Keys\Solution.go
 1 -
A
solution\2400-2499\2409.Count Days Spent Together\Solution.go
 1 -
A
solution\0400-0499\0441.Arranging Coins\Solution.java
1 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.c
4 1 -
A
solution\2400-2499\2409.Count Days Spent Together\Solution.java
5 1 -
A
solution\2400-2499\2410.Maximum Matching of Players With Trainers\Solution.cpp
5 1 -
A
solution\2400-2499\2410.Maximum Matching of Players With Trainers\Solution.go
 1 -
A
solution\2400-2499\2410.Maximum Matching of Players With Trainers\Solution.java
5 1 -
A
solution\2400-2499\2410.Maximum Matching of Players With Trainers\Solution.py
5 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.cpp
4 1 -
A
solution\0800-0899\0865.Smallest Subtree with all the Deepest Nodes\Solution.cpp
0 1 -
A
solution\2400-2499\2411.Smallest Subarrays With Maximum Bitwise OR\Solution.cpp
5 1 -
A
solution\2400-2499\2411.Smallest Subarrays With Maximum Bitwise OR\Solution.go
 1 -
A
solution\0300-0399\0337.House Robber III\Solution.java
6 1 -