main
leetcode-nushell
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2500-2599\2541.Minimum Operations to Make Array Equal II\Solution.cpp
6 1 -
A
solution\2500-2599\2540.Minimum Common Value\Solution.cpp
6 1 -
A
solution\2500-2599\2540.Minimum Common Value\Solution.c
6 1 -
A
solution\0700-0799\0786.K-th Smallest Prime Fraction\Solution.java
6 1 -
A
solution\0500-0599\0538.Convert BST to Greater Tree\Solution.java
6 1 -
A
solution\0300-0399\0358.Rearrange String k Distance Apart\Solution.py
6 1 -
A
solution\0500-0599\0538.Convert BST to Greater Tree\Solution.py
6 1 -
A
solution\0700-0799\0791.Custom Sort String\Solution.cpp
6 1 -
A
solution\0700-0799\0791.Custom Sort String\Solution.java
6 1 -
A
solution\0700-0799\0792.Number of Matching Subsequences\Solution.cpp
6 1 -
A
solution\0700-0799\0793.Preimage Size of Factorial Zeroes Function\Solution.java
6 1 -
A
solution\2500-2599\2502.Design Memory Allocator\Solution.py
6 1 -
A
solution\0400-0499\0416.Partition Equal Subset Sum\Solution.java
6 1 -
A
solution\0800-0899\0801.Minimum Swaps To Make Sequences Increasing\Solution.java
6 1 -
A
solution\0300-0399\0360.Sort Transformed Array\Solution.py
6 1 -
A
solution\2300-2399\2386.Find the K-Sum of an Array\Solution.py
6 1 -
A
solution\2300-2399\2373.Largest Local Values in a Matrix\Solution.py
6 1 -
A
solution\2300-2399\2338.Count the Number of Ideal Arrays\Solution.py
6 1 -
A
solution\2400-2499\2463.Minimum Total Distance Traveled\Solution.cpp
6 1 -
A
solution\0800-0899\0811.Subdomain Visit Count\Solution.cpp
6 1 -