The original question can be found here. The question is asking us to the minimum length of subarray that it’s sum is no less than target value. Brute Force The brute force we can immediately think of is to enumerate…
The original question can be found here. The question is asking us to find 2 numbers that their sum equals to target value, and exlictly, we cannot use data structures. So we cannot use hash table as in Leetcode 1:…
The original question can be found here. This question is asking to find the mimimum element in a rotated sorted array. But before tackling this question, I strongly suggest you to look at this question if you haven’t already. However,…
The original question can be found here. The question is asking us to check if target is in a rotated sorted array. Here the array can have duplicate numbers. Brute Force The brute force solution is scanning the whole array…
The original question can be found here. The question is asking us to find the target element in a 2-dimensional array. Each row is greater than the row above it. Within each row, elements are sorted as well. Brute Force…
The original question can be found here. The question is asking for a specific target value, if it exists in the array, return the index. Otherwise, return the index position that it should be inserted. Brute Force We just iterate…