main
leetcode-ion
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2000-2099\2079.Watering Plants\Solution.c
4 1 -
A
solution\2000-2099\2078.Two Furthest Houses With Different Colors\Solution.java
4 1 2
A
solution\2000-2099\2078.Two Furthest Houses With Different Colors\Solution.cpp
4 1 -
A
solution\2400-2499\2441.Largest Positive Integer That Exists With Its Negative\Solution.java
4 1 -
A
solution\0500-0599\0583.Delete Operation for Two Strings\Solution.ts
4 1 -
A
solution\0800-0899\0807.Max Increase to Keep City Skyline\Solution.ts
4 1 -
A
solution\2000-2099\2073.Time Needed to Buy Tickets\Solution.cpp
4 1 -
A
solution\2400-2499\2442.Count Number of Distinct Integers After Reverse Operations\Solution.java
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.c
4 1 -
A
solution\0800-0899\0812.Largest Triangle Area\Solution.java
4 1 -
A
solution\0300-0399\0328.Odd Even Linked List\Solution.cpp
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.java
4 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.py
4 1 -
A
solution\2000-2099\2064.Minimized Maximum of Products Distributed to Any Store\Solution.ts
4 1 1
A
solution\2000-2099\2064.Minimized Maximum of Products Distributed to Any Store\Solution.java
4 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.java
4 1 -
A
solution\0800-0899\0816.Ambiguous Coordinates\Solution.py
4 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.py
4 1 -
A
solution\0400-0499\0447.Number of Boomerangs\Solution.java
4 1 -
A
solution\0800-0899\0817.Linked List Components\Solution.ts
4 1 -