main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0653.Two Sum IV - Input is a BST\Solution.ts
3 1 -
A
solution\0600-0699\0648.Replace Words\Solution.go
 1 -
A
solution\0300-0399\0382.Linked List Random Node\Solution.go
 1 -
A
solution\0600-0699\0648.Replace Words\Solution.py
11 1 -
A
solution\0300-0399\0341.Flatten Nested List Iterator\Solution.go
 1 -
A
solution\0600-0699\0650.2 Keys Keyboard\Solution.go
 1 -
A
solution\0400-0499\0462.Minimum Moves to Equal Array Elements II\Solution.cpp
2 1 -
A
solution\0600-0699\0651.4 Keys Keyboard\Solution.cpp
3 1 -
A
solution\0600-0699\0663.Equal Tree Partition\Solution.go
 1 -
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.java
4 1 -
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.go
 1 -
A
solution\0600-0699\0659.Split Array into Consecutive Subsequences\Solution.cpp
7 1 -
A
solution\0600-0699\0655.Print Binary Tree\Solution.ts
2 1 -
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.ts
3 1 -
A
solution\0400-0499\0462.Minimum Moves to Equal Array Elements II\Solution.py
2 1 -
A
solution\0300-0399\0303.Range Sum Query - Immutable\Solution.cpp
3 1 -
A
solution\0300-0399\0315.Count of Smaller Numbers After Self\Solution.go
 1 -
A
solution\0300-0399\0335.Self Crossing\Solution.go
 1 -
A
solution\0400-0499\0440.K-th Smallest in Lexicographical Order\Solution.cpp
6 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.c
4 1 -