main
leetcode-assembly
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0683.K Empty Slots\Solution.cpp
0 1 1
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.ts
7 1 1
A
solution\0600-0699\0683.K Empty Slots\Solution.java
14 1 1
A
solution\1000-1099\1011.Capacity To Ship Packages Within D Days\Solution.ts
7 1 1
A
solution\1000-1099\1012.Numbers With Repeated Digits\Solution.ts
19 1 1
A
solution\0600-0699\0685.Redundant Connection II\Solution.java
13 1 1
A
solution\1000-1099\1015.Smallest Integer Divisible by K\Solution.ts
3 1 1
A
solution\1000-1099\1017.Convert to Base -2\Solution.ts
4 1 1
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.js
6 1 1
A
solution\0400-0499\0499.The Maze III\Solution.java
17 1 1
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.ts
6 1 1
A
solution\0400-0499\0499.The Maze III\Solution.py
16 1 1
A
solution\2000-2099\2013.Detect Squares\Solution.java
6 1 1
A
solution\2000-2099\2016.Maximum Difference Between Increasing Elements\Solution.js
3 1 1
A
solution\0600-0699\0688.Knight Probability in Chessboard\Solution.py
10 1 1
A
solution\2000-2099\2016.Maximum Difference Between Increasing Elements\Solution.ts
3 1 1
A
solution\2000-2099\2017.Grid Game\Solution.ts
3 1 1
A
solution\2000-2099\2018.Check if Word Can Be Placed In Crossword\Solution.cpp
19 1 1
A
solution\2000-2099\2022.Convert 1D Array Into 2D Array\Solution.js
3 1 1
A
solution\2000-2099\2022.Convert 1D Array Into 2D Array\Solution.ts
3 1 1