main
leetcode-modula
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0682.Baseball Game\Solution.cpp
6 1 -
A
solution\0400-0499\0489.Robot Room Cleaner\Solution.cpp
6 1 -
A
solution\0400-0499\0489.Robot Room Cleaner\Solution.java
6 1 -
A
solution\2500-2599\2514.Count Anagrams\Solution.cpp
6 1 -
A
solution\1000-1099\1013.Partition Array Into Three Parts With Equal Sum\Solution.py
6 1 -
A
solution\0600-0699\0684.Redundant Connection\Solution.cpp
6 1 -
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.cpp
6 1 -
A
solution\0300-0399\0397.Integer Replacement\Solution.cpp
6 1 -
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.java
6 1 -
A
solution\2500-2599\2522.Partition String Into Substrings With Values at Most K\Solution.cpp
6 1 -
A
solution\2500-2599\2517.Maximum Tastiness of Candy Basket\Solution.java
6 1 -
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.js
6 1 1
A
solution\0600-0699\0684.Redundant Connection\Solution.java
6 1 -
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.py
6 1 -
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.ts
6 1 1
A
solution\0400-0499\0491.Non-decreasing Subsequences\Solution.cpp
6 1 -
A
solution\2400-2499\2444.Count Subarrays With Fixed Bounds\Solution.java
6 1 -
A
solution\0400-0499\0491.Non-decreasing Subsequences\Solution.java
6 1 -
A
solution\2400-2499\2444.Count Subarrays With Fixed Bounds\Solution.py
6 1 -
A
solution\2000-2099\2007.Find Original Array From Doubled Array\Solution.py
6 1 -