main
leetcode-c--
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2464.Minimum Subarrays in a Valid Split\Solution.py
2 1 -
A
solution\2400-2499\2467.Most Profitable Path in a Tree\Solution.py
2 1 -
A
solution\2400-2499\2459.Sort Array by Moving Items to Empty Space\Solution.py
2 1 -
A
solution\2400-2499\2458.Height of Binary Tree After Subtree Removal Queries\Solution.py
2 1 -
A
solution\0900-0999\0918.Maximum Sum Circular Subarray\Solution.ts
2 1 -
A
solution\2400-2499\2450.Number of Distinct Binary Strings After Applying Operations\Solution.java
2 1 -
A
solution\0600-0699\0643.Maximum Average Subarray I\Solution.py
2 1 -
A
solution\0600-0699\0643.Maximum Average Subarray I\Solution.ts
2 1 -
A
solution\0900-0999\0926.Flip String to Monotone Increasing\Solution.js
2 1 -
A
solution\2400-2499\2442.Count Number of Distinct Integers After Reverse Operations\Solution.py
2 1 -
A
solution\2400-2499\2441.Largest Positive Integer That Exists With Its Negative\Solution.ts
2 1 -
A
solution\0600-0699\0646.Maximum Length of Pair Chain\Solution.ts
2 1 -
A
solution\2400-2499\2433.Find The Original Array of Prefix Xor\Solution.java
2 1 -
A
solution\2400-2499\2429.Minimize XOR\Solution.ts
2 1 -
A
solution\2500-2599\2555.Maximize Win From Two Segments\Solution.py
2 1 -
A
solution\2500-2599\2553.Separate the Digits in an Array\Solution.ts
2 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.java
2 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.py
2 1 -
A
solution\2400-2499\2425.Bitwise XOR of All Pairings\Solution.ts
2 1 -
A
solution\2500-2599\2551.Put Marbles in Bags\Solution.ts
2 1 -