main
leetcode-c3
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0700-0799\0791.Custom Sort String\Solution.ts
4 1 -
A
solution\0700-0799\0792.Number of Matching Subsequences\Solution.go
 1 -
A
solution\0300-0399\0396.Rotate Function\Solution.go
 1 -
A
solution\0700-0799\0792.Number of Matching Subsequences\Solution.py
5 1 -
A
solution\0700-0799\0793.Preimage Size of Factorial Zeroes Function\Solution.go
 1 -
A
solution\0300-0399\0334.Increasing Triplet Subsequence\Solution.ts
5 1 -
A
solution\0500-0599\0528.Random Pick with Weight\Solution.java
5 1 -
A
solution\0700-0799\0794.Valid Tic-Tac-Toe State\Solution.java
23 1 -
A
solution\0300-0399\0397.Integer Replacement\Solution.cpp
6 1 -
A
solution\0400-0499\0421.Maximum XOR of Two Numbers in an Array\Solution.cpp
10 1 -
A
solution\0500-0599\0588.Design In-Memory File System\Solution.py
16 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.c
4 1 -
A
solution\0300-0399\0349.Intersection of Two Arrays\Solution.go
 1 -
A
solution\0400-0499\0421.Maximum XOR of Two Numbers in an Array\Solution.go
 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.cpp
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.go
 1 -
A
solution\0400-0499\0421.Maximum XOR of Two Numbers in an Array\Solution.java
5 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.java
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.py
4 1 -
A
solution\0300-0399\0349.Intersection of Two Arrays\Solution.java
5 1 -