main
leetcode-beef
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0500-0599\0519.Random Flip Matrix\Solution.java
3 1 -
A
solution\0700-0799\0741.Cherry Pickup\Solution.py
15 1 -
A
solution\0400-0499\0415.Add Strings\Solution.py
16 1 -
A
solution\0700-0799\0742.Closest Leaf in a Binary Tree\Solution.go
 1 -
A
solution\0500-0599\0520.Detect Capital\Solution.cpp
3 1 -
A
solution\0700-0799\0742.Closest Leaf in a Binary Tree\Solution.py
10 1 -
A
solution\0300-0399\0373.Find K Pairs with Smallest Sums\Solution.cpp
5 1 -
A
solution\0700-0799\0743.Network Delay Time\Solution.go
 1 -
A
solution\0500-0599\0520.Detect Capital\Solution.java
6 1 -
A
solution\0700-0799\0743.Network Delay Time\Solution.py
6 1 -
A
solution\0400-0499\0416.Partition Equal Subset Sum\Solution.cpp
4 1 -
A
solution\0500-0599\0558.Logical OR of Two Binary Grids Represented as Quad-Trees\Solution.py
1 1 -
A
solution\0400-0499\0438.Find All Anagrams in a String\Solution.java
5 1 -
A
solution\0500-0599\0559.Maximum Depth of N-ary Tree\Solution.go
 1 -
A
solution\0300-0399\0336.Palindrome Pairs\Solution.cs
11 1 -
A
solution\0300-0399\0349.Intersection of Two Arrays\Solution.php
 1 -
A
solution\0500-0599\0559.Maximum Depth of N-ary Tree\Solution.java
3 1 -
A
solution\0400-0499\0438.Find All Anagrams in a String\Solution.py
4 1 -
A
solution\0500-0599\0559.Maximum Depth of N-ary Tree\Solution.py
3 1 -
A
solution\0500-0599\0560.Subarray Sum Equals K\Solution.cpp
2 1 -