main
leetcode-scheme
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0700-0799\0764.Largest Plus Sign\Solution.cpp
9 1 -
A
solution\0700-0799\0764.Largest Plus Sign\Solution.java
9 1 -
A
solution\0500-0599\0531.Lonely Pixel I\Solution.cpp
9 1 -
A
solution\0500-0599\0531.Lonely Pixel I\Solution.java
9 1 -
A
solution\0500-0599\0531.Lonely Pixel I\Solution.py
9 1 -
A
solution\0700-0799\0778.Swim in Rising Water\Solution.py
9 1 -
A
solution\2200-2299\2276.Count Integers in Intervals\Solution.ts
9 1 -
A
solution\0400-0499\0414.Third Maximum Number\Solution.cpp
9 1 -
A
solution\0400-0499\0414.Third Maximum Number\Solution.java
9 1 -
A
solution\0500-0599\0536.Construct Binary Tree from String\Solution.java
9 1 -
A
solution\0700-0799\0785.Is Graph Bipartite\Solution.cpp
9 1 -
A
solution\0700-0799\0785.Is Graph Bipartite\Solution.java
9 1 -
A
solution\2200-2299\2290.Minimum Obstacle Removal to Reach Corner\Solution.py
9 1 -
A
solution\2400-2499\2462.Total Cost to Hire K Workers\Solution.py
9 1 -
A
solution\2500-2599\2596.Check Knight Tour Configuration\Solution.py
9 1 -
A
solution\2500-2599\2596.Check Knight Tour Configuration\Solution.java
9 1 -
A
solution\2300-2399\2337.Move Pieces to Obtain a String\Solution.ts
9 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.cpp
9 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.ts
9 1 -
A
solution\2300-2399\2344.Minimum Deletions to Make Array Divisible\Solution.java
9 1 -