A collection of LeetCode novel solutions that is implemented in Java. It would support you to solve the problems from easy to hard by the simplest ways. 1 Two Sum Medium Java 1. Hash O(n) and O(n) ...

I found this problem was interesting because of one condition: the same characters must be together (see example 2). In the beginning I was trying to use 2 stack to solve this, but it turns out stack ...