[algogeeks] Re: 10 digit problem

i don't think another answer 50 is best answer according to your constraints may sum1 else can think but i found its correct Thanks Shashank -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to

[algogeeks] [brain teaser ] 14march

* Riddle Problem Solution* ** * *The part of the bird that is not in the sky, which can swim in the ocean and always stay dry. *Update Your Answers at *: Click Herehttp://dailybrainteaser.blogspot.com/2011/03/14march.html Solution: Will be updated after 1 day -- Never

Re: [algogeeks] [brain teaser ] 14march

Wood On Mon, Mar 14, 2011 at 1:45 PM, Lavesh Rawat lavesh.ra...@gmail.comwrote: * Riddle Problem Solution* ** * *The part of the bird that is not in the sky, which can swim in the ocean and always stay dry. *Update Your Answers at *: Click

Re: [algogeeks] [brain teaser ] 14march

shadow... Regards, Akash Agrawal http://tech-queries.blogspot.com/ On Mon, Mar 14, 2011 at 1:57 PM, Praveen praveen200...@gmail.com wrote: Wood On Mon, Mar 14, 2011 at 1:45 PM, Lavesh Rawat lavesh.ra...@gmail.comwrote: * Riddle Problem Solution* ** * *The part of the bird that is not

Re: [algogeeks] Re: Given an integer n , you have to print all the ways in which n can be represented as sum of positive integers

@sukhmeet: plz explain ur method if the no is 50 On Sun, Mar 13, 2011 at 8:24 PM, sukhmeet singh sukhmeet2...@gmail.comwrote: I think it can be done like this that assume that the number is represented as 1.. like 4= , 3= 111 ans so on now if u have to fint the total number of ways then

Re: [algogeeks] SPoj maximum sum subseuence

@ankur: can u plz xplain ur approach?? On Sun, Mar 13, 2011 at 12:26 PM, Ankur Khurana ankur.kkhur...@gmail.comwrote: https://www.spoj.pl/problems/MAXSUMSQ/ Hi in above problem , i am getting TLE but according to given contraints , i think my code is good enough to run. Can any body help me

Re: [algogeeks] Re: Given an integer n , you have to print all the ways in which n can be represented as sum of positive integers

Use DP -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group

Re: [algogeeks] Link list Problem

Are you sure that node is not exit in Link list and also memory is free? On Sun, Mar 13, 2011 at 9:57 AM, abhijith reddy abhijith200...@gmail.comwrote: copy data from the next node and then delete that next node. Say you need to delete 3 1 - 2 - 3 - 4 - 5 1 - 2 - 4 - 4 - 5

[algogeeks] Need immediately Hyperion Developer -- MA -- Need GC or US Citizen Only !!!!!

Dear Folks, Wishes for the Day !!! We Need consultant for Hyperion Developer Please share suitable profiles to s...@panzersolutions.com *Job Title : Hyperion Developer Location : Waltham, MA Duration : 6+Months Rate : Market Need GC or US Citizen Only !* Looking for a

[algogeeks] Re: Given an integer n , you have to print all the ways in which n can be represented as sum of positive integers

On Mar 11, 9:33 am, saurabh agrawal saurabh...@gmail.com wrote: Given an integer n , you have to print all the ways in which n can be represented as sum of positive integers I suggest you 1) generate the numeric partitions of n. That's the lists of numbers in sorted order whose

[algogeeks] Interesting Text Editor , Word Question

We have a text editor application where we can choose 1)between 100s of different fonts like arial, calibri, etc.. 2)different text sizes 3) different formatting such as bold, Italics, regular, etc.. Imagine that the application is similar to word(there we will have these options). Now give

[algogeeks] Need Java Developer with UI Exp -- OH

Dear Folks, Wishes for the Day !!! We Need consultant for Java Developer with UI Exp Please share suitable profiles to s...@panzersolutions.com *Job Title : ** Java Developer with UI Exp* *Location : Columbus, OH Duration : 6 Months Rate : $45/Hr* Java developer that is

Re: [algogeeks] SPoj maximum sum subseuence

i used the following code.. getting wa #includeiostream #includealgorithm #includevector #includelimits.h #includemap using namespace std; typedef unsigned long long int ull; int main() { int t; cint; while(t--) { int n,sm=0; scanf(%d,n); vectorint v(n); mapint,int mp; for(int i=0;in;i++)

Re: [algogeeks] [brain teaser ] 14march

shadow :) -- Dabendra Singh -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more

[algogeeks] Need immediately Oracle DBA -- Boston,MA (Only Local to MA)

Dear Folks, Wishes for the Day !!! We Need consultant for Oracle DBA Please share suitable profiles to s...@panzersolutions.com *Job Title : Oracle DBA Location : Boston,MA (Only Local to MA) Duration : 6 Months Rate : Market* Need Oracle DBA consultants who are local to MA

[algogeeks] Re: Spoj Problem : String based

Could you please explain ..whts the difference b/w KMP Algorithm and This problem. KMP also finds all occurrences of a string in text -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to

[algogeeks] Need Exp IT Recruiters for our offshore office

*Need Exp IT Recruiters for our offshore office.* We are currently looking for exp IT Recruiters (No Sales please) who has 6 Months to 2 years of exp and are has good exp with the pro’s and con’s of IT Field for our offshore office in Abids, Hyderabad. If interested please send me the resumes to

[algogeeks] Need Business Intelligence Administrator /Developer // IL // EAD, US Citizen or Green Card Only !!!!!

Dear Folks, Wishes for the Day !!! We Need consultant for Business Intelligence Administrator /Developer Please share suitable profiles to s...@panzersolutions.com *Job Title : Business Intelligence Administrator /Developer Location : Evanston, IL Duration : 3+ Month Rate :

[algogeeks] Very Very HOT// HOT // HOT Need Oracle Forms Developer -- Pittsburgh, PA ( Only Local to PA)

Dear Folks, Wishes for the Day !!! We Need consultant for Oracle Forms Developer Please share suitable profiles to s...@panzersolutions.com *Job Title : Oracle Forms Developer Location : Pittsburgh, PA Duration : 6 – 12 months Rate : Market* Urgent need for: Oracle Forms

[algogeeks] Need ETL Informatica Developer // Boston, MA //

Dear Folks, Wishes for the Day !!! We Need consultant for ETL Informatica Developer Please share suitable profiles to s...@panzersolutions.com *Job Title : ETL Informatica Developer Location : Boston, MA Duration : 6 +Months Rate : $ 50/Hr* *Must Have : Must have HealthCare

[algogeeks] Need SAP Basis Administrator -- Birmingham AL

Dear Folks, Wishes for the Day !!! We Need consultant for SAP Basis Administrator Please share suitable profiles to s...@panzersolutions.com *Job Title : SAP Basis Administrator Location : Birmingham AL Duration : 6 Months Rate : Market* SAP Basis Administrator for 6

Re: [algogeeks] Re: Given an integer n , you have to print all the ways in which n can be represented as sum of positive integers

My approach : partition(n) = 1 + partition(n-1) 2+partition(n-2) 3+partition(n-3) .. .. n-1+partition(1) n Assuming 1+2 and 2+1 as different. On Mon, Mar 14, 2011 at 11:53 PM, Aviral Gupta aviral@gmail.com wrote: you can use coin change problem as one of the solutions. Regards

Re: [algogeeks] Re: Spoj Problem : String based

I don't Know what's KMP algorithm..i am just trying to solve this problem on my own On Tue, Mar 15, 2011 at 1:55 AM, ritu ritugarg.c...@gmail.com wrote: Could you please explain ..whts the difference b/w KMP Algorithm and This problem. KMP also finds all occurrences of a string