main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2380.Time Needed to Rearrange a Binary String\Solution.cpp
4 1 -
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.java
4 1 -
A
solution\0300-0399\0322.Coin Change\Solution.py
4 1 -
A
solution\0300-0399\0343.Integer Break\Solution.cpp
4 1 -
A
solution\2300-2399\2380.Time Needed to Rearrange a Binary String\Solution.java
4 1 -
A
solution\2200-2299\2216.Minimum Deletions to Make Array Beautiful\Solution.py
4 1 -
A
solution\0300-0399\0343.Integer Break\Solution.java
4 1 -
A
solution\0600-0699\0658.Find K Closest Elements\Solution.cpp
4 1 -
A
solution\0600-0699\0658.Find K Closest Elements\Solution.java
4 1 -
A
solution\0300-0399\0343.Integer Break\Solution.py
4 1 -
A
solution\2300-2399\2373.Largest Local Values in a Matrix\Solution.ts
4 1 -
A
solution\2000-2099\2054.Two Best Non-Overlapping Events\Solution.py
4 1 -
A
solution\0600-0699\0663.Equal Tree Partition\Solution.cpp
4 1 -
A
solution\0600-0699\0663.Equal Tree Partition\Solution.java
4 1 -
A
solution\0600-0699\0665.Non-decreasing Array\Solution.cpp
4 1 -
A
solution\2300-2399\2374.Node With Highest Edge Score\Solution.cpp
4 1 -
A
solution\2300-2399\2371.Minimize Maximum Value in a Grid\Solution.java
4 1 -
A
solution\2300-2399\2371.Minimize Maximum Value in a Grid\Solution.cpp
4 1 -
A
solution\0600-0699\0665.Non-decreasing Array\Solution.py
4 1 -
A
solution\2000-2099\2073.Time Needed to Buy Tickets\Solution.cpp
4 1 -