main
leetcode-free-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2389.Longest Subsequence With Limited Sum\Solution.ts
5 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.c
5 1 -
A
solution\2400-2499\2476.Closest Nodes Queries in a Binary Search Tree\Solution.cpp
5 1 -
A
solution\0300-0399\0333.Largest BST Subtree\Solution.java
5 1 -
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.java
5 1 -
A
solution\2100-2199\2150.Find All Lonely Numbers in the Array\Solution.py
5 1 -
A
solution\1000-1099\1017.Convert to Base -2\Solution.cpp
5 1 -
A
solution\2200-2299\2239.Find Closest Number to Zero\Solution.java
5 1 -
A
solution\0600-0699\0677.Map Sum Pairs\Solution.ts
5 1 -
A
solution\2300-2399\2385.Amount of Time for Binary Tree to Be Infected\Solution.py
5 1 -
A
solution\0400-0499\0475.Heaters\Solution.java
5 1 -
A
solution\2400-2499\2472.Maximum Number of Non-overlapping Palindrome Substrings\Solution.py
5 1 -
A
solution\2000-2099\2023.Number of Pairs of Strings With Concatenation Equal to Target\Solution.cpp
5 1 -
A
solution\0300-0399\0334.Increasing Triplet Subsequence\Solution.cpp
5 1 -
A
solution\0400-0499\0476.Number Complement\Solution.cpp
5 1 -
A
solution\2000-2099\2025.Maximum Number of Ways to Partition an Array\Solution.cpp
5 1 -
A
solution\2000-2099\2025.Maximum Number of Ways to Partition an Array\Solution.java
5 1 -
A
solution\0600-0699\0680.Valid Palindrome II\Solution.js
5 1 -
A
solution\0600-0699\0680.Valid Palindrome II\Solution.ts
5 1 -
A
solution\0400-0499\0476.Number Complement\Solution.java
5 1 -