main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2263.Make Array Non-decreasing or Non-increasing\Solution.cpp
4 1 -
A
solution\0400-0499\0449.Serialize and Deserialize BST\Solution.py
4 1 1
A
solution\2400-2499\2441.Largest Positive Integer That Exists With Its Negative\Solution.java
4 1 -
A
solution\2100-2199\2108.Find First Palindromic String in the Array\Solution.ts
4 1 -
A
solution\2400-2499\2443.Sum of Number and Its Reverse\Solution.cpp
4 1 -
A
solution\2200-2299\2287.Rearrange Characters to Make Target String\Solution.ts
4 1 -
A
solution\2100-2199\2186.Minimum Number of Steps to Make Two Strings Anagram II\Solution.java
4 1 -
A
solution\2100-2199\2181.Merge Nodes in Between Zeros\Solution.cpp
4 1 -
A
solution\2100-2199\2181.Merge Nodes in Between Zeros\Solution.c
4 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.java
4 1 -
A
solution\2100-2199\2180.Count Integers With Even Digit Sum\Solution.java
4 1 -
A
solution\0400-0499\0451.Sort Characters By Frequency\Solution.cpp
4 1 -
A
solution\2100-2199\2109.Adding Spaces to a String\Solution.cpp
4 1 -
A
solution\0800-0899\0895.Maximum Frequency Stack\Solution.java
4 1 1
A
solution\0600-0699\0629.K Inverse Pairs Array\Solution.cpp
4 1 -
A
solution\0800-0899\0895.Maximum Frequency Stack\Solution.py
4 1 -
A
solution\0600-0699\0629.K Inverse Pairs Array\Solution.java
4 1 -
A
solution\2200-2299\2289.Steps to Make Array Non-decreasing\Solution.cpp
4 1 -
A
solution\2000-2099\2016.Maximum Difference Between Increasing Elements\Solution.cpp
4 1 -
A
solution\0400-0499\0451.Sort Characters By Frequency\Solution.java
4 1 -