main
leetcode-free-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0818.Race Car\Solution.py
4 1 -
A
solution\0200-0299\0297.Serialize and Deserialize Binary Tree\Solution.py
4 1 -
A
solution\2400-2499\2448.Minimum Cost to Make Array Equal\Solution.java
4 1 -
A
solution\2200-2299\2258.Escape the Spreading Fire\Solution.py
4 1 -
A
solution\2100-2199\2170.Minimum Operations to Make the Array Alternating\Solution.py
4 1 -
A
solution\2300-2399\2336.Smallest Number in Infinite Set\Solution.java
4 1 2
A
solution\0300-0399\0350.Intersection of Two Arrays II\Solution.js
4 1 -
A
solution\0800-0899\0821.Shortest Distance to a Character\Solution.ts
4 1 -
A
solution\0500-0599\0552.Student Attendance Record II\Solution.cpp
4 1 -
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.py
4 1 1
A
solution\0400-0499\0416.Partition Equal Subset Sum\Solution.cpp
4 1 -
A
solution\0500-0599\0552.Student Attendance Record II\Solution.java
4 1 -
A
solution\2100-2199\2169.Count Operations to Obtain Zero\Solution.java
4 1 -
A
solution\0800-0899\0824.Goat Latin\Solution.java
4 1 -
A
solution\2400-2499\2441.Largest Positive Integer That Exists With Its Negative\Solution.java
4 1 -
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.java
4 1 -
A
solution\0500-0599\0553.Optimal Division\Solution.java
4 1 -
A
solution\2100-2199\2169.Count Operations to Obtain Zero\Solution.py
4 1 -
A
solution\2200-2299\2248.Intersection of Multiple Arrays\Solution.ts
4 1 -
A
solution\0500-0599\0554.Brick Wall\Solution.js
4 1 -