main
leetcode-c3
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0700-0799\0785.Is Graph Bipartite\Solution.ts
7 1 -
A
solution\0500-0599\0524.Longest Word in Dictionary through Deleting\Solution.ts
8 1 -
A
solution\0700-0799\0786.K-th Smallest Prime Fraction\Solution.go
 1 -
A
solution\0300-0399\0303.Range Sum Query - Immutable\Solution.ts
1 1 -
A
solution\0700-0799\0787.Cheapest Flights Within K Stops\Solution.cpp
4 1 -
A
solution\0500-0599\0525.Contiguous Array\Solution.go
 1 -
A
solution\0700-0799\0787.Cheapest Flights Within K Stops\Solution.java
4 1 -
A
solution\0300-0399\0395.Longest Substring with At Least K Repeating Characters\Solution.go
 1 -
A
solution\0500-0599\0526.Beautiful Arrangement\Solution.cpp
9 1 -
A
solution\0300-0399\0334.Increasing Triplet Subsequence\Solution.go
 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 -