main
leetcode-c--
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0900-0999\0942.DI String Match\Solution.java
3 1 -
A
solution\2200-2299\2246.Longest Path With Different Adjacent Characters\Solution.ts
3 1 -
A
solution\0900-0999\0942.DI String Match\Solution.py
3 1 -
A
solution\0900-0999\0942.DI String Match\Solution.ts
3 1 -
A
solution\0300-0399\0349.Intersection of Two Arrays\Solution.js
3 1 -
A
solution\2400-2499\2481.Minimum Cuts to Divide a Circle\Solution.java
3 1 -
A
solution\2300-2399\2341.Maximum Number of Pairs in Array\Solution.c
3 1 -
A
solution\2400-2499\2481.Minimum Cuts to Divide a Circle\Solution.py
3 1 -
A
solution\0900-0999\0945.Minimum Increment to Make Array Unique\Solution.java
3 1 -
A
solution\0600-0699\0650.2 Keys Keyboard\Solution.java
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.cs
3 1 -
A
solution\0900-0999\0946.Validate Stack Sequences\Solution.js
3 1 -
A
solution\0900-0999\0946.Validate Stack Sequences\Solution.ts
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\0900-0999\0947.Most Stones Removed with Same Row or Column\Solution.py
3 1 -
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.ts
3 1 -
A
solution\2300-2399\2336.Smallest Number in Infinite Set\Solution.ts
3 1 -
A
solution\0300-0399\0349.Intersection of Two Arrays\Solution.py
3 1 -