main
leetcode-pharo
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0663.Equal Tree Partition\Solution.cpp
4 1 -
A
solution\0600-0699\0663.Equal Tree Partition\Solution.java
4 1 -
A
solution\2400-2499\2419.Longest Subarray With Maximum Bitwise AND\Solution.cpp
4 1 -
A
solution\0600-0699\0665.Non-decreasing Array\Solution.cpp
4 1 -
A
solution\2000-2099\2064.Minimized Maximum of Products Distributed to Any Store\Solution.ts
4 1 1
A
solution\2300-2399\2315.Count Asterisks\Solution.java
4 1 -
A
solution\2200-2299\2287.Rearrange Characters to Make Target String\Solution.ts
4 1 -
A
solution\2400-2499\2419.Longest Subarray With Maximum Bitwise AND\Solution.java
4 1 -
A
solution\0600-0699\0668.Kth Smallest Number in Multiplication Table\Solution.java
4 1 -
A
solution\2200-2299\2289.Steps to Make Array Non-decreasing\Solution.ts
4 1 -
A
solution\2100-2199\2107.Number of Unique Flavors After Sharing K Candies\Solution.java
4 1 -
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.java
4 1 -
A
solution\2400-2499\2412.Minimum Money Required Before Transactions\Solution.java
4 1 -
A
solution\2000-2099\2001.Number of Pairs of Interchangeable Rectangles\Solution.java
4 1 -
A
solution\0600-0699\0669.Trim a Binary Search Tree\Solution.ts
4 1 -
A
solution\0400-0499\0483.Smallest Good Base\Solution.cpp
4 1 -
A
solution\0600-0699\0671.Second Minimum Node In a Binary Tree\Solution.js
4 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.java
4 1 -
A
solution\0300-0399\0324.Wiggle Sort II\Solution.cpp
4 1 -
A
solution\0300-0399\0350.Intersection of Two Arrays II\Solution.cpp
4 1 -