main
leetcode-tsh
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2402.Meeting Rooms III\Solution.cpp
9 1 -
A
solution\2400-2499\2471.Minimum Number of Operations to Sort a Binary Tree by Level\Solution.cpp
9 1 -
A
solution\2400-2499\2435.Paths in Matrix Whose Sum Is Divisible by K\Solution.cpp
9 1 -
A
solution\0800-0899\0820.Short Encoding of Words\Solution.py
9 1 1
A
solution\0400-0499\0482.License Key Formatting\Solution.cpp
9 1 -
A
solution\0600-0699\0691.Stickers to Spell Word\Solution.py
9 1 -
A
solution\0500-0599\0555.Split Concatenated Strings\Solution.java
9 1 -
A
solution\0900-0999\0927.Three Equal Parts\Solution.cpp
9 1 -
A
solution\0400-0499\0402.Remove K Digits\Solution.java
9 1 -
A
solution\0500-0599\0556.Next Greater Element III\Solution.java
9 1 2
A
solution\0600-0699\0604.Design Compressed String Iterator\Solution.py
9 1 -
A
solution\0400-0499\0402.Remove K Digits\Solution.cpp
9 1 -
A
solution\2300-2399\2385.Amount of Time for Binary Tree to Be Infected\Solution.ts
9 1 -
A
solution\2300-2399\2385.Amount of Time for Binary Tree to Be Infected\Solution.cpp
9 1 -
A
solution\2300-2399\2384.Largest Palindromic Number\Solution.java
9 1 -
A
solution\2300-2399\2376.Count Special Integers\Solution.py
9 1 -
A
solution\2100-2199\2146.K Highest Ranked Items Within a Price Range\Solution.py
9 1 -
A
solution\2300-2399\2344.Minimum Deletions to Make Array Divisible\Solution.java
9 1 -
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.java
9 1 -
A
solution\0400-0499\0403.Frog Jump\Solution.py
9 1 -