main
leetcode-dart
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2358.Maximum Number of Groups Entering a Competition\Solution.java
3 1 -
A
solution\0800-0899\0852.Peak Index in a Mountain Array\Solution.ts
3 1 -
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.cpp
8 1 -
A
solution\0500-0599\0591.Tag Validator\Solution.go
 1 -
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.java
9 1 -
A
solution\0800-0899\0854.K-Similar Strings\Solution.cpp
11 1 -
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.ts
7 1 -
A
solution\0400-0499\0442.Find All Duplicates in an Array\Solution.cpp
5 1 -
A
solution\2400-2499\2430.Maximum Deletions on a String\Solution.cpp
7 1 -
A
solution\2400-2499\2429.Minimize XOR\Solution.ts
2 1 -
A
solution\2400-2499\2400.Number of Ways to Reach a Position After Exactly k Steps\Solution.cpp
6 1 -
A
solution\2300-2399\2387.Median of a Row Wise Sorted Matrix\Solution.java
7 1 -
A
solution\2300-2399\2384.Largest Palindromic Number\Solution.py
6 1 -
A
solution\2300-2399\2382.Maximum Segment Sum After Removals\Solution.cpp
10 1 -
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.ts
5 1 -
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.go
 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.ts
2 1 -
A
solution\0400-0499\0402.Remove K Digits\Solution.go
 1 -
A
solution\0700-0799\0705.Design HashSet\Solution.cpp
4 1 -
A
solution\2000-2099\2029.Stone Game IX\Solution.go
 1 -