main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2201.Count Artifacts That Can Be Extracted\Solution.cpp
7 1 -
A
solution\0700-0799\0784.Letter Case Permutation\Solution.ts
2 1 -
A
solution\2200-2299\2201.Count Artifacts That Can Be Extracted\Solution.java
8 1 -
A
solution\2200-2299\2265.Count Nodes Equal to Average of Subtree\Solution.py
1 1 -
A
solution\2200-2299\2201.Count Artifacts That Can Be Extracted\Solution.ts
8 1 -
A
solution\0700-0799\0785.Is Graph Bipartite\Solution.go
 1 -
A
solution\2200-2299\2202.Maximize the Topmost Element After K Moves\Solution.go
 1 -
A
solution\0500-0599\0543.Diameter of Binary Tree\Solution.go
 1 -
A
solution\2200-2299\2289.Steps to Make Array Non-decreasing\Solution.cpp
4 1 -
A
solution\2200-2299\2288.Apply Discount to Prices\Solution.java
8 1 -
A
solution\2200-2299\2256.Minimum Average Difference\Solution.py
4 1 -
A
solution\2200-2299\2243.Calculate Digit Sum of a String\Solution.go
 1 -
A
solution\2200-2299\2237.Count Positions on Street With Required Brightness\Solution.cpp
4 1 -
A
solution\2200-2299\2227.Encrypt and Decrypt Strings\Solution.go
 1 -
A
solution\2200-2299\2225.Find Players With Zero or One Losses\Solution.py
5 1 -
A
solution\2200-2299\2224.Minimum Number of Operations to Convert Time\Solution.cpp
2 1 -
A
solution\2200-2299\2208.Minimum Operations to Halve Array Sum\Solution.go
 1 -
A
solution\0300-0399\0323.Number of Connected Components in an Undirected Graph\Solution.go
 1 -
A
solution\0700-0799\0704.Binary Search\Solution.go
 1 -
A
solution\2000-2099\2032.Two Out of Three\Solution.go
 1 -