main
leetcode-beef
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2420.Find All Good Indices\Solution.go
 1 -
A
solution\2400-2499\2420.Find All Good Indices\Solution.py
8 1 -
A
solution\0800-0899\0862.Shortest Subarray with Sum at Least K\Solution.java
8 1 -
A
solution\2400-2499\2421.Number of Good Paths\Solution.go
 1 -
A
solution\0300-0399\0358.Rearrange String k Distance Apart\Solution.cpp
7 1 -
A
solution\2400-2499\2421.Number of Good Paths\Solution.py
7 1 -
A
solution\0800-0899\0863.All Nodes Distance K in Binary Tree\Solution.go
 1 -
A
solution\2400-2499\2422.Merge Operations to Turn Array Into a Palindrome\Solution.go
 1 -
A
solution\0600-0699\0604.Design Compressed String Iterator\Solution.cpp
8 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 -
A
solution\0600-0699\0670.Maximum Swap\Solution.go
 1 -
A
solution\0900-0999\0983.Minimum Cost For Tickets\Solution.java
8 1 -
A
solution\0900-0999\0983.Minimum Cost For Tickets\Solution.ts
4 1 -
A
solution\0300-0399\0366.Find Leaves of Binary Tree\Solution.java
7 1 -