main
leetcode-modula
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2000-2099\2089.Find Target Indices After Sorting Array\Solution.ts
2 1 -
A
solution\0800-0899\0890.Find and Replace Pattern\Solution.ts
2 1 -
A
solution\0800-0899\0891.Sum of Subsequence Widths\Solution.cpp
2 1 -
A
solution\0800-0899\0891.Sum of Subsequence Widths\Solution.java
2 1 -
A
solution\2000-2099\2083.Substrings That Begin and End With the Same Letter\Solution.java
2 1 -
A
solution\0500-0599\0598.Range Addition II\Solution.cpp
2 1 -
A
solution\0500-0599\0598.Range Addition II\Solution.java
2 1 -
A
solution\0800-0899\0888.Fair Candy Swap\Solution.ts
2 1 -
A
solution\0800-0899\0809.Expressive Words\Solution.py
2 1 -
A
solution\2000-2099\2083.Substrings That Begin and End With the Same Letter\Solution.cpp
2 1 -
A
solution\0600-0699\0600.Non-negative Integers without Consecutive Ones\Solution.py
2 1 1
A
solution\2300-2399\2330.Valid Palindrome IV\Solution.ts
2 1 -
A
solution\2300-2399\2330.Valid Palindrome IV\Solution.cpp
2 1 -
A
solution\2300-2399\2341.Maximum Number of Pairs in Array\Solution.cs
2 1 1
A
solution\2300-2399\2323.Find Minimum Time to Finish All Jobs II\Solution.java
2 1 -
A
solution\2300-2399\2320.Count Number of Ways to Place Houses\Solution.java
2 1 -
A
solution\2300-2399\2320.Count Number of Ways to Place Houses\Solution.cpp
2 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.java
2 1 -
A
solution\2300-2399\2312.Selling Pieces of Wood\Solution.py
2 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.py
2 1 -