Re: [algogeeks] ADOBE SOLUTIONS PARTNER Consulting Services -Increase your Digital Business with Infinate 360

Hi Mark, I will be available between 10 am to 4 pm tomorrow. So you can connect me any time in between. On Tue, 16 Jun 2020, 19:02 Pavan_DigitalTechnocryne, < pavan.mtech1...@gmail.com> wrote: > Hi , > > > > I am Mark from Infinate360 Consulting Services. Recently we saw your > linkedin profile

Re: [algogeeks] binary search tree over btree

. 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 at http://groups.google.com/group/algogeeks?hl=en. -- Regards Sanjiv Yadav MobNo.- 8050142693 Email

Re: [algogeeks] Re: m*n matrix, sorted rows, sorted columns, WAP to find an element efficiently

. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Regards Sanjiv Yadav MobNo.- 8050142693 Email Id- sanjiv2009...@gmail.com -- You received this message because you

Re: [algogeeks] Re: determining if frequency is greater than n/2

. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Regards Sanjiv Yadav MobNo.- 8050142693 Email Id- sanjiv2009...@gmail.com -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post

Re: [algogeeks] Array problem

u r right. On Mon, Mar 12, 2012 at 11:17 AM, atul anand atul.87fri...@gmail.comwrote: @sanjiv : wont work for this test case :- {1,5,3,6,2,7,8}; On Mon, Mar 12, 2012 at 10:54 AM, sanjiv yadav sanjiv2009...@gmail.comwrote: @atul anand- It will still work as follows

Re: [algogeeks] Array problem

/algogeeks?hl=en. -- Regards Sanjiv Yadav MobNo.- 8050142693 Email Id- sanjiv2009...@gmail.com -- 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

Re: [algogeeks] Array problem

email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Regards Sanjiv Yadav MobNo.- 8050142693 Email Id- sanjiv2009...@gmail.com -- You received this message because you are subscribed to the Google

Re: [algogeeks] Doubt in removing loop from linked list

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 at http://groups.google.com/group/algogeeks?hl=en. -- Regards Sanjiv Yadav MobNo

Re: [algogeeks] Doubt in removing loop from linked list

: p and z. if 2 pointers meet at some node x, different from q, in last step they must have met at x', the predecessor of x. the above logic holds for all nodes in cycle except q. @ sanjiv yadav: They will meet at the start of loop. ex. a-b-c-d-e-c-d-e... First round: A: a-b-c-d B: a-c-e

Re: [algogeeks] A strange doubt with cpp class. Why compile error ?

at http://groups.google.com/group/algogeeks?hl=en. -- Regards Sanjiv Yadav MobNo.- 8050142693 Email Id- sanjiv2009...@gmail.com -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks

Re: [algogeeks] Doubt in removing loop from linked list

s...@7fast@3 s...@4..fast@4... they are equal..means we are at start of loop. i got the algo...but didnt get the logichow they are meeting @start. On Fri, Mar 9, 2012 at 7:42 PM, sanjiv yadav sanjiv2009...@gmail.comwrote: suppose linked list is a-b-c-d-e and suppose loop

Re: [algogeeks] Re: Doubt in removing loop from linked list

from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Regards Sanjiv Yadav MobNo.- 8050142693 Email Id- sanjiv2009...@gmail.com -- You received this message because you

Re: [algogeeks] Re: Exchanging bit values in a number

suppose we have to swap bits b1 and b2 in a number n.Then if(b1==b2) do not do any thing else take a hexadecimal number whose all bits are zero except bits b1 and b2.bit b1=1 and bit b2=1 now xor of original no with this no will give the desired result. On Sun, Oct 30, 2011 at 10:32 AM,

Re: [algogeeks] Re: Exchanging bit values in a number

suppose we have to swap bits b1 and b2 in a number n.Then if(b1==b2) do nothing else take a hexadecimal number whose all bits are zero except bits b1 and b2.bit b1=1 and bit b2=1 now xor of original no with this no will give the desired result. On Sun, Oct 30, 2011 at 10:32 AM, shiva@Algo

Re: [algogeeks] Re: Exchanging bit values in a number

suppose we have to swap bits b1 and b2 in a number n.Then if(b1==b2) do nothing else take a hexadecimal number whose all bits are zero except bits b1 and b2.bit b1=1 and bit b2=1 now xor of original no with this no will give the desired result.suppose we have to swap bits b1 and b2 in a

Re: [algogeeks] Amazon Written test Q-1

node sort(node root) { node first; int count=0;count1=0;count2=0; for(first=root;first !=null;first=first-next) { if(first-data==1) count++; if(first-data==2) count1++; if(first-data==3) count2++; } first=root; for(first;first !=null;first=first-next) { if(count0) { first-data=1; count--; } else

Re: [algogeeks] Re: Missing elements

it is really good algorithm On 8/2/11, Deepak giggs deepakthegi...@gmail.com wrote: @varun : clear :) thanks... On Mon, Aug 1, 2011 at 11:44 PM, kartik sachan kartik.sac...@gmail.comwrote: similar type algo is there in geeksforgeeks.org in array section from there u can