main
leetcode-free-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0400-0499\0412.Fizz Buzz\Solution.py
5 1 -
A
solution\2000-2099\2064.Minimized Maximum of Products Distributed to Any Store\Solution.cpp
5 1 -
A
solution\2300-2399\2347.Best Poker Hand\Solution.ts
5 1 -
A
solution\2300-2399\2345.Finding the Number of Visible Mountains\Solution.py
5 1 1
A
solution\2100-2199\2150.Find All Lonely Numbers in the Array\Solution.ts
5 1 -
A
solution\0800-0899\0883.Projection Area of 3D Shapes\Solution.py
5 1 -
A
solution\2500-2599\2576.Find the Maximum Number of Marked Indices\Solution.py
5 1 -
A
solution\0800-0899\0811.Subdomain Visit Count\Solution.py
5 1 -
A
solution\2300-2399\2342.Max Sum of a Pair With Equal Sum of Digits\Solution.cpp
5 1 -
A
solution\0800-0899\0878.Nth Magical Number\Solution.java
5 1 -
A
solution\2300-2399\2344.Minimum Deletions to Make Array Divisible\Solution.py
5 1 -
A
solution\2100-2199\2148.Count Elements With Strictly Smaller and Greater Elements\Solution.cpp
5 1 -
A
solution\0800-0899\0814.Binary Tree Pruning\Solution.cpp
5 1 -
A
solution\0800-0899\0814.Binary Tree Pruning\Solution.java
5 1 -
A
solution\0800-0899\0877.Stone Game\Solution.py
5 1 -
A
solution\0800-0899\0814.Binary Tree Pruning\Solution.py
5 1 -
A
solution\2100-2199\2139.Minimum Moves to Reach Target Score\Solution.cpp
5 1 -
A
solution\2100-2199\2139.Minimum Moves to Reach Target Score\Solution.java
5 1 -
A
solution\2100-2199\2139.Minimum Moves to Reach Target Score\Solution.py
5 1 -
A
solution\1000-1099\1004.Max Consecutive Ones III\Solution.cpp
5 1 -