main
leetcode-hack
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2500-2599\2576.Find the Maximum Number of Marked Indices\Solution.java
5 1 -
A
solution\0900-0999\0970.Powerful Integers\Solution.py
6 1 -
A
solution\2500-2599\2576.Find the Maximum Number of Marked Indices\Solution.ts
4 1 -
A
solution\0400-0499\0415.Add Strings\Solution.js
13 1 -
A
solution\2500-2599\2577.Minimum Time to Visit a Cell In a Grid\Solution.go
 1 -
A
solution\0900-0999\0974.Subarray Sums Divisible by K\Solution.ts
3 1 -
A
solution\2500-2599\2577.Minimum Time to Visit a Cell In a Grid\Solution.py
12 1 -
A
solution\0600-0699\0686.Repeated String Match\Solution.cpp
4 1 -
A
solution\0700-0799\0712.Minimum ASCII Delete Sum for Two Strings\Solution.js
6 1 -
A
solution\2000-2099\2001.Number of Pairs of Interchangeable Rectangles\Solution.java
4 1 -
A
solution\0400-0499\0424.Longest Repeating Character Replacement\Solution.cpp
3 1 -
A
solution\0500-0599\0523.Continuous Subarray Sum\Solution.java
5 1 -
A
solution\0700-0799\0712.Minimum ASCII Delete Sum for Two Strings\Solution.py
7 1 -
A
solution\2000-2099\2002.Maximum Product of the Length of Two Palindromic Subsequences\Solution.cpp
13 1 -
A
solution\2000-2099\2002.Maximum Product of the Length of Two Palindromic Subsequences\Solution.go
 1 -
A
solution\0700-0799\0712.Minimum ASCII Delete Sum for Two Strings\Solution.ts
6 1 -
A
solution\2000-2099\2002.Maximum Product of the Length of Two Palindromic Subsequences\Solution.java
13 1 -
A
solution\2000-2099\2002.Maximum Product of the Length of Two Palindromic Subsequences\Solution.py
13 1 -
A
solution\0500-0599\0524.Longest Word in Dictionary through Deleting\Solution.cpp
10 1 -
A
solution\0700-0799\0713.Subarray Product Less Than K\Solution.java
4 1 -