main
leetcode-elixir
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2100-2199\2193.Minimum Number of Moves to Make Palindrome\Solution.java
6 1 -
A
solution\0400-0499\0410.Split Array Largest Sum\Solution.ts
6 1 -
A
solution\2500-2599\2507.Smallest Value After Replacing With Sum of Prime Factors\Solution.py
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\2500-2599\2507.Smallest Value After Replacing With Sum of Prime Factors\Solution.java
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.java
6 1 -
A
solution\0700-0799\0792.Number of Matching Subsequences\Solution.cpp
6 1 -
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.cpp
6 1 -
A
solution\0700-0799\0793.Preimage Size of Factorial Zeroes Function\Solution.java
6 1 -
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.java
6 1 -
A
solution\2500-2599\2507.Smallest Value After Replacing With Sum of Prime Factors\Solution.cpp
6 1 -
A
solution\2500-2599\2505.Bitwise OR of All Subsequence Sums\Solution.py
6 1 -
A
solution\2200-2299\2202.Maximize the Topmost Element After K Moves\Solution.java
6 1 -
A
solution\2500-2599\2505.Bitwise OR of All Subsequence Sums\Solution.java
6 1 1
A
solution\0800-0899\0801.Minimum Swaps To Make Sequences Increasing\Solution.java
6 1 -
A
solution\0400-0499\0416.Partition Equal Subset Sum\Solution.java
6 1 -
A
solution\2500-2599\2502.Design Memory Allocator\Solution.py
6 1 -
A
solution\0300-0399\0314.Binary Tree Vertical Order Traversal\Solution.java
6 1 -