How to Count Numbers with Unique Digits?
Given a non-negative integer n, please find out the number of integers that have the unique digits between [0, 10^n). For example, if n = 2, there are 91 …
Tag: math
Microsoft Interview Question – Compute the Area of the Triangle
The following seems an easy question, to get the area of the rectangluar triangle with the slope equals to 10 and the height equals to 6. If your answer …
Compute the Maximum Subarray via Dynamic Programming or Greedy Algorithms
Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array , the contiguous subarray has the largest …
Dynamic Programming – Integer Break
Dynamic Programming (DP) is one of the very important algorithm in Computer Science. Here is the simplest example of demonstrating the concept of DP if you want to tell …
C++ Dynamic Programming Algorithm to Compute the Largest Sum of Non-Adjacent Numbers in a Circular Array
After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time, …