main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2457.Minimum Addition to Make Integer Beautiful\Solution.java
5 1 -
A
solution\0900-0999\0931.Minimum Falling Path Sum\Solution.py
5 1 -
A
solution\0600-0699\0647.Palindromic Substrings\Solution.cpp
5 1 -
A
solution\0300-0399\0384.Shuffle an Array\Solution.java
5 1 -
A
solution\0300-0399\0320.Generalized Abbreviation\Solution.java
5 1 -
A
solution\0900-0999\0935.Knight Dialer\Solution.java
5 1 -
A
solution\2200-2299\2200.Find All K-Distant Indices in an Array\Solution.cpp
5 1 -
A
solution\0900-0999\0938.Range Sum of BST\Solution.java
5 1 -
A
solution\0400-0499\0467.Unique Substrings in Wraparound String\Solution.java
5 1 -
A
solution\2000-2099\2091.Removing Minimum and Maximum From Array\Solution.cpp
5 1 -
A
solution\0600-0699\0653.Two Sum IV - Input is a BST\Solution.java
5 1 -
A
solution\0600-0699\0654.Maximum Binary Tree\Solution.c
5 1 -
A
solution\0600-0699\0654.Maximum Binary Tree\Solution.cpp
5 1 -
A
solution\0600-0699\0654.Maximum Binary Tree\Solution.java
5 1 -
A
solution\0600-0699\0655.Print Binary Tree\Solution.cpp
5 1 -
A
solution\2100-2199\2150.Find All Lonely Numbers in the Array\Solution.java
5 1 -
A
solution\2400-2499\2452.Words Within Two Edits of Dictionary\Solution.ts
5 1 -
A
solution\2300-2399\2354.Number of Excellent Pairs\Solution.py
5 1 -
A
solution\2100-2199\2150.Find All Lonely Numbers in the Array\Solution.ts
5 1 -
A
solution\2400-2499\2452.Words Within Two Edits of Dictionary\Solution.cpp
5 1 -