main
leetcode-nushell
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0700-0799\0792.Number of Matching Subsequences\Solution.java
5 1 -
A
solution\0700-0799\0792.Number of Matching Subsequences\Solution.py
5 1 -
A
solution\2100-2199\2164.Sort Even and Odd Indices Independently\Solution.java
5 1 -
A
solution\2200-2299\2216.Minimum Deletions to Make Array Beautiful\Solution.cpp
5 1 -
A
solution\0400-0499\0415.Add Strings\Solution.ts
5 1 -
A
solution\2400-2499\2486.Append Characters to String to Make Subsequence\Solution.py
5 1 -
A
solution\2400-2499\2486.Append Characters to String to Make Subsequence\Solution.java
5 1 -
A
solution\2400-2499\2400.Number of Ways to Reach a Position After Exactly k Steps\Solution.ts
5 1 -
A
solution\2400-2499\2412.Minimum Money Required Before Transactions\Solution.cpp
5 1 -
A
solution\0400-0499\0416.Partition Equal Subset Sum\Solution.js
5 1 -
A
solution\0800-0899\0802.Find Eventual Safe States\Solution.js
5 1 -
A
solution\2200-2299\2200.Find All K-Distant Indices in an Array\Solution.py
5 1 -
A
solution\2200-2299\2200.Find All K-Distant Indices in an Array\Solution.cpp
5 1 -
A
solution\2200-2299\2200.Find All K-Distant Indices in an Array\Solution.java
5 1 -
A
solution\2200-2299\2231.Largest Number After Digit Swaps by Parity\Solution.ts
5 1 -
A
solution\0800-0899\0807.Max Increase to Keep City Skyline\Solution.cpp
5 1 -
A
solution\0800-0899\0807.Max Increase to Keep City Skyline\Solution.java
5 1 -
A
solution\2200-2299\2200.Find All K-Distant Indices in an Array\Solution.ts
5 1 -
A
solution\2100-2199\2150.Find All Lonely Numbers in the Array\Solution.ts
5 1 -
A
solution\0300-0399\0362.Design Hit Counter\Solution.java
5 1 1