main
leetcode-c--
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0500-0599\0554.Brick Wall\Solution.java
3 1 -
A
solution\0400-0499\0435.Non-overlapping Intervals\Solution.java
3 1 -
A
solution\2400-2499\2485.Find the Pivot Integer\Solution.java
3 1 -
A
solution\0400-0499\0435.Non-overlapping Intervals\Solution.ts
3 1 -
A
solution\2400-2499\2481.Minimum Cuts to Divide a Circle\Solution.java
3 1 -
A
solution\2400-2499\2481.Minimum Cuts to Divide a Circle\Solution.py
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.py
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.java
3 1 -
A
solution\0700-0799\0799.Champagne Tower\Solution.ts
3 1 -
A
solution\2200-2299\2293.Min Max Game\Solution.ts
3 1 -
A
solution\0500-0599\0557.Reverse Words in a String III\Solution.java
3 1 -
A
solution\0800-0899\0800.Similar RGB Color\Solution.java
3 1 -
A
solution\2200-2299\2233.Maximum Product After K Increments\Solution.py
3 1 -
A
solution\0400-0499\0437.Path Sum III\Solution.java
3 1 -
A
solution\0800-0899\0802.Find Eventual Safe States\Solution.py
3 1 -
A
solution\0300-0399\0374.Guess Number Higher or Lower\Solution.cs
3 1 -
A
solution\0800-0899\0804.Unique Morse Code Words\Solution.java
3 1 -
A
solution\0800-0899\0804.Unique Morse Code Words\Solution.py
3 1 -
A
solution\0500-0599\0559.Maximum Depth of N-ary Tree\Solution.java
3 1 -
A
solution\0300-0399\0341.Flatten Nested List Iterator\Solution.py
3 1 -