main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0500-0599\0523.Continuous Subarray Sum\Solution.java
5 1 -
A
solution\2100-2199\2151.Maximum Good People Based on Statements\Solution.ts
6 1 -
A
solution\0700-0799\0752.Open the Lock\Solution.java
19 1 -
A
solution\2100-2199\2152.Minimum Number of Lines to Cover Points\Solution.go
 1 -
A
solution\0300-0399\0328.Odd Even Linked List\Solution.cpp
4 1 -
A
solution\2100-2199\2152.Minimum Number of Lines to Cover Points\Solution.py
1 1 -
A
solution\0700-0799\0753.Cracking the Safe\Solution.cpp
3 1 -
A
solution\2100-2199\2154.Keep Multiplying Found Values by Two\Solution.go
 1 -
A
solution\0500-0599\0524.Longest Word in Dictionary through Deleting\Solution.go
 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 -
A
solution\0800-0899\0890.Find and Replace Pattern\Solution.cpp
0 1 -