Given an array of integers, find two non-overlapping subarrays which have the largest sum. The subarray should contain at least one number and the numbers in each subarray should be contiguous.

Problem 2: Maximum Subarray Difference

Given an array of integers, find two non-overlapping subarrays A and B, such that |SUM(A) - SUM(B)| is the largest.
The subarray should contain at least one number and the numbers in each subarray should be contiguous.
Calculate the largest difference.

2017-10-30

Algorithm

LintCode /A + B Problem

Problem Summary

Write a function that add two numbers A and B without using “+” or any arithmetic operators.

2017-10-27

Algorithm

LintCode/Longest Substring with At Most K Distinct Characters

Problem Summary

Given a string S and an integer K, find the length of the longest substring T that contains at most K distinct characters.

2017-10-23

Algorithm

LintCode/Largest Rectangle in Histogram

Problem Summary

Given N non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of the largest rectangle in the histogram.