摘要：(找到连续的 subarray 和等于 k （不需要 k 的倍数) https://github.com/tongzhang1994/Facebook-Interview-Coding/blob/master/Subarray%20Sum.java Given a list of non-negat 阅读全文

摘要：Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and 1. Example 1: Input: [0,1] Output: 2 Explanation: [0 阅读全文

摘要：Given an array nums and a target value k, find the maximum length of a subarray that sums to k. If there isn't one, return 0 instead. Note:The sum of 阅读全文

摘要：练习把start 和end 的index打印出来。。 类似LC560，还要简单，只需要返回true/false就行。follow up: overflow如何解决 Given an array of integers and an integer k, you need to find the to 阅读全文

摘要：Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive. Example: 阅读全文