main
leetcode-pharo
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0387.First Unique Character in a String\Solution.cpp
4 1 -
A
solution\0900-0999\0926.Flip String to Monotone Increasing\Solution.cpp
4 1 -
A
solution\2400-2499\2448.Minimum Cost to Make Array Equal\Solution.cpp
4 1 -
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.java
4 1 -
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.cpp
4 1 -
A
solution\2400-2499\2428.Maximum Sum of an Hourglass\Solution.ts
4 1 -
A
solution\2400-2499\2427.Number of Common Factors\Solution.ts
4 1 -
A
solution\2400-2499\2424.Longest Uploaded Prefix\Solution.java
4 1 1
A
solution\2400-2499\2424.Longest Uploaded Prefix\Solution.cpp
4 1 -
A
solution\2400-2499\2419.Longest Subarray With Maximum Bitwise AND\Solution.java
4 1 -
A
solution\2200-2299\2279.Maximum Bags With Full Capacity of Rocks\Solution.cpp
4 1 -
A
solution\2200-2299\2279.Maximum Bags With Full Capacity of Rocks\Solution.java
4 1 -
A
solution\2400-2499\2422.Merge Operations to Turn Array Into a Palindrome\Solution.java
4 1 -
A
solution\2400-2499\2419.Longest Subarray With Maximum Bitwise AND\Solution.cpp
4 1 -
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.cpp
4 1 -
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.java
4 1 -
A
solution\0600-0699\0658.Find K Closest Elements\Solution.java
4 1 -
A
solution\2400-2499\2412.Minimum Money Required Before Transactions\Solution.java
4 1 -
A
solution\2200-2299\2270.Number of Ways to Split Array\Solution.java
4 1 -
A
solution\2400-2499\2408.Design SQL\Solution.java
4 1 1