http://en.wikipedia.org/wiki/Subset_sum_problem
On Dec 25, 10:52 pm, radha krishnan radhakrishnance...@gmail.com
wrote:
This s similar to the problemhttps://www.spoj.pl/problems/SUBSUMS/
we have to split the array into 2 arrays
say A,B
generate all subsets of each array(both A and B) and
Read each file word by word and insert into a Suffix Tree...
Terminal node of each word contains the FileNo/FileName...
Quite simple
On Dec 14, 5:42 pm, Tuaa vention.goth...@gmail.com wrote:
According to me, the problem is regarding fastest search of
substrings..
Hashing is one of the
Hi Can you explain following with an example
esign an
e cient al-gorithm to determine the minimum number of palindromes in
adecomposition for a given string,
are you asking to find the longest palindrome ?
-Arif
On Nov 16, 11:51 pm, lichenga2404 lichenga2...@gmail.com wrote:
A palindrome is a
