main
leetcode-beef
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2279.Maximum Bags With Full Capacity of Rocks\Solution.ts
3 1 -
A
solution\0700-0799\0792.Number of Matching Subsequences\Solution.py
5 1 -
A
solution\2200-2299\2280.Minimum Lines to Represent a Line Chart\Solution.go
 1 -
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.ts
2 1 -
A
solution\2200-2299\2280.Minimum Lines to Represent a Line Chart\Solution.ts
3 1 -
A
solution\0700-0799\0793.Preimage Size of Factorial Zeroes Function\Solution.go
 1 -
A
solution\2200-2299\2281.Sum of Total Strength of Wizards\Solution.go
 1 -
A
solution\0500-0599\0554.Brick Wall\Solution.java
3 1 -
A
solution\2200-2299\2281.Sum of Total Strength of Wizards\Solution.py
10 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.cpp
4 1 -
A
solution\0400-0499\0435.Non-overlapping Intervals\Solution.java
3 1 -
A
solution\0900-0999\0979.Distribute Coins in Binary Tree\Solution.ts
1 1 -
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.go
 1 -
A
solution\0900-0999\0980.Unique Paths III\Solution.cpp
15 1 -
A
solution\0900-0999\0980.Unique Paths III\Solution.go
 1 -
A
solution\0400-0499\0487.Max Consecutive Ones II\Solution.go
 1 -
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.java
4 1 -
A
solution\0900-0999\0980.Unique Paths III\Solution.java
15 1 -
A
solution\0900-0999\0980.Unique Paths III\Solution.py
6 1 -
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.js
3 1 -