main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0386.Lexicographical Numbers\Solution.js
3 1 -
A
solution\0900-0999\0935.Knight Dialer\Solution.py
3 1 -
A
solution\0300-0399\0341.Flatten Nested List Iterator\Solution.ts
3 1 -
A
solution\0900-0999\0942.DI String Match\Solution.java
3 1 -
A
solution\0900-0999\0942.DI String Match\Solution.py
3 1 -
A
solution\0900-0999\0942.DI String Match\Solution.ts
3 1 -
A
solution\0400-0499\0473.Matchsticks to Square\Solution.py
3 1 -
A
solution\2300-2399\2341.Maximum Number of Pairs in Array\Solution.c
3 1 -
A
solution\2300-2399\2315.Count Asterisks\Solution.cs
3 1 -
A
solution\0900-0999\0945.Minimum Increment to Make Array Unique\Solution.java
3 1 -
A
solution\0900-0999\0946.Validate Stack Sequences\Solution.cs
3 1 -
A
solution\2300-2399\2302.Count Subarrays With Score Less Than K\Solution.java
3 1 -
A
solution\2300-2399\2302.Count Subarrays With Score Less Than K\Solution.cpp
3 1 -
A
solution\0400-0499\0475.Heaters\Solution.py
3 1 -
A
solution\0400-0499\0475.Heaters\Solution.ts
3 1 -
A
solution\0400-0499\0477.Total Hamming Distance\Solution.cpp
3 1 -
A
solution\2200-2299\2294.Partition Array Such That Maximum Difference Is K\Solution.java
3 1 -
A
solution\0400-0499\0477.Total Hamming Distance\Solution.java
3 1 -
A
solution\2200-2299\2294.Partition Array Such That Maximum Difference Is K\Solution.cpp
3 1 -
A
solution\2200-2299\2291.Maximum Profit From Trading Stocks\Solution.java
3 1 -