main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2384.Largest Palindromic Number\Solution.cpp
10 1 -
A
solution\0800-0899\0851.Loud and Rich\Solution.java
7 1 -
A
solution\2300-2399\2384.Largest Palindromic Number\Solution.java
9 1 -
A
solution\0500-0599\0576.Out of Boundary Paths\Solution.py
1 1 -
A
solution\0500-0599\0588.Design In-Memory File System\Solution.go
 1 -
A
solution\0800-0899\0863.All Nodes Distance K in Binary Tree\Solution.cpp
0 1 -
A
solution\0800-0899\0851.Loud and Rich\Solution.ts
5 1 -
A
solution\2300-2399\2385.Amount of Time for Binary Tree to Be Infected\Solution.go
 1 -
A
solution\0400-0499\0438.Find All Anagrams in a String\Solution.java
5 1 -
A
solution\0300-0399\0373.Find K Pairs with Smallest Sums\Solution.java
5 1 -
A
solution\0400-0499\0441.Arranging Coins\Solution.cpp
4 1 -
A
solution\0800-0899\0863.All Nodes Distance K in Binary Tree\Solution.go
 1 -
A
solution\0800-0899\0863.All Nodes Distance K in Binary Tree\Solution.java
7 1 -
A
solution\0800-0899\0863.All Nodes Distance K in Binary Tree\Solution.py
1 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\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\0800-0899\0864.Shortest Path to Get All Keys\Solution.go
 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.cpp
4 1 -