main
leetcode-haskell
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0500-0599\0535.Encode and Decode TinyURL\Solution.java
2 1 1
A
solution\2500-2599\2555.Maximize Win From Two Segments\Solution.cpp
2 1 -
A
solution\2100-2199\2111.Minimum Operations to Make the Array K-Increasing\Solution.py
2 1 -
A
solution\2100-2199\2114.Maximum Number of Words Found in Sentences\Solution.cpp
2 1 -
A
solution\2100-2199\2114.Maximum Number of Words Found in Sentences\Solution.py
2 1 -
A
solution\2500-2599\2553.Separate the Digits in an Array\Solution.ts
2 1 -
A
solution\2500-2599\2555.Maximize Win From Two Segments\Solution.py
2 1 -
A
solution\2100-2199\2119.A Number After a Double Reversal\Solution.java
2 1 -
A
solution\2100-2199\2119.A Number After a Double Reversal\Solution.py
2 1 -
A
solution\2300-2399\2395.Find Subarrays With Equal Sum\Solution.ts
2 1 -
A
solution\0700-0799\0746.Min Cost Climbing Stairs\Solution.cpp
2 1 -
A
solution\0700-0799\0746.Min Cost Climbing Stairs\Solution.java
2 1 -
A
solution\0700-0799\0746.Min Cost Climbing Stairs\Solution.py
2 1 -
A
solution\0300-0399\0338.Counting Bits\Solution.cpp
2 1 -
A
solution\2300-2399\2389.Longest Subsequence With Limited Sum\Solution.py
2 1 -
A
solution\0500-0599\0541.Reverse String II\Solution.cpp
2 1 -
A
solution\0400-0499\0430.Flatten a Multilevel Doubly Linked List\Solution.py
2 1 -
A
solution\2100-2199\2134.Minimum Swaps to Group All 1's Together II\Solution.ts
2 1 -
A
solution\0500-0599\0541.Reverse String II\Solution.py
2 1 -
A
solution\2100-2199\2136.Earliest Possible Day of Full Bloom\Solution.py
2 1 -