摘要：A variation of 'maximum sum of subarray' - using hashmap 阅读全文

摘要：Play it in your mind.. or it may be hard to reach to this intuitive solution... 阅读全文

摘要：My first try was very close to a final solution .. however, this is a much neater solution: https://discuss.leetcode.com/topic/69436/concise-c-o-1-sol 阅读全文

摘要：Medium? Seriously? Well again, always smart solutions out there: https://discuss.leetcode.com/topic/77889/3-line-python-solution 阅读全文

摘要：Isn't it 'Easy'? 阅读全文