main
leetcode-haxe
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\1000-1099\1005.Maximize Sum Of Array After K Negations\Solution.java
10 1 -
A
solution\1000-1099\1005.Maximize Sum Of Array After K Negations\Solution.go
 1 -
A
solution\1000-1099\1005.Maximize Sum Of Array After K Negations\Solution.cpp
10 1 -
A
solution\1000-1099\1004.Max Consecutive Ones III\Solution.ts
5 1 1
A
solution\1000-1099\1004.Max Consecutive Ones III\Solution.py
5 1 1
A
solution\1000-1099\1003.Check If Word Is Valid After Substitutions\Solution.java
7 1 -
A
solution\1000-1099\1003.Check If Word Is Valid After Substitutions\Solution.go
 1 -
A
solution\1000-1099\1003.Check If Word Is Valid After Substitutions\Solution.cpp
8 1 -
A
solution\1000-1099\1002.Find Common Characters\Solution.ts
5 1 -
A
solution\1000-1099\1002.Find Common Characters\Solution.py
4 1 -
A
solution\1000-1099\1002.Find Common Characters\Solution.java
6 1 -
A
solution\1000-1099\1002.Find Common Characters\Solution.go
 1 -
A
solution\1000-1099\1002.Find Common Characters\Solution.cpp
6 1 -
A
solution\1000-1099\1001.Grid Illumination\Solution.ts
14 1 -
A
solution\1000-1099\1001.Grid Illumination\Solution.py
11 1 -
A
solution\1000-1099\1001.Grid Illumination\Solution.java
19 1 -
A
solution\1000-1099\1001.Grid Illumination\Solution.go
 1 -
A
solution\1000-1099\1001.Grid Illumination\Solution.cpp
15 1 -
A
solution\1000-1099\1000.Minimum Cost to Merge Stones\Solution.py
9 1 1
A
solution\1000-1099\1000.Minimum Cost to Merge Stones\Solution.java
10 1 -