LintCode
LintCode-45.Maximum Subarray Difference Given an array with integers. Find two non-overlapping subarrays A and B, which |SUM(A) - SUM(B)| is the largest. Return the largest difference. Notice: The subarray should contain at least one number Example: For [1, 2, -3, 1], return 6. Challenge: O(n) time
LintCode
LintCode-42.Maximum Subarray II Given an array of integers, find two non-overlapping subarrays which have the largest sum. The number in each subarray should be contiguous. Return the largest sum. Notice: The subarray should contain at least one number Example: For given [1, 3, -1, 2, -1, 2], the two
LintCode
LintCode-151.Best Time to Buy and Sell Stock III Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete at most two transactions. Notice: You may not engage in
LintCode
LintCode-373.Partition Array by Odd and Even Partition an integers array into odd number first and even number second. Example: Given [1, 2, 3, 4], return [1, 3, 2, 4] Challenge: Do it in-place. public class Solution { /** * @param nums: an array of integers * @return: nothing */ public void partitionArray(int[] nums)
LintCode
LintCode-363.Trapping Rain Water Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. Example: Given [0,1,0,2,1,0,1,3,2,1,2,1], return 6. Challenge: O(n)
LintCode
LintCode-533.Two Sum Closest Given an array nums of n integers, find two integers in nums such that the sum is closest to a given number, target. Return the difference between the sum of the two integers and the target. Example: Given array nums = [-1, 2, 1, -4], and target
LintCode
LintCode-229.Stack Sorting Sort a stack in ascending order (with biggest terms on top). You may use at most one additional stack to hold items, but you may not copy the elements into any other data structure (e.g. array). Given stack = | | |3| |1| |2| |4| return: | | |4| |3| |2|
LintCode
LintCode-72.Construct Binary Tree from Inorder and Postorder Traversal Given inorder and postorder traversal of a tree, construct the binary tree. Notice: You may assume that duplicates do not exist in the tree. Given inorder [1,2,3] and postorder [1,3,2], return a tree: 2 / \ 1 3 /** * Definition
LintCode
LintCode-41.Maximum Subarray Given an array of integers, find a contiguous subarray which has the largest sum. Notice: The subarray should contain at least one number. Given the array [−2,2,−3,4,−1,2,1,−5,3], the contiguous subarray [4,−1,2,1] has the largest sum = 6.
LintCode
LintCode-431.Find the Connected Component in the Undirected Graph Find the number connected component in the undirected graph. Each node in the graph contains a label and a list of its neighbors. (a connected component (or just component) of an undirected graph is a subgraph in which any two vertices
LintCode
LintCode-493.Implement Queue by Linked List II Implement a Queue by linked list. Provide the following basic methods: 1. push_front(item). Add a new item to the front of queue. 2. push_back(item). Add a new item to the back of the queue. 3. pop_front(). Move the
LintCode
LintCode-492.Implement Queue by Linked List Implement a Queue by linked list. Support the following basic methods: 1. enqueue(item). Put a new item in the queue. 2. dequeue(). Move the first item out of the queue, return it. This problem you need to check whether the queue is empty
