Hi all,
This wil create copy rights violation. Please try to respect the authors note..
On 4/18/11, KK kunalkapadi...@gmail.com wrote:
Hey plzz mail me too..
On Apr 14, 9:29 am, Rajeev Kumar rajeevprasa...@gmail.com wrote:
check this
* sequence number puzzle
What is special about the following sequence of numbers?
8 5 4 9 1 7 6 10 3 2 0
*
*Update Your Answers at* : Click
Herehttp://dailybrainteaser.blogspot.com/2011/04/sequence-number-puzzle-18april.html?lavesh=lavesh
Solution:
Will be updated after 1 day
--
A funny one... until I figure out...
It contains all numbers from 0 to 10 :P
On Mon, Apr 18, 2011 at 1:58 PM, Lavesh Rawat lavesh.ra...@gmail.comwrote:
* sequence number puzzle
What is special about the following sequence of numbers?
8 5 4 9 1 7 6 10 3 2 0
*
*Update Your Answers at* :
given an array of elements (all elements are unique ) , given a sum
s find all the subsets having sum s.
for ex array {5,9,1,3,4,2,6,7,11,10}
sum is 10
possible subsets are {10}, {6,4} ,{7,3} {5,3,2}
{6,3,1} etc.there can be many more.
also find the total number of these
the numbers are sorted alphabetically .
'e'ight
'f'ive
'f'our
.
.
.
.
.
'z'ero
On Mon, Apr 18, 2011 at 2:11 PM, Vandana Bachani vandana@gmail.comwrote:
A funny one... until I figure out...
It contains all numbers from 0 to 10 :P
On Mon, Apr 18, 2011 at 1:58 PM, Lavesh Rawat
*Open a Company in Canada
You can Register your business in Canada You don’t need to go there. Ask us!
http://bit.ly/biZzwiz
http://bit.ly/biZzwiz
--
*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
can u please me also .. zeal_gosw...@yahoo.com
On Thu, Apr 14, 2011 at 11:50 AM, Himanshu Neema
potential.himansh...@gmail.com wrote:
Hi All ,
Yesterday I received an email from Author that this is *violation of
Intellectual Property Ownership* ,So kindly please delete pdfs please
remove
I think we can share into email...that will not be any issue. :)
On Mon, Apr 18, 2011 at 10:07 PM, Abhishek Goswami
zeal.gosw...@gmail.comwrote:
can u please me also .. zeal_gosw...@yahoo.com
On Thu, Apr 14, 2011 at 11:50 AM, Himanshu Neema
potential.himansh...@gmail.com wrote:
const int setSize = 20;
int set[setSize] =
{ 5,9,1,3,4,2,6,7,11,10,13,15,19,22,25,31,33,37,39,40};
const int sum = 150;
int rec[setSize];
int recCount = 0;
int subset=0;
void search(int *set, int setSize, int sum)
{
int i;
if (sum == 0)
{
printf(Subset %d:
Send to me too. Please. rgap...@gmail.com
2011/4/18 Abhishek Goswami zeal.gosw...@gmail.com
I think we can share into email...that will not be any issue. :)
On Mon, Apr 18, 2011 at 10:07 PM, Abhishek Goswami zeal.gosw...@gmail.com
wrote:
can u please me also ..
Please send it to me tooo agrvaib...@gmail.com
On Mon, Apr 18, 2011 at 10:30 PM, Rel Guzman Apaza rgap...@gmail.comwrote:
Send to me too. Please. rgap...@gmail.com
2011/4/18 Abhishek Goswami zeal.gosw...@gmail.com
I think we can share into email...that will not be any issue.
This essentially becomes a two pass algo
first find the parent and grand parent and find children of all the
siblings of the parent
Best Regards
Ashish Goel
Think positive and find fuel in failure
+919985813081
+919966006652
On Thu, Apr 14, 2011 at 9:53 AM, Dave dave_and_da...@juno.com
good work guys!
On Sat, Apr 16, 2011 at 8:57 AM, Kunal Patil kp101...@gmail.com wrote:
geeksforgeeks.org
BTW..
Thanks for creating this post...I have came across really nice sites that
interest me in above replies..
--
You received this message because you are subscribed to the Google
can you give some links pls
On Mon, Apr 18, 2011 at 9:02 PM, Venki venkatcollect...@gmail.com wrote:
It is called well known subset sum problem. Backtracking suits well
for such optimization problems. Read material on state space methods
of solving subset sum problem.
Regards,
Venki.
On
@Don thanks, nice one, but can u give a little bit of explanation.
On Mon, Apr 18, 2011 at 10:14 PM, Don dondod...@gmail.com wrote:
const int setSize = 20;
int set[setSize] =
{ 5,9,1,3,4,2,6,7,11,10,13,15,19,22,25,31,33,37,39,40};
const int sum = 150;
int rec[setSize];
int recCount = 0;
15 matches
Mail list logo
