main
leetcode-coffeescript
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0900-0999\0935.Knight Dialer\Solution.java
5 1 -
A
solution\0900-0999\0938.Range Sum of BST\Solution.java
5 1 -
A
solution\2400-2499\2411.Smallest Subarrays With Maximum Bitwise OR\Solution.py
5 1 -
A
solution\0900-0999\0983.Minimum Cost For Tickets\Solution.cpp
5 1 -
A
solution\0300-0399\0354.Russian Doll Envelopes\Solution.cpp
5 1 -
A
solution\2400-2499\2409.Count Days Spent Together\Solution.java
5 1 -
A
solution\2400-2499\2410.Maximum Matching of Players With Trainers\Solution.cpp
5 1 -
A
solution\2400-2499\2409.Count Days Spent Together\Solution.cpp
5 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.c
5 1 -
A
solution\2400-2499\2412.Minimum Money Required Before Transactions\Solution.cpp
5 1 -
A
solution\2400-2499\2410.Maximum Matching of Players With Trainers\Solution.java
5 1 -
A
solution\2200-2299\2222.Number of Ways to Select Buildings\Solution.java
5 1 -
A
solution\0300-0399\0390.Elimination Game\Solution.java
5 1 -
A
solution\2200-2299\2222.Number of Ways to Select Buildings\Solution.cpp
5 1 -
A
solution\0300-0399\0333.Largest BST Subtree\Solution.cpp
5 1 -
A
solution\0300-0399\0390.Elimination Game\Solution.py
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\0900-0999\0948.Bag of Tokens\Solution.cpp
5 1 -