main
leetcode-rect
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0500-0599\0536.Construct Binary Tree from String\Solution.java
9 1 -
A
solution\2500-2599\2528.Maximize the Minimum Powered City\Solution.java
9 1 1
A
solution\2500-2599\2593.Find Score of an Array After Marking All Elements\Solution.java
9 1 -
A
solution\2200-2299\2276.Count Integers in Intervals\Solution.ts
9 1 -
A
solution\2500-2599\2556.Disconnect Path in a Binary Matrix by at Most One Flip\Solution.java
9 1 -
A
solution\2200-2299\2290.Minimum Obstacle Removal to Reach Corner\Solution.py
9 1 -
A
solution\0500-0599\0549.Binary Tree Longest Consecutive Sequence II\Solution.java
9 1 -
A
solution\0800-0899\0820.Short Encoding of Words\Solution.py
9 1 1
A
solution\0500-0599\0555.Split Concatenated Strings\Solution.java
9 1 -
A
solution\0500-0599\0556.Next Greater Element III\Solution.java
9 1 2
A
solution\0800-0899\0825.Friends Of Appropriate Ages\Solution.cpp
9 1 -
A
solution\0800-0899\0825.Friends Of Appropriate Ages\Solution.java
9 1 -
A
solution\2500-2599\2519.Count the Number of K-Big Indices\Solution.py
9 1 -
A
solution\2300-2399\2337.Move Pieces to Obtain a String\Solution.ts
9 1 -
A
solution\2500-2599\2554.Maximum Number of Integers to Choose From a Range I\Solution.c
9 1 -
A
solution\2500-2599\2523.Closest Prime Numbers in Range\Solution.py
9 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.py
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 -
A
solution\0800-0899\0838.Push Dominoes\Solution.py
9 1 -