main
leetcode-c--
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2436.Minimum Split Into Subarrays With GCD Greater Than One\Solution.ts
3 1 -
A
solution\2400-2499\2435.Paths in Matrix Whose Sum Is Divisible by K\Solution.ts
3 1 -
A
solution\2400-2499\2429.Minimize XOR\Solution.py
3 1 -
A
solution\2400-2499\2429.Minimize XOR\Solution.java
3 1 -
A
solution\2400-2499\2427.Number of Common Factors\Solution.py
3 1 -
A
solution\2300-2399\2358.Maximum Number of Groups Entering a Competition\Solution.java
3 1 -
A
solution\2300-2399\2358.Maximum Number of Groups Entering a Competition\Solution.ts
3 1 -
A
solution\0300-0399\0350.Intersection of Two Arrays II\Solution.py
3 1 -
A
solution\0600-0699\0646.Maximum Length of Pair Chain\Solution.java
3 1 -
A
solution\0600-0699\0646.Maximum Length of Pair Chain\Solution.py
3 1 -
A
solution\2200-2299\2255.Count Prefixes of a Given String\Solution.java
3 1 -
A
solution\0600-0699\0647.Palindromic Substrings\Solution.js
3 1 -
A
solution\2200-2299\2260.Minimum Consecutive Cards to Pick Up\Solution.ts
3 1 -
A
solution\0600-0699\0650.2 Keys Keyboard\Solution.java
3 1 -
A
solution\0600-0699\0651.4 Keys Keyboard\Solution.java
3 1 -
A
solution\0600-0699\0651.4 Keys Keyboard\Solution.py
3 1 -
A
solution\0300-0399\0329.Longest Increasing Path in a Matrix\Solution.py
3 1 -
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.ts
3 1 -
A
solution\0600-0699\0653.Two Sum IV - Input is a BST\Solution.ts
3 1 -
A
solution\2400-2499\2423.Remove Letter To Equalize Frequency\Solution.py
3 1 -