January 20th, 2009 12:07 PM
it is not an assignment but a trial to teach myself java.
I found this question but didn't find the answer.. I know how to find the longest substring if it starts at the end of x2 using indexOf and...
January 20th, 2009 09:50 AM
x1, x2 are two strings. you should find what is the length of the largest substring of x2 containing only letters from x1. For example: if x1="abc" and x2="cvbaacdab" the answer will be 4 because...
January 20th, 2009 09:49 AM
x1, x2 are two strings. you should find what is the length of the largest substring of x2 containing only letters from x1. For example: if x1="abc" and x2="cvbaacdab" the answer will be 4 because...
January 14th, 2009 05:42 AM
does it work anyway or it depends if the numbers are positive or negative?
can you describe the algo? thanks
January 14th, 2009 02:27 AM
I there an O(n) algorithm for finding minimal distance between numbers in an one dimensional array? Does it matter if all the numbers are positive or negative? The array is not sorted
