main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2100-2199\2133.Check if Every Row and Column Contains All Numbers\Solution.java
7 1 -
A
solution\0700-0799\0742.Closest Leaf in a Binary Tree\Solution.py
10 1 -
A
solution\2100-2199\2133.Check if Every Row and Column Contains All Numbers\Solution.ts
4 1 -
A
solution\0500-0599\0518.Coin Change II\Solution.go
 1 -
A
solution\2100-2199\2134.Minimum Swaps to Group All 1's Together II\Solution.go
 1 -
A
solution\0700-0799\0743.Network Delay Time\Solution.go
 1 -
A
solution\2100-2199\2134.Minimum Swaps to Group All 1's Together II\Solution.py
4 1 -
A
solution\0400-0499\0408.Valid Word Abbreviation\Solution.java
10 1 -
A
solution\0600-0699\0611.Valid Triangle Number\Solution.ts
4 1 -
A
solution\0800-0899\0888.Fair Candy Swap\Solution.cpp
0 1 -
A
solution\0800-0899\0888.Fair Candy Swap\Solution.java
5 1 -
A
solution\0300-0399\0378.Kth Smallest Element in a Sorted Matrix\Solution.go
 1 -
A
solution\0400-0499\0448.Find All Numbers Disappeared in an Array\Solution.ts
4 1 -
A
solution\0600-0699\0616.Add Bold Tag in String\Solution.cpp
17 1 -
A
solution\0800-0899\0888.Fair Candy Swap\Solution.py
3 1 -
A
solution\0800-0899\0888.Fair Candy Swap\Solution.ts
2 1 -
A
solution\0600-0699\0616.Add Bold Tag in String\Solution.go
 1 -
A
solution\0800-0899\0889.Construct Binary Tree from Preorder and Postorder Traversal\Solution.cpp
0 1 -
A
solution\0800-0899\0889.Construct Binary Tree from Preorder and Postorder Traversal\Solution.go
 1 -
A
solution\0800-0899\0889.Construct Binary Tree from Preorder and Postorder Traversal\Solution.py
5 1 -