main
leetcode
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\1500-1599\1512.Number of Good Pairs\Solution.cpp
3 1 -
A
solution\1500-1599\1511.Customer Order Frequency\Solution.sql
 1 -
A
solution\1500-1599\1507.Reformat Date\Solution.py
2 1 -
A
solution\1500-1599\1507.Reformat Date\Solution.java
2 1 -
A
solution\1500-1599\1506.Find Root of N-Ary Tree\Solution.py
5 1 -
A
solution\1500-1599\1506.Find Root of N-Ary Tree\Solution.java
5 1 -
A
solution\1500-1599\1506.Find Root of N-Ary Tree\Solution.go
 1 -
A
solution\1500-1599\1506.Find Root of N-Ary Tree\Solution.cpp
5 1 -
A
solution\1500-1599\1503.Last Moment Before All Ants Fall Out of a Plank\images\Solution.go
 1 -
A
solution\1500-1599\1503.Last Moment Before All Ants Fall Out of a Plank\Solution.py
3 1 -
A
solution\1500-1599\1503.Last Moment Before All Ants Fall Out of a Plank\Solution.java
3 1 -
A
solution\1500-1599\1503.Last Moment Before All Ants Fall Out of a Plank\Solution.cpp
3 1 -
A
solution\1500-1599\1502.Can Make Arithmetic Progression From Sequence\Solution.py
3 1 -
A
solution\1500-1599\1502.Can Make Arithmetic Progression From Sequence\Solution.js
4 1 1
A
solution\1500-1599\1502.Can Make Arithmetic Progression From Sequence\Solution.java
3 1 -
A
solution\1500-1599\1500.Design a File Sharing System\Solution.py
10 1 -
A
solution\1500-1599\1500.Design a File Sharing System\Solution.java
10 1 1
A
solution\1400-1499\1497.Check If Array Pairs Are Divisible by k\Solution.py
4 1 -
A
solution\1400-1499\1497.Check If Array Pairs Are Divisible by k\Solution.java
4 1 -
A
solution\1400-1499\1497.Check If Array Pairs Are Divisible by k\Solution.go
 1 -