main
leetcode-j
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2600-2699\2610.Convert an Array Into a 2D Array With Conditions\Solution.ts
4 1 -
A
solution\0900-0999\0967.Numbers With Same Consecutive Differences\Solution.go
 1 -
A
solution\2600-2699\2611.Mice and Cheese\Solution.go
 1 -
A
solution\0400-0499\0408.Valid Word Abbreviation\Solution.py
10 1 -
A
solution\2600-2699\2611.Mice and Cheese\Solution.ts
2 1 -
A
solution\0900-0999\0967.Numbers With Same Consecutive Differences\Solution.py
2 1 -
A
solution\2600-2699\2612.Minimum Reverse Operations\Solution.go
 1 -
A
solution\0600-0699\0671.Second Minimum Node In a Binary Tree\Solution.java
5 1 -
A
solution\1000-1099\1001.Grid Illumination\Solution.ts
14 1 -
A
solution\0600-0699\0686.Repeated String Match\Solution.java
3 1 -
A
solution\1000-1099\1002.Find Common Characters\Solution.cpp
6 1 -
A
solution\1000-1099\1002.Find Common Characters\Solution.go
 1 -
A
solution\0500-0599\0505.The Maze II\Solution.cpp
0 1 -
A
solution\0600-0699\0687.Longest Univalue Path\Solution.c
5 1 -
A
solution\1000-1099\1002.Find Common Characters\Solution.java
6 1 -
A
solution\1000-1099\1002.Find Common Characters\Solution.ts
5 1 -
A
solution\0600-0699\0687.Longest Univalue Path\Solution.cpp
0 1 -
A
solution\1000-1099\1003.Check If Word Is Valid After Substitutions\Solution.cpp
8 1 -
A
solution\1000-1099\1003.Check If Word Is Valid After Substitutions\Solution.go
 1 -
A
solution\0900-0999\0968.Binary Tree Cameras\Solution.go
 1 -