main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0700-0799\0763.Partition Labels\Solution.ts
3 1 -
A
solution\2400-2499\2439.Minimize Maximum of Array\Solution.py
3 1 -
A
solution\2400-2499\2436.Minimum Split Into Subarrays With GCD Greater Than One\Solution.ts
3 1 -
A
solution\2400-2499\2436.Minimum Split Into Subarrays With GCD Greater Than One\Solution.cpp
3 1 -
A
solution\2400-2499\2435.Paths in Matrix Whose Sum Is Divisible by K\Solution.ts
3 1 -
A
solution\2000-2099\2048.Next Greater Numerically Balanced Number\Solution.py
3 1 -
A
solution\0300-0399\0312.Burst Balloons\Solution.ts
3 1 -
A
solution\2200-2299\2208.Minimum Operations to Halve Array Sum\Solution.cpp
3 1 -
A
solution\0900-0999\0935.Knight Dialer\Solution.py
3 1 -
A
solution\0700-0799\0776.Split BST\Solution.js
3 1 -
A
solution\2200-2299\2208.Minimum Operations to Halve Array Sum\Solution.java
3 1 -
A
solution\0900-0999\0933.Number of Recent Calls\Solution.java
3 1 1
A
solution\2200-2299\2207.Maximize Number of Subsequences in a String\Solution.java
3 1 -
A
solution\2400-2499\2429.Minimize XOR\Solution.cpp
3 1 -
A
solution\2200-2299\2207.Maximize Number of Subsequences in a String\Solution.cpp
3 1 -
A
solution\0700-0799\0783.Minimum Distance Between BST Nodes\Solution.cpp
3 1 -
A
solution\0700-0799\0783.Minimum Distance Between BST Nodes\Solution.java
3 1 -
A
solution\0700-0799\0784.Letter Case Permutation\Solution.cpp
3 1 -
A
solution\2400-2499\2429.Minimize XOR\Solution.java
3 1 -
A
solution\2200-2299\2208.Minimum Operations to Halve Array Sum\Solution.py
3 1 -