main
leetcode-elixir
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2472.Maximum Number of Non-overlapping Palindrome Substrings\Solution.cpp
7 1 -
A
solution\2400-2499\2470.Number of Subarrays With LCM Equal to K\Solution.java
7 1 -
A
solution\2500-2599\2565.Subsequence With the Minimum Score\Solution.py
7 1 1
A
solution\0400-0499\0474.Ones and Zeroes\Solution.cpp
7 1 -
A
solution\1000-1099\1003.Check If Word Is Valid After Substitutions\Solution.java
7 1 -
A
solution\0400-0499\0474.Ones and Zeroes\Solution.java
7 1 -
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.cpp
7 1 -
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.ts
7 1 1
A
solution\1000-1099\1011.Capacity To Ship Packages Within D Days\Solution.cpp
7 1 -
A
solution\1000-1099\1011.Capacity To Ship Packages Within D Days\Solution.java
7 1 -
A
solution\2500-2599\2511.Maximum Enemy Forts That Can Be Captured\Solution.java
7 1 -
A
solution\1000-1099\1011.Capacity To Ship Packages Within D Days\Solution.ts
7 1 1
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.ts
7 1 -
A
solution\1000-1099\1013.Partition Array Into Three Parts With Equal Sum\Solution.cpp
7 1 -
A
solution\1000-1099\1013.Partition Array Into Three Parts With Equal Sum\Solution.java
7 1 -
A
solution\0600-0699\0678.Valid Parenthesis String\Solution.java
7 1 -
A
solution\2000-2099\2008.Maximum Earnings From Taxi\Solution.java
7 1 -
A
solution\0600-0699\0678.Valid Parenthesis String\Solution.py
7 1 -
A
solution\2000-2099\2012.Sum of Beauty in the Array\Solution.ts
7 1 4
A
solution\2500-2599\2511.Maximum Enemy Forts That Can Be Captured\Solution.py
7 1 -