main
leetcode-pharo
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0365.Water and Jug Problem\Solution.cs
6 1 -
A
solution\2300-2399\2389.Longest Subsequence With Limited Sum\Solution.java
6 1 -
A
solution\0700-0799\0757.Set Intersection Size At Least Two\Solution.cpp
6 1 -
A
solution\2300-2399\2386.Find the K-Sum of an Array\Solution.py
6 1 -
A
solution\2300-2399\2386.Find the K-Sum of an Array\Solution.java
6 1 -
A
solution\0900-0999\0986.Interval List Intersections\Solution.cpp
6 1 -
A
solution\0900-0999\0912.Sort an Array\Solution.cpp
6 1 -
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.cpp
6 1 -
A
solution\0900-0999\0911.Online Election\Solution.py
6 1 -
A
solution\0900-0999\0911.Online Election\Solution.java
6 1 1
A
solution\2300-2399\2384.Largest Palindromic Number\Solution.py
6 1 -
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.java
6 1 -
A
solution\2300-2399\2382.Maximum Segment Sum After Removals\Solution.py
6 1 -
A
solution\0700-0799\0768.Max Chunks To Make Sorted II\Solution.java
6 1 -
A
solution\0700-0799\0768.Max Chunks To Make Sorted II\Solution.ts
6 1 -
A
solution\0500-0599\0538.Convert BST to Greater Tree\Solution.java
6 1 -
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.java
6 1 -
A
solution\0500-0599\0538.Convert BST to Greater Tree\Solution.py
6 1 -
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.js
6 1 1
A
solution\2100-2199\2113.Elements in Array After Removing and Replacing Elements\Solution.java
6 1 -