main
leetcode-beef
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0413.Arithmetic Slices\Solution.py
3 1 -
A
solution\0700-0799\0733.Flood Fill\Solution.go
 1 -
A
solution\0500-0599\0514.Freedom Trail\Solution.cpp
7 1 -
A
solution\0700-0799\0733.Flood Fill\Solution.py
1 1 -
A
solution\0300-0399\0320.Generalized Abbreviation\Solution.java
5 1 -
A
solution\0700-0799\0734.Sentence Similarity\Solution.cpp
7 1 -
A
solution\0500-0599\0514.Freedom Trail\Solution.java
8 1 -
A
solution\0700-0799\0734.Sentence Similarity\Solution.java
7 1 -
A
solution\0400-0499\0414.Third Maximum Number\Solution.cpp
9 1 -
A
solution\0500-0599\0558.Logical OR of Two Binary Grids Represented as Quad-Trees\Solution.go
 1 -
A
solution\0400-0499\0438.Find All Anagrams in a String\Solution.go
 1 -
A
solution\0500-0599\0558.Logical OR of Two Binary Grids Represented as Quad-Trees\Solution.java
16 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 -