main
leetcode-beef
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2338.Count the Number of Ideal Arrays\Solution.go
 1 -
A
solution\0300-0399\0383.Ransom Note\Solution.java
4 1 -
A
solution\2300-2399\2338.Count the Number of Ideal Arrays\Solution.py
6 1 -
A
solution\0800-0899\0817.Linked List Components\Solution.cpp
6 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.go
 1 -
A
solution\0500-0599\0567.Permutation in String\Solution.java
12 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.ts
9 1 -
A
solution\0800-0899\0817.Linked List Components\Solution.java
8 1 -
A
solution\0400-0499\0440.K-th Smallest in Lexicographical Order\Solution.go
 1 -
A
solution\0900-0999\0980.Unique Paths III\Solution.py
6 1 -
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.js
3 1 -
A
solution\0900-0999\0981.Time Based Key-Value Store\Solution.cpp
4 1 -
A
solution\0400-0499\0402.Remove K Digits\Solution.cpp
9 1 -
A
solution\0400-0499\0487.Max Consecutive Ones II\Solution.java
5 1 -
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.py
1 1 -
A
solution\0900-0999\0981.Time Based Key-Value Store\Solution.go
 1 -
A
solution\0900-0999\0982.Triples with Bitwise AND Equal To Zero\Solution.cpp
6 1 -
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.ts
4 1 -
A
solution\0900-0999\0982.Triples with Bitwise AND Equal To Zero\Solution.go
 1 -
A
solution\0900-0999\0982.Triples with Bitwise AND Equal To Zero\Solution.java
7 1 -