main
leetcode-umka
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2000-2099\2017.Grid Game\Solution.cpp
3 1 -
A
solution\2100-2199\2149.Rearrange Array Elements by Sign\Solution.java
3 1 -
A
solution\2100-2199\2144.Minimum Cost of Buying Candies With Discount\Solution.java
3 1 -
A
solution\2400-2499\2401.Longest Nice Subarray\Solution.py
3 1 -
A
solution\0500-0599\0530.Minimum Absolute Difference in BST\Solution.cpp
3 1 -
A
solution\2000-2099\2016.Maximum Difference Between Increasing Elements\Solution.java
3 1 -
A
solution\2400-2499\2401.Longest Nice Subarray\Solution.ts
3 1 1
A
solution\2400-2499\2401.Longest Nice Subarray\Solution.java
3 1 -
A
solution\2100-2199\2144.Minimum Cost of Buying Candies With Discount\Solution.py
3 1 -
A
solution\0600-0699\0674.Longest Continuous Increasing Subsequence\Solution.cpp
3 1 -
A
solution\0500-0599\0530.Minimum Absolute Difference in BST\Solution.java
3 1 -
A
solution\0900-0999\0918.Maximum Sum Circular Subarray\Solution.cpp
3 1 -
A
solution\0900-0999\0918.Maximum Sum Circular Subarray\Solution.java
3 1 -
A
solution\0900-0999\0918.Maximum Sum Circular Subarray\Solution.py
3 1 -
A
solution\2400-2499\2401.Longest Nice Subarray\Solution.cpp
3 1 -
A
solution\2000-2099\2016.Maximum Difference Between Increasing Elements\Solution.js
3 1 1
A
solution\0600-0699\0674.Longest Continuous Increasing Subsequence\Solution.java
3 1 -
A
solution\0900-0999\0918.Maximum Sum Circular Subarray\Solution.ts
3 1 2
A
solution\2000-2099\2016.Maximum Difference Between Increasing Elements\Solution.py
3 1 -
A
solution\0600-0699\0674.Longest Continuous Increasing Subsequence\Solution.py
3 1 -