LintCode
LintCode-109. Triangle Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. Notice Bonus point if you are able to do this using only O(n) extra space, where n is the total number of rows
LintCode
LintCode-111.Climbing Stairs You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Example Given an example n=3 , 1+1+1=2+1=
LintCode
LintCode-392.House Robber You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it will automatically contact the police if
LintCode
LintCode-511.Swap Two Nodes in Linked List Given a linked list and two values v1 and v2. Swap the two nodes in the linked list with values v1 and v2. It's guaranteed there is no duplicate values in the linked list. If v1 or v2 does not exist
LintCode
LintCode-186.Max Points on a Line Given n points on a 2D plane, find the maximum number of points that lie on the same straight line. Example Given 4 points: (1,2), (3,6), (0,0), (1,3). The maximum number is 3. /** * Definition for a point. * class Point { * int
LintCode
LintCode-46. Majority Number Given an array of integers, the majority number is the number that occurs more than half of the size of the array. Find it. Example Given [1, 1, 1, 1, 2, 2, 2], return 1 Challenge O(n) time and O(1) extra space This problem could
LintCode
LintCode-138.Subarray Sum Given an integer array, find a subarray where the sum of numbers is zero. Your code should return the index of the first number and the index of the last number. Notice: There is at least one subarray that it's sum equals to zero. Have
LintCode
LintCode-387.The Smallest Difference Given two array of integers(the first array is array A, the second array is array B), now we are going to find a element in array A which is A[i], and another element in array B which is B[j], so that the difference
LintCode
LintCode-144.Interleaving Positive and Negative Numbers Given an array with positive and negative integers. Re-range it to interleaving with positive and negative integers. Notice: You are not necessary to keep the original order of positive integers or negative integers. Example: Given [-1, -2, -3, 4, 5, 6], after re-range, it
LintCode
LintCode-171.Anagrams Given an array of strings, return all groups of strings that are anagrams. Notice: All inputs will be in lower-case. Example Given ["lint", "intl", "inlt", "code"], return ["lint", "inlt", "intl"]. Given ["ab"
LintCode
LintCode-55.Compare Strings Compare two strings A and B, determine whether A contains all of the characters in B. The characters in string A and B are all Upper Case letters. Notice: The characters of B in A are not necessary continuous or ordered. Example: For A = "ABCD"
LintCode
LintCode-158.Two Strings Are Anagrams Write a method anagram(s,t) to decide if two strings are anagrams or not. Clarification: What is Anagram? * Two strings are anagram if they can be the same after change the order of characters. Example: Given s = "abcd", t = "dcab"
