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.java
11 1 -
A
solution\0300-0399\0369.Plus One Linked List\Solution.java
5 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.cpp
9 1 -
A
solution\0800-0899\0829.Consecutive Numbers Sum\Solution.go
 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.java
10 1 -
A
solution\0500-0599\0563.Binary Tree Tilt\Solution.py
1 1 -
A
solution\2300-2399\2341.Maximum Number of Pairs in Array\Solution.c
3 1 -
A
solution\0800-0899\0829.Consecutive Numbers Sum\Solution.py
4 1 -
A
solution\0400-0499\0433.Minimum Genetic Mutation\Solution.java
7 1 -
A
solution\0800-0899\0862.Shortest Subarray with Sum at Least K\Solution.py
7 1 -
A
solution\0500-0599\0588.Design In-Memory File System\Solution.go
 1 -
A
solution\0800-0899\0863.All Nodes Distance K in Binary Tree\Solution.cpp
0 1 -
A
solution\0300-0399\0373.Find K Pairs with Smallest Sums\Solution.java
5 1 -
A
solution\0400-0499\0441.Arranging Coins\Solution.cpp
4 1 -
A
solution\0800-0899\0863.All Nodes Distance K in Binary Tree\Solution.go
 1 -
A
solution\0800-0899\0863.All Nodes Distance K in Binary Tree\Solution.java
7 1 -
A
solution\0800-0899\0863.All Nodes Distance K in Binary Tree\Solution.py
1 1 -
A
solution\0500-0599\0588.Design In-Memory File System\Solution.py
16 1 -
A
solution\0800-0899\0864.Shortest Path to Get All Keys\Solution.cpp
0 1 -
A
solution\0400-0499\0441.Arranging Coins\Solution.java
1 1 -