main
leetcode-haxe
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.py
2 1 -
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.cpp
2 1 -
A
solution\2200-2299\2219.Maximum Sum Score of Array\Solution.js
2 1 -
A
solution\2200-2299\2219.Maximum Sum Score of Array\Solution.py
2 1 -
A
solution\2200-2299\2219.Maximum Sum Score of Array\Solution.ts
2 1 -
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.py
2 1 -
A
solution\2200-2299\2220.Minimum Bit Flips to Convert Number\Solution.c
2 1 -
A
solution\2200-2299\2220.Minimum Bit Flips to Convert Number\Solution.cpp
2 1 -
A
solution\2200-2299\2220.Minimum Bit Flips to Convert Number\Solution.java
2 1 -
A
solution\2200-2299\2220.Minimum Bit Flips to Convert Number\Solution.py
2 1 -
A
solution\2200-2299\2224.Minimum Number of Operations to Convert Time\Solution.cpp
2 1 -
A
solution\0700-0799\0746.Min Cost Climbing Stairs\Solution.cpp
2 1 -
A
solution\2200-2299\2224.Minimum Number of Operations to Convert Time\Solution.java
2 1 -
A
solution\0300-0399\0359.Logger Rate Limiter\Solution.js
2 1 -
A
solution\0500-0599\0518.Coin Change II\Solution.ts
2 1 -
A
solution\2200-2299\2224.Minimum Number of Operations to Convert Time\Solution.py
2 1 -
A
solution\0700-0799\0746.Min Cost Climbing Stairs\Solution.java
2 1 -
A
solution\2200-2299\2229.Check if an Array Is Consecutive\Solution.py
2 1 -
A
solution\0500-0599\0521.Longest Uncommon Subsequence I\Solution.java
2 1 -
A
solution\0500-0599\0521.Longest Uncommon Subsequence I\Solution.py
2 1 -