main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2338.Count the Number of Ideal Arrays\Solution.go
 1 -
A
solution\0800-0899\0846.Hand of Straights\Solution.go
 1 -
A
solution\2300-2399\2338.Count the Number of Ideal Arrays\Solution.py
6 1 -
A
solution\0500-0599\0573.Squirrel Simulation\Solution.py
3 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.go
 1 -
A
solution\0800-0899\0847.Shortest Path Visiting All Nodes\Solution.cpp
0 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.ts
9 1 -
A
solution\0400-0499\0433.Minimum Genetic Mutation\Solution.java
7 1 -
A
solution\0900-0999\0948.Bag of Tokens\Solution.go
 1 -
A
solution\0800-0899\0847.Shortest Path Visiting All Nodes\Solution.java
7 1 -
A
solution\0300-0399\0303.Range Sum Query - Immutable\Solution.go
 1 -
A
solution\0300-0399\0303.Range Sum Query - Immutable\Solution.ts
3 1 -
A
solution\0300-0399\0304.Range Sum Query 2D - Immutable\Solution.js
5 1 -
A
solution\0300-0399\0306.Additive Number\Solution.go
 1 -
A
solution\0300-0399\0310.Minimum Height Trees\Solution.go
 1 -
A
solution\0300-0399\0318.Maximum Product of Word Lengths\Solution.cpp
6 1 -
A
solution\0300-0399\0343.Integer Break\Solution.cpp
4 1 -
A
solution\0300-0399\0384.Shuffle an Array\Solution.java
5 1 -
A
solution\0400-0499\0467.Unique Substrings in Wraparound String\Solution.java
5 1 -
A
solution\0600-0699\0655.Print Binary Tree\Solution.ts
2 1 -