main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0325.Maximum Size Subarray Sum Equals k\Solution.java
4 1 -
A
solution\0700-0799\0753.Cracking the Safe\Solution.java
4 1 -
A
solution\0500-0599\0528.Random Pick with Weight\Solution.js
4 1 -
A
solution\0700-0799\0757.Set Intersection Size At Least Two\Solution.py
4 1 -
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.java
4 1 -
A
solution\2200-2299\2270.Number of Ways to Split Array\Solution.java
4 1 -
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.py
4 1 1
A
solution\2200-2299\2269.Find the K-Beauty of a Number\Solution.java
4 1 -
A
solution\0700-0799\0763.Partition Labels\Solution.cpp
4 1 -
A
solution\0700-0799\0763.Partition Labels\Solution.java
4 1 -
A
solution\2200-2299\2268.Minimum Number of Keypresses\Solution.java
4 1 -
A
solution\2200-2299\2268.Minimum Number of Keypresses\Solution.cpp
4 1 -
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.cpp
4 1 -
A
solution\0500-0599\0532.K-diff Pairs in an Array\Solution.java
4 1 -
A
solution\2200-2299\2265.Count Nodes Equal to Average of Subtree\Solution.java
4 1 -
A
solution\0700-0799\0776.Split BST\Solution.java
4 1 -
A
solution\2300-2399\2358.Maximum Number of Groups Entering a Competition\Solution.cpp
4 1 -
A
solution\2200-2299\2263.Make Array Non-decreasing or Non-increasing\Solution.cpp
4 1 -
A
solution\2200-2299\2261.K Divisible Elements Subarrays\Solution.ts
4 1 -
A
solution\2200-2299\2261.K Divisible Elements Subarrays\Solution.py
4 1 -