Jocodoma

[LeetCode] 0053 Maximum Subarray

Posted on 2019-08-04 Edited on 2019-08-03 In Interview , Coding Problems , LeetCode Disqus:
Symbols count in article: 1.1k Reading time ≈ 1 mins.

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Example:

Input: [-2, 1, -3, 4, -1, 2, 1, -5, 4]
Output: 6
Explanation: [4, -1, 2, 1] has the largest sum = 6.

Follow up:
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

Posted on 2019-08-03 In Interview , Coding Problems , LeetCode Disqus:
Symbols count in article: 894 Reading time ≈ 1 mins.

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

Example:

Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4

Posted on 2019-08-02 In Interview , Coding Problems , LeetCode Disqus:
Symbols count in article: 1.2k Reading time ≈ 1 mins.

Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[‘ and ‘]’, determine if the input string is valid.

An input string is valid if:

Note that an empty string is also considered valid.

Posted on 2019-08-01 In Interview , Coding Problems , LeetCode Disqus:
Symbols count in article: 2.4k Reading time ≈ 2 mins.

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

Posted on 2019-06-10 In Website , Google Cloud VM Disqus:
Symbols count in article: 986 Reading time ≈ 1 mins.

To enable HTTPS and obtain SSL/TLS certificate by Let’s Encrypt for Google Cloud VM.

References: