main
leetcode-beef
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0806.Number of Lines To Write String\Solution.py
3 1 -
A
solution\0400-0499\0435.Non-overlapping Intervals\Solution.java
3 1 -
A
solution\2000-2099\2090.K Radius Subarray Averages\Solution.cpp
3 1 -
A
solution\2200-2299\2207.Maximize Number of Subsequences in a String\Solution.py
3 1 -
A
solution\0400-0499\0435.Non-overlapping Intervals\Solution.py
3 1 -
A
solution\2200-2299\2208.Minimum Operations to Halve Array Sum\Solution.cpp
3 1 -
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.cs
3 1 2
A
solution\0400-0499\0435.Non-overlapping Intervals\Solution.ts
3 1 -
A
solution\2300-2399\2383.Minimum Hours of Training to Win a Competition\Solution.ts
3 1 -
A
solution\2000-2099\2089.Find Target Indices After Sorting Array\Solution.py
3 1 -
A
solution\0500-0599\0553.Optimal Division\Solution.py
3 1 -
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.c
3 1 -
A
solution\0500-0599\0554.Brick Wall\Solution.java
3 1 -
A
solution\2000-2099\2089.Find Target Indices After Sorting Array\Solution.cpp
3 1 -
A
solution\0900-0999\0918.Maximum Sum Circular Subarray\Solution.java
3 1 -
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.cpp
3 1 -
A
solution\2000-2099\2022.Convert 1D Array Into 2D Array\Solution.js
3 1 1
A
solution\2200-2299\2207.Maximize Number of Subsequences in a String\Solution.cpp
3 1 -
A
solution\0800-0899\0814.Binary Tree Pruning\Solution.ts
3 1 -
A
solution\2200-2299\2207.Maximize Number of Subsequences in a String\Solution.java
3 1 -