main
leetcode-c--
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2475.Number of Unequal Triplets in Array\Solution.java
3 1 -
A
solution\2400-2499\2473.Minimum Cost to Buy Apples\Solution.py
3 1 -
A
solution\2300-2399\2330.Valid Palindrome IV\Solution.java
3 1 -
A
solution\2000-2099\2027.Minimum Moves to Convert String\Solution.cpp
3 1 -
A
solution\2000-2099\2027.Minimum Moves to Convert String\Solution.java
3 1 -
A
solution\0500-0599\0506.Relative Ranks\Solution.py
3 1 -
A
solution\2000-2099\2037.Minimum Number of Moves to Seat Everyone\Solution.c
3 1 -
A
solution\0300-0399\0322.Coin Change\Solution.js
3 1 -
A
solution\0700-0799\0701.Insert into a Binary Search Tree\Solution.java
3 1 -
A
solution\2400-2499\2470.Number of Subarrays With LCM Equal to K\Solution.py
3 1 -
A
solution\0500-0599\0508.Most Frequent Subtree Sum\Solution.py
3 1 -
A
solution\2300-2399\2326.Spiral Matrix IV\Solution.ts
3 1 -
A
solution\0400-0499\0409.Longest Palindrome\Solution.py
3 1 -
A
solution\2300-2399\2328.Number of Increasing Paths in a Grid\Solution.py
3 1 -
A
solution\2200-2299\2229.Check if an Array Is Consecutive\Solution.java
3 1 -
A
solution\2100-2199\2154.Keep Multiplying Found Values by Two\Solution.java
3 1 -
A
solution\0300-0399\0322.Coin Change\Solution.ts
3 1 -
A
solution\2300-2399\2325.Decode the Message\Solution.ts
3 1 -
A
solution\0700-0799\0713.Subarray Product Less Than K\Solution.js
3 1 -
A
solution\0700-0799\0713.Subarray Product Less Than K\Solution.ts
3 1 -