main
leetcode-elixir
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2100-2199\2170.Minimum Operations to Make the Array Alternating\Solution.java
9 1 -
A
solution\0700-0799\0741.Cherry Pickup\Solution.js
12 1 -
A
solution\2100-2199\2171.Removing Minimum Number of Magic Beans\Solution.go
 1 -
A
solution\0500-0599\0513.Find Bottom Left Tree Value\Solution.java
5 1 -
A
solution\2100-2199\2174.Remove All Ones With Row and Column Flips II\Solution.cpp
13 1 -
A
solution\0700-0799\0742.Closest Leaf in a Binary Tree\Solution.cpp
12 1 -
A
solution\2100-2199\2174.Remove All Ones With Row and Column Flips II\Solution.java
13 1 -
A
solution\0400-0499\0400.Nth Digit\Solution.cs
1 1 1
A
solution\2100-2199\2179.Count Good Triplets in an Array\Solution.go
 1 -
A
solution\0700-0799\0742.Closest Leaf in a Binary Tree\Solution.java
12 1 -
A
solution\0200-0299\0294.Flip Game II\Solution.cpp
9 1 -
A
solution\0200-0299\0295.Find Median from Data Stream\Solution.cpp
5 1 -
A
solution\0200-0299\0296.Best Meeting Point\Solution.go
 1 -
A
solution\0300-0399\0300.Longest Increasing Subsequence\Solution.java
6 1 -
A
solution\0300-0399\0308.Range Sum Query 2D - Mutable\Solution.go
 1 -
A
solution\0300-0399\0333.Largest BST Subtree\Solution.java
5 1 -
A
solution\0300-0399\0386.Lexicographical Numbers\Solution.java
5 1 -
A
solution\0400-0499\0486.Predict the Winner\Solution.cpp
5 1 -
A
solution\0600-0699\0689.Maximum Sum of 3 Non-Overlapping Subarrays\Solution.py
6 1 -
A
solution\2000-2099\2043.Simple Bank System\Solution.cpp
10 1 -