[algogeeks] Re: binary search for Linked List?

We can study about Skip list from wiki or so, Assuming that there are no duplicate elements, do we fetch anything from the skp list? Priya, What is the complexity of binary search on skip list with and without duplicate elements. And in what way it would be better than arrays? The whole

[algogeeks] [brain teaser ]11march

*Game Show Problem(Old One) Solution* * *You are on a game show and there are three doors. The presenter tells you that behind one of doors there is a car and behind the other two are goats, if you pick the car you win it. After you have picked a door the presenter opens a different door with a

[algogeeks] Re: algo for mirror a tree

can u elaborate a bit ?? with sm example if possible On Mar 11, 4:52 am, priyank desai priyankd...@gmail.com wrote: Do a post order traversal of the tree and swap its child instead of printing the node values. On Mar 10, 8:19 am, Subhransupanigrahi subhransu.panigr...@gmail.com wrote:

Re: [algogeeks] Re: binary search for Linked List?

http://en.wikipedia.org/wiki/Skip_list hope it helps :) On Fri, Mar 11, 2011 at 2:20 PM, kumar vr kumarg...@gmail.com wrote: We can study about Skip list from wiki or so, Assuming that there are no duplicate elements, do we fetch anything from the skp list? Priya, What is the complexity

Re: [algogeeks] SPOJ PROBLEM

any test case where this fails by using brute force approach? like this one if c[l]=c[r] then take c[l]*a and l++; else choose c[r]*a and r--; this is o(n) solution. any test case where it fails?? On Thu, Mar 10, 2011 at 11:40 AM, Amol Sharma amolsharm...@gmail.comwrote: Bhaukali Launde !!

[algogeeks] Need Immediately Cognos Report Developer -- Cincinnati ,OH !!!!!

Dear Folks, Wishes for the Day !!! We Need consultant for Cognos Report Developer Please share suitable profiles to s...@panzersolutions.com *Job Title : Cognos Report Developer Location : Cincinnati ,OH Duration : 2 Months Rate : $55/Hr* Need someone who can develop 10

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

Given an integer n , you have to print all the ways in which n can be represented as sum of positive integers -- 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

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

This is a good place to use recursion. One thing you have to know is whether order matters. E.g., are 2 + 1 and 1 + 2 the same or different ways to represent 3 as a sum of positive integers. This choice will affect the way you write the recursive function. Dave On Mar 11, 9:33 am, saurabh

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

Do it assuming as two cases. On Fri, Mar 11, 2011 at 9:46 PM, Dave dave_and_da...@juno.com wrote: This is a good place to use recursion. One thing you have to know is whether order matters. E.g., are 2 + 1 and 1 + 2 the same or different ways to represent 3 as a sum of positive integers. This

[algogeeks] Need Immediately PeopleSoft Business Analyst -- Washington, DC

Dear Folks, Wishes for the Day !!! We Need consultant for PeopleSoft Business Analyst Please share suitable profiles to s...@panzersolutions.com *Job Title : PeopleSoft Business Analyst Location : Washington, DC Duration : 5 months Rate : $50/Hr* PeopleSoft Business Analyst

Re: [algogeeks] Print Hello infinite..................

int main(void) { inf_times: printf(Hello); goto inf_times; return 0; } On Fri, Mar 11, 2011 at 7:46 PM, UMESH KUMAR kumar.umesh...@gmail.comwrote: Hi my question is without Loop and Recursion function using??? On Fri, Mar 11, 2011 at 5:40 AM, Abhishek Mallick

[algogeeks] Need SQL DBA -- FL -- US Citizen or Green Card holde Only !!!!!

Dear Folks, Wishes for the Day !!! We Need consultant for SQL DBA Please share suitable profiles to s...@panzersolutions.com *Job Title : SQL DBA Location : Miamai,FL Duration : 6 Months Rate : Market US Citizen or Green Card holde Only !* SQL DBA: Production Support of

[algogeeks] spoj problem

CAN ANYONE PLEASE TELL ME WHICH TEST CASE IS WRONG . PROBLEM:https://www.spoj.pl/problems/STREETR/ #includestdio.h main() { long long int n,i,ans,k,flag,m,a[100100],d; scanf(%lld,n); for(i=0;in;i++) { scanf(%lld,a[i]); } d=a[1]-a[0]; m=1;

[algogeeks] Need immediately Biztalk Administrator -- Miami, FL -- US Citizen or Green Card holde Only !!!!!

Dear Folks, Wishes for the Day !!! We Need consultant for Biztalk Administrator Please share suitable profiles to s...@panzersolutions.com *Job Title : Biztalk Administrator Location : Miami, FL Duration : 6 Months Rate : Market US Citizen or Green Card holde Only !*

[algogeeks] Need immediately Java Flex developer -- NY !!!!!

Dear Folks, Wishes for the Day !!! We Need consultant for Java Flex developer Please share suitable profiles to s...@panzersolutions.com *Job Title : Java Flex developer Location : NYC, NY Duration : 12 Months Rate : Market* NOTE: FINANCIAL INDUSTRY BACKGROUND IS HIGHLY

Re: [algogeeks] spoj problem

Try with trees at 1 3 and 5. Gives wrong output: http://ideone.com/KHUdT And after you fix that if you still get TLE, there is a simpler way to solve this. Thanks, Balaji. On Sat, Mar 12, 2011 at 12:55 AM, UTKARSH SRIVASTAV usrivastav...@gmail.com wrote: CAN ANYONE PLEASE TELL ME WHICH TEST

[algogeeks] Interesting Toughest Problem On Telephone PC ..

Hy Guys I want to do . for any phone number .. the program should print out all the possible strings it represents. For eg.) 2 in the number can be replaced by 'a' or 'b' or 'c', 3 by 'd' 'e' 'f' etc. In this way how many possible permutations can be formed from a given phone number. I don't want

Re: [algogeeks] spoj problem

is case main answer 0 hona chahiye. -- Satyam Kapoor B.Tech 2nd year Computer Science And Engineering M.N.N.I.T ALLAHABAD -- 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