main
leetcode-elixir
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.py
5 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.ts
5 1 2
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.cpp
5 1 -
A
solution\0300-0399\0364.Nested List Weight Sum II\Solution.js
5 1 -
A
solution\0400-0499\0436.Find Right Interval\Solution.ts
5 1 -
A
solution\0800-0899\0875.Koko Eating Bananas\Solution.cpp
5 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.java
5 1 -
A
solution\0800-0899\0878.Nth Magical Number\Solution.java
5 1 -
A
solution\0400-0499\0438.Find All Anagrams in a String\Solution.cpp
5 1 -
A
solution\2400-2499\2411.Smallest Subarrays With Maximum Bitwise OR\Solution.py
5 1 -
A
solution\2400-2499\2412.Minimum Money Required Before Transactions\Solution.cpp
5 1 -
A
solution\0400-0499\0438.Find All Anagrams in a String\Solution.java
5 1 -
A
solution\0800-0899\0884.Uncommon Words from Two Sentences\Solution.java
5 1 -
A
solution\2000-2099\2033.Minimum Operations to Make a Uni-Value Grid\Solution.java
5 1 -
A
solution\0800-0899\0886.Possible Bipartition\Solution.py
5 1 -
A
solution\2400-2499\2411.Smallest Subarrays With Maximum Bitwise OR\Solution.cpp
5 1 -
A
solution\0600-0699\0605.Can Place Flowers\Solution.cpp
5 1 -
A
solution\0800-0899\0888.Fair Candy Swap\Solution.java
5 1 -
A
solution\2000-2099\2032.Two Out of Three\Solution.java
5 1 -
A
solution\2000-2099\2033.Minimum Operations to Make a Uni-Value Grid\Solution.cpp
5 1 -