This is the list of my accepted LeetCode solutions in Java for more than 150 problems (as of 01/03/2020).
- The first column is the index number of each question in LeetCode.
- The second column is the name of the problem. It is linked to each problem page in LeetCode.
- The third column shows the problem's difficulty in LeetCode.
- The forth column has my solutions for each problem. Each solution is linked to my Java code in this repository. The list of abbreviations in this section is provided bellow.
- The fifth column shows the link to the JUnit test cases for the problem. "-" means I have not created test cases for the problem yet.
- The last column is the date when I solved the problem last time.
DP = Dynamic Programming
D&C = Divide and Conquer
DFS = Depth First Search
BFS = Breadth First Search
* = problems that can be improved in time or space complexity.
** = problems that I should revisit in the future because I spent too long on solving it.
*** = problems that have follow-up or different approaches.
^ = problems that I like.
- Solved 150 problems (as of 01/03/2020).
- Solved 100 problems (as of 10/29/2019).