main
leetcode-machine
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0673.Number of Longest Increasing Subsequence\Solution.go
 1 -
A
solution\0900-0999\0981.Time Based Key-Value Store\Solution.go
 1 -
A
solution\2000-2099\2023.Number of Pairs of Strings With Concatenation Equal to Target\Solution.cpp
5 1 -
A
solution\0600-0699\0697.Degree of an Array\Solution.java
6 1 -
A
solution\2000-2099\2023.Number of Pairs of Strings With Concatenation Equal to Target\Solution.java
4 1 -
A
solution\0300-0399\0324.Wiggle Sort II\Solution.java
3 1 -
A
solution\2000-2099\2024.Maximize the Confusion of an Exam\Solution.go
 1 -
A
solution\0600-0699\0698.Partition to K Equal Sum Subsets\Solution.cpp
8 1 -
A
solution\0900-0999\0982.Triples with Bitwise AND Equal To Zero\Solution.cpp
0 1 -
A
solution\0600-0699\0673.Number of Longest Increasing Subsequence\Solution.java
8 1 -
A
solution\0900-0999\0982.Triples with Bitwise AND Equal To Zero\Solution.go
 1 -
A
solution\0900-0999\0982.Triples with Bitwise AND Equal To Zero\Solution.java
7 1 -
A
solution\0400-0499\0496.Next Greater Element I\Solution.go
 1 -
A
solution\0600-0699\0673.Number of Longest Increasing Subsequence\Solution.py
8 1 -
A
solution\0900-0999\0983.Minimum Cost For Tickets\Solution.cpp
0 1 -
A
solution\0900-0999\0983.Minimum Cost For Tickets\Solution.go
 1 -
A
solution\0600-0699\0674.Longest Continuous Increasing Subsequence\Solution.go
 1 -
A
solution\0900-0999\0983.Minimum Cost For Tickets\Solution.java
8 1 -
A
solution\0900-0999\0983.Minimum Cost For Tickets\Solution.ts
4 1 -
A
solution\0300-0399\0375.Guess Number Higher or Lower II\Solution.cpp
4 1 -