main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0900-0999\0935.Knight Dialer\Solution.go
 1 -
A
solution\0600-0699\0643.Maximum Average Subarray I\Solution.py
2 1 -
A
solution\0900-0999\0935.Knight Dialer\Solution.py
3 1 -
A
solution\0900-0999\0966.Vowel Spellchecker\Solution.cpp
0 1 -
A
solution\0900-0999\0937.Reorder Data in Log Files\Solution.py
1 1 -
A
solution\0600-0699\0645.Set Mismatch\Solution.cpp
7 1 -
A
solution\0900-0999\0938.Range Sum of BST\Solution.cpp
0 1 -
A
solution\0400-0499\0461.Hamming Distance\Solution.java
1 1 -
A
solution\0900-0999\0975.Odd Even Jump\Solution.py
6 1 -
A
solution\0900-0999\0975.Odd Even Jump\Solution.java
9 1 -
A
solution\0900-0999\0953.Verifying an Alien Dictionary\Solution.ts
7 1 -
A
solution\0900-0999\0948.Bag of Tokens\Solution.go
 1 -
A
solution\0900-0999\0946.Validate Stack Sequences\Solution.py
4 1 -
A
solution\0900-0999\0945.Minimum Increment to Make Array Unique\Solution.py
3 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.ts
1 1 -
A
solution\0300-0399\0337.House Robber III\Solution.py
1 1 -
A
solution\0300-0399\0374.Guess Number Higher or Lower\Solution.cs
3 1 -
A
solution\0400-0499\0442.Find All Duplicates in an Array\Solution.py
5 1 -
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.ts
2 1 -
A
solution\0800-0899\0869.Reordered Power of 2\Solution.cpp
0 1 -