main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0396.Rotate Function\Solution.py
3 1 -
A
solution\0300-0399\0309.Best Time to Buy and Sell Stock with Cooldown\Solution.go
 1 -
A
solution\0300-0399\0316.Remove Duplicate Letters\Solution.go
 1 -
A
solution\0300-0399\0334.Increasing Triplet Subsequence\Solution.ts
5 1 -
A
solution\0300-0399\0368.Largest Divisible Subset\Solution.go
 1 -
A
solution\0400-0499\0429.N-ary Tree Level Order Traversal\Solution.go
 1 -
A
solution\0500-0599\0558.Logical OR of Two Binary Grids Represented as Quad-Trees\Solution.go
 1 -
A
solution\0400-0499\0498.Diagonal Traverse\Solution.go
 1 -
A
solution\0700-0799\0706.Design HashMap\Solution.ts
 1 -
A
solution\0300-0399\0349.Intersection of Two Arrays\Solution.php
 1 -
A
solution\0400-0499\0498.Diagonal Traverse\Solution.py
7 1 -
A
solution\0700-0799\0707.Design Linked List\Solution.py
13 1 -
A
solution\0300-0399\0397.Integer Replacement\Solution.go
 1 -
A
solution\0500-0599\0558.Logical OR of Two Binary Grids Represented as Quad-Trees\Solution.java
16 1 -
A
solution\0400-0499\0429.N-ary Tree Level Order Traversal\Solution.java
4 1 -
A
solution\0500-0599\0558.Logical OR of Two Binary Grids Represented as Quad-Trees\Solution.py
1 1 -
A
solution\0500-0599\0559.Maximum Depth of N-ary Tree\Solution.cpp
3 1 -
A
solution\0300-0399\0368.Largest Divisible Subset\Solution.java
8 1 -
A
solution\0400-0499\0429.N-ary Tree Level Order Traversal\Solution.py
4 1 -
A
solution\0500-0599\0559.Maximum Depth of N-ary Tree\Solution.go
 1 -