The Mindscaping Inc.
Saturday, January 2, 2016
316. Remove Duplicate Letters
›
Given a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. You must mak...
315. Count of Smaller Numbers After Self
›
You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is...
313. Super Ugly Number
›
Write a program to find the n th super ugly number. Super ugly numbers are positive numbers whose all prime factors are in the given pri...
312. Burst Balloons
›
Given n balloons, indexed from 0 to n-1 . Each balloon is painted with a number on it represented by array nums . You are asked to bu...
310. Minimum Height Trees
›
For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all pos...
309. Best Time to Buy and Sell Stock with Cooldown
›
Say you have an array for which the i th element is the price of a given stock on day i . Design an algorithm to find the maximum prof...
307. Range Sum Query - Mutable
›
Given an integer array nums , find the sum of the elements between indices i and j ( i ≤ j ), inclusive. The update(i, val) funct...
›
Home
View web version