main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0500-0599\0500.Keyboard Row\Solution.cpp
5 1 -
A
solution\0700-0799\0710.Random Pick with Blacklist\Solution.java
6 1 -
A
solution\0300-0399\0350.Intersection of Two Arrays II\Solution.cpp
4 1 -
A
solution\0700-0799\0711.Number of Distinct Islands II\Solution.cpp
15 1 -
A
solution\0500-0599\0500.Keyboard Row\Solution.go
 1 -
A
solution\0700-0799\0711.Number of Distinct Islands II\Solution.py
4 1 -
A
solution\0300-0399\0398.Random Pick Index\Solution.java
5 1 -
A
solution\0700-0799\0712.Minimum ASCII Delete Sum for Two Strings\Solution.go
 1 -
A
solution\0500-0599\0500.Keyboard Row\Solution.py
4 1 -
A
solution\0700-0799\0712.Minimum ASCII Delete Sum for Two Strings\Solution.js
6 1 -
A
solution\0300-0399\0313.Super Ugly Number\Solution.cpp
5 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 -
A
solution\0500-0599\0560.Subarray Sum Equals K\Solution.cpp
2 1 -
A
solution\0400-0499\0429.N-ary Tree Level Order Traversal\Solution.ts
3 1 -