main
leetcode-machine
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0456.132 Pattern\Solution.go
 1 -
A
solution\0600-0699\0600.Non-negative Integers without Consecutive Ones\Solution.cpp
11 1 -
A
solution\0600-0699\0600.Non-negative Integers without Consecutive Ones\Solution.go
 1 -
A
solution\0400-0499\0456.132 Pattern\Solution.java
5 1 -
A
solution\0600-0699\0600.Non-negative Integers without Consecutive Ones\Solution.java
13 1 -
A
solution\0300-0399\0395.Longest Substring with At Least K Repeating Characters\Solution.cpp
12 1 -
A
solution\0400-0499\0456.132 Pattern\Solution.ts
4 1 -
A
solution\0600-0699\0602.Friend Requests II Who Has the Most Friends\Solution.sql
 1 -
A
solution\0600-0699\0604.Design Compressed String Iterator\Solution.cpp
8 1 -
A
solution\0400-0499\0457.Circular Array Loop\Solution.cpp
9 1 -
A
solution\0600-0699\0604.Design Compressed String Iterator\Solution.go
 1 -
A
solution\0300-0399\0395.Longest Substring with At Least K Repeating Characters\Solution.go
 1 -
A
solution\0400-0499\0457.Circular Array Loop\Solution.go
 1 -
A
solution\0600-0699\0604.Design Compressed String Iterator\Solution.py
9 1 -
A
solution\0600-0699\0605.Can Place Flowers\Solution.cpp
5 1 -
A
solution\0400-0499\0457.Circular Array Loop\Solution.java
9 1 -
A
solution\0600-0699\0605.Can Place Flowers\Solution.go
 1 -
A
solution\0600-0699\0605.Can Place Flowers\Solution.java
5 1 -
A
solution\0300-0399\0327.Count of Range Sum\Solution.py
11 1 -
A
solution\0300-0399\0340.Longest Substring with At Most K Distinct Characters\Solution.cpp
4 1 -