main
leetcode-beef
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0448.Find All Numbers Disappeared in an Array\Solution.cpp
5 1 -
A
solution\2300-2399\2395.Find Subarrays With Equal Sum\Solution.ts
2 1 -
A
solution\0800-0899\0847.Shortest Path Visiting All Nodes\Solution.py
7 1 -
A
solution\2300-2399\2397.Maximum Rows Covered by Columns\Solution.go
 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.ts
2 1 -
A
solution\2300-2399\2397.Maximum Rows Covered by Columns\Solution.py
7 1 -
A
solution\0800-0899\0848.Shifting Letters\Solution.java
2 1 -
A
solution\2300-2399\2398.Maximum Number of Robots Within Budget\Solution.cpp
7 1 -
A
solution\0300-0399\0328.Odd Even Linked List\Solution.java
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 -