main
leetcode-modula
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0900-0999\0977.Squares of a Sorted Array\Solution.java
3 1 -
A
solution\2000-2099\2071.Maximum Number of Tasks You Can Assign\Solution.py
3 1 -
A
solution\0800-0899\0897.Increasing Order Search Tree\Solution.java
3 1 -
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.py
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.py
3 1 -
A
solution\0700-0799\0769.Max Chunks To Make Sorted\Solution.py
3 1 -
A
solution\0500-0599\0530.Minimum Absolute Difference in BST\Solution.cpp
3 1 -
A
solution\0700-0799\0771.Jewels and Stones\Solution.cpp
3 1 -
A
solution\0700-0799\0771.Jewels and Stones\Solution.java
3 1 -
A
solution\0900-0999\0945.Minimum Increment to Make Array Unique\Solution.java
3 1 -
A
solution\0500-0599\0530.Minimum Absolute Difference in BST\Solution.java
3 1 -
A
solution\2100-2199\2186.Minimum Number of Steps to Make Two Strings Anagram II\Solution.ts
3 1 -
A
solution\1000-1099\1012.Numbers With Repeated Digits\Solution.py
3 1 -
A
solution\1000-1099\1015.Smallest Integer Divisible by K\Solution.java
3 1 -
A
solution\0700-0799\0775.Global and Local Inversions\Solution.py
3 1 -
A
solution\0700-0799\0776.Split BST\Solution.js
3 1 -
A
solution\0800-0899\0883.Projection Area of 3D Shapes\Solution.ts
3 1 -
A
solution\2100-2199\2186.Minimum Number of Steps to Make Two Strings Anagram II\Solution.js
3 1 -
A
solution\0900-0999\0945.Minimum Increment to Make Array Unique\Solution.py
3 1 -
A
solution\0900-0999\0946.Validate Stack Sequences\Solution.js
3 1 -