main
leetcode-ion
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2302.Count Subarrays With Score Less Than K\Solution.java
3 1 -
A
solution\2200-2299\2295.Replace Elements in an Array\Solution.java
3 1 -
A
solution\2200-2299\2294.Partition Array Such That Maximum Difference Is K\Solution.java
3 1 -
A
solution\0500-0599\0573.Squirrel Simulation\Solution.py
3 1 -
A
solution\0700-0799\0799.Champagne Tower\Solution.ts
3 1 -
A
solution\2200-2299\2291.Maximum Profit From Trading Stocks\Solution.java
3 1 -
A
solution\2200-2299\2285.Maximum Total Importance of Roads\Solution.java
3 1 -
A
solution\0800-0899\0802.Find Eventual Safe States\Solution.py
3 1 -
A
solution\0800-0899\0804.Unique Morse Code Words\Solution.java
3 1 -
A
solution\0800-0899\0804.Unique Morse Code Words\Solution.py
3 1 -
A
solution\2200-2299\2279.Maximum Bags With Full Capacity of Rocks\Solution.ts
3 1 -
A
solution\2200-2299\2275.Largest Combination With Bitwise AND Greater Than Zero\Solution.java
3 1 -
A
solution\2200-2299\2280.Minimum Lines to Represent a Line Chart\Solution.ts
3 1 -
A
solution\2200-2299\2280.Minimum Lines to Represent a Line Chart\Solution.java
3 1 -
A
solution\2200-2299\2273.Find Resultant Array After Removing Anagrams\Solution.ts
3 1 -
A
solution\2200-2299\2273.Find Resultant Array After Removing Anagrams\Solution.java
3 1 -
A
solution\2400-2499\2492.Minimum Score of a Path Between Two Cities\Solution.js
3 1 -
A
solution\0800-0899\0806.Number of Lines To Write String\Solution.java
3 1 -
A
solution\2400-2499\2492.Minimum Score of a Path Between Two Cities\Solution.ts
3 1 -
A
solution\2200-2299\2266.Count Number of Texts\Solution.py
3 1 -