main
leetcode-pharo
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0900-0999\0946.Validate Stack Sequences\Solution.cpp
4 1 -
A
solution\2200-2299\2248.Intersection of Multiple Arrays\Solution.ts
4 1 -
A
solution\0900-0999\0948.Bag of Tokens\Solution.java
4 1 -
A
solution\0900-0999\0948.Bag of Tokens\Solution.py
4 1 -
A
solution\0900-0999\0950.Reveal Cards In Increasing Order\Solution.java
4 1 -
A
solution\2500-2599\2515.Shortest Distance to Target String in a Circular Array\Solution.java
4 1 -
A
solution\0600-0699\0658.Find K Closest Elements\Solution.java
4 1 -
A
solution\2200-2299\2244.Minimum Rounds to Complete All Tasks\Solution.cpp
4 1 -
A
solution\2200-2299\2243.Calculate Digit Sum of a String\Solution.java
4 1 -
A
solution\2200-2299\2243.Calculate Digit Sum of a String\Solution.cpp
4 1 -
A
solution\0900-0999\0958.Check Completeness of a Binary Tree\Solution.java
4 1 -
A
solution\2500-2599\2515.Shortest Distance to Target String in a Circular Array\Solution.cpp
4 1 -
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\2200-2299\2237.Count Positions on Street With Required Brightness\Solution.cpp
4 1 -
A
solution\2200-2299\2233.Maximum Product After K Increments\Solution.java
4 1 -
A
solution\2200-2299\2237.Count Positions on Street With Required Brightness\Solution.java
4 1 -
A
solution\0600-0699\0665.Non-decreasing Array\Solution.cpp
4 1 -
A
solution\2200-2299\2232.Minimize Result by Adding Parentheses to Expression\Solution.ts
4 1 -
A
solution\0900-0999\0977.Squares of a Sorted Array\Solution.cpp
4 1 -