main
leetcode-beef
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.js
3 1 -
A
solution\0900-0999\0981.Time Based Key-Value Store\Solution.cpp
4 1 -
A
solution\0800-0899\0841.Keys and Rooms\Solution.ts
2 1 -
A
solution\2300-2399\2385.Amount of Time for Binary Tree to Be Infected\Solution.go
 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.c
4 1 -
A
solution\2300-2399\2385.Amount of Time for Binary Tree to Be Infected\Solution.py
5 1 -
A
solution\0800-0899\0842.Split Array into Fibonacci Sequence\Solution.go
 1 -
A
solution\2300-2399\2386.Find the K-Sum of an Array\Solution.cpp
7 1 -
A
solution\0400-0499\0447.Number of Boomerangs\Solution.cpp
4 1 -
A
solution\0400-0499\0402.Remove K Digits\Solution.cpp
9 1 -
A
solution\0400-0499\0487.Max Consecutive Ones II\Solution.java
5 1 -
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.py
1 1 -
A
solution\0900-0999\0981.Time Based Key-Value Store\Solution.go
 1 -
A
solution\0900-0999\0982.Triples with Bitwise AND Equal To Zero\Solution.cpp
6 1 -
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.ts
4 1 -
A
solution\0900-0999\0982.Triples with Bitwise AND Equal To Zero\Solution.go
 1 -
A
solution\0900-0999\0982.Triples with Bitwise AND Equal To Zero\Solution.java
7 1 -
A
solution\0600-0699\0670.Maximum Swap\Solution.cpp
5 1 -
A
solution\0900-0999\0983.Minimum Cost For Tickets\Solution.cpp
5 1 -
A
solution\0900-0999\0983.Minimum Cost For Tickets\Solution.go
 1 -