main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2421.Number of Good Paths\Solution.java
9 1 -
A
solution\0800-0899\0887.Super Egg Drop\Solution.java
3 1 -
A
solution\2400-2499\2422.Merge Operations to Turn Array Into a Palindrome\Solution.cpp
5 1 -
A
solution\0600-0699\0623.Add One Row to Tree\Solution.py
2 1 -
A
solution\2400-2499\2422.Merge Operations to Turn Array Into a Palindrome\Solution.java
4 1 -
A
solution\0800-0899\0888.Fair Candy Swap\Solution.java
5 1 -
A
solution\2400-2499\2423.Remove Letter To Equalize Frequency\Solution.cpp
7 1 -
A
solution\0300-0399\0337.House Robber III\Solution.go
 1 -
A
solution\2400-2499\2493.Divide Nodes Into the Maximum Number of Groups\Solution.java
18 1 -
A
solution\2400-2499\2493.Divide Nodes Into the Maximum Number of Groups\Solution.go
 1 -
A
solution\2400-2499\2461.Maximum Sum of Distinct Subarrays With Length K\Solution.java
6 1 -
A
solution\2400-2499\2452.Words Within Two Edits of Dictionary\Solution.ts
5 1 -
A
solution\2400-2499\2448.Minimum Cost to Make Array Equal\Solution.go
 1 -
A
solution\2400-2499\2443.Sum of Number and Its Reverse\Solution.java
4 1 -
A
solution\2400-2499\2442.Count Number of Distinct Integers After Reverse Operations\Solution.go
 1 -
A
solution\2400-2499\2440.Create Components With Same Value\Solution.java
15 1 -
A
solution\0800-0899\0889.Construct Binary Tree from Preorder and Postorder Traversal\Solution.py
5 1 -
A
solution\0300-0399\0323.Number of Connected Components in an Undirected Graph\Solution.go
 1 -
A
solution\0700-0799\0704.Binary Search\Solution.go
 1 -
A
solution\2000-2099\2032.Two Out of Three\Solution.go
 1 -