main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2376.Count Special Integers\Solution.py
9 1 -
A
solution\0400-0499\0457.Circular Array Loop\Solution.cpp
9 1 -
A
solution\0400-0499\0457.Circular Array Loop\Solution.java
9 1 -
A
solution\0500-0599\0531.Lonely Pixel I\Solution.py
9 1 -
A
solution\0300-0399\0310.Minimum Height Trees\Solution.java
9 1 -
A
solution\2100-2199\2111.Minimum Operations to Make the Array K-Increasing\Solution.java
9 1 -
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.java
9 1 -
A
solution\0700-0799\0785.Is Graph Bipartite\Solution.cpp
9 1 -
A
solution\0700-0799\0785.Is Graph Bipartite\Solution.java
9 1 -
A
solution\0500-0599\0592.Fraction Addition and Subtraction\Solution.java
9 1 -
A
solution\0300-0399\0310.Minimum Height Trees\Solution.py
9 1 -
A
solution\2100-2199\2106.Maximum Fruits Harvested After at Most K Steps\Solution.cpp
9 1 -
A
solution\2100-2199\2106.Maximum Fruits Harvested After at Most K Steps\Solution.java
9 1 -
A
solution\0600-0699\0677.Map Sum Pairs\Solution.java
9 1 2
A
solution\2400-2499\2402.Meeting Rooms III\Solution.cpp
9 1 -
A
solution\2100-2199\2106.Maximum Fruits Harvested After at Most K Steps\Solution.py
9 1 -
A
solution\0700-0799\0778.Swim in Rising Water\Solution.py
9 1 -
A
solution\0500-0599\0531.Lonely Pixel I\Solution.java
9 1 -
A
solution\0600-0699\0678.Valid Parenthesis String\Solution.cpp
9 1 -
A
solution\0600-0699\0604.Design Compressed String Iterator\Solution.py
9 1 -