Re: [algogeeks] cracking the coding interview book
Please mail those books to me as well, if somebody has those books. On Sat, Nov 26, 2011 at 7:19 AM, tech coder wrote: > please upload the books "cracking the coding interview 5th edition" and > " data structures and algorithms made easy", if somebody have. > thanks. > > -- > * > > Regards* > *"The Coder"* > > *"Life is a Game. The more u play, the more u win, the more u win , the > more successfully u play"* > > -- > 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 at > http://groups.google.com/group/algogeeks?hl=en. > -- Kind Regards Ishan Aggarwal -- 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 at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] request of ebook..(Data Structures and algorithms made easy:)
plz send me that book to I also need that book... On Sun, Sep 25, 2011 at 9:37 PM, sarath prasath wrote: > hi every one.. > pls do give me the link if u find or have, about this book.. > title name:"Data Structures and Algorithms Made Easy: 700 Data > Structure and Algorithmic Puzzles" > author:"Narasimha Karumanchi" > ISBN-10: 145654988X > ISBN-13: 978-1456549886 > publisher:careermonk.. > pls do send to this email id..."prasathsar...@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 this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] plz reply quickly
In both the cases... what would be the condition? On Thu, Sep 22, 2011 at 10:19 PM, sukran dhawan wrote: > queue represnted as array or linked list ? > > > On Thu, Sep 22, 2011 at 10:08 PM, Ishan Aggarwal < > ishan.aggarwal.1...@gmail.com> wrote: > >> How will u detect if a queue is circular or not?? >> >> -- >> Kind Regards >> Ishan Aggarwal >> [image: Aricent Group] >> Presidency Tower-A, M.G.Road,Sector-14 >> Gurgaon,Haryana.122015 INDIA >> Phone : +91-9654602663 >> ishan2.aggar...@aricent.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 this group, send email to >> algogeeks+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > 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 at > http://groups.google.com/group/algogeeks?hl=en. > -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] plz reply quickly
How will u detect if a queue is circular or not?? -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Question -->
Can someone explain me what this code is doing??
void main()
{
int n,m i,j;
int max = ~0;
// 1's through position j, then 0's
int left = max - (( 1 << j) - 1);
//1' after position i
int right = (( 1<< i) -1)
// 1's with 0's betwwen i and j
int mask = left | right ;
// clear i through j , then put m in there
return ( n & mask ) | ( m << i)
}
On Tue, Sep 20, 2011 at 10:11 PM, Dave wrote:
> @Ishan: Using bitwise operations:
>
> N = (N & ~((2 << j) - (1 << i) | (M << i);
>
> Dave
>
> On Sep 20, 2:03 am, Ishan Aggarwal
> wrote:
> > You are given two 32-bit numbers, N and M, and two bit positions, i and
> > j.Write a method to set all bits between i and j in N equal to M (e.g., M
> > becomes a substring of N located at i and starting at j).
> >
> > EXAMPLE:
> >
> > Input: N = 100, M = 10101, i = 2, j = 6
> >
> > Output: N = 10001010100
> >
> > --
> > Kind Regards
> > Ishan Aggarwal
> > [image: Aricent Group]
> > Presidency Tower-A, M.G.Road,Sector-14
> > Gurgaon,Haryana.122015 INDIA
> > Phone : +91-9654602663
> > ishan2.aggar...@aricent.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 this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Kind Regards
Ishan Aggarwal
[image: Aricent Group]
Presidency Tower-A, M.G.Road,Sector-14
Gurgaon,Haryana.122015 INDIA
Phone : +91-9654602663
ishan2.aggar...@aricent.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 this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Question -->
Again it is giving the same error. on changing it to 32.
On Tue, Sep 20, 2011 at 2:18 PM, abhinav gupta wrote:
> Instead of Num[31] u should tk Num[32]
>
> On Tue, Sep 20, 2011 at 2:16 PM, Ishan Aggarwal <
> ishan.aggarwal.1...@gmail.com> wrote:
>
>> Hi,
>>
>> When I am running this program, I am getting segmentation fault. Can u plz
>> confirm where is the error.
>>
>> #include
>> void main()
>> {
>> int Num[31]={0};
>> int Mum[31]={0};
>> int n = 64,m = 7 ,i=0,j=3,k;
>> for(k=31;k>=0;k++)
>> {
>> Num[k]=n & 1;
>> Mum[k]=m & 1;
>> n=n>>1;
>> m=m>>1;
>> }
>>
>> for(k=i;k<=j;k++)
>> Num[k]=Mum[k];
>>
>> for(k=0;k<=31;k++)
>> printf("%d ", Num[k]);
>> }
>>
>>
>> On Tue, Sep 20, 2011 at 1:49 PM, tec wrote:
>>
>>> mask = (1<<(j+1))-(1<>> n = (n&(~mask)) | m;
>>>
>>>
>>> On Sep 20, 3:43 pm, abhinav gupta wrote:
>>> > You can also solve the problem by using bit operators. by using >> << &
>>> | !
>>> > .
>>> > Need sm thinking in dat..No time rite nw!
>>> >
>>> > On Tue, Sep 20, 2011 at 1:12 PM, abhinav gupta <
>>> guptaabhinav...@gmail.com>wrote:
>>> >
>>> >
>>> >
>>> >
>>> >
>>> >
>>> >
>>> >
>>> >
>>> > > Its because o/p should look like dat.Bt dats simple you can do it
>>> > > by multiplying bits to power(2, i) and
>>> > > adding all expressions.Simple!
>>> > > On Tue, Sep 20, 2011 at 1:09 PM, abhinav gupta <
>>> guptaabhinav...@gmail.com>wrote
>>> >
>>> > > In the first loop bits are added into the array N and M .I have
>>> taken two
>>> > >> integers n and m .
>>> > >> Caution :
>>> > >> declare
>>> >
>>> > >> int N[31]={0};
>>> > >> int M[31]={0};
>>> > >> int n,m,i,j;
>>> >
>>> > >> On Tue, Sep 20, 2011 at 1:02 PM, Ishan Aggarwal <
>>> > >> ishan.aggarwal.1...@gmail.com> wrote:
>>> >
>>> > >>> What are u doing in the first loop running for k=31 to k =0?
>>> >
>>> > >>> On Tue, Sep 20, 2011 at 12:50 PM, abhinav gupta <
>>> > >>> guptaabhinav...@gmail.com> wrote:
>>> >
>>> > >>>> U can use single walker (from 0 till 31) to convert integers N and
>>> M
>>> > >>>> into array of bits, then
>>> > >>>> another walker from i to j to replace values.
>>> >
>>> > >>>> for(k=31;k>=0;k++)
>>> > >>>> {
>>> > >>>> N[k]=n & 01;
>>> > >>>> M[k]=m &01;
>>> > >>>> n>>=1;
>>> > >>>> m>>=1;
>>> > >>>> }
>>> >
>>> > >>>> for(k=i;k<=j;k++)
>>> > >>>> N[k]=M[k];
>>> >
>>> > >>>> On Tue, Sep 20, 2011 at 12:44 PM, abhinav gupta <
>>> > >>>> guptaabhinav...@gmail.com> wrote:
>>> >
>>> > >>>>> I can tell you the logic.Take two arrays N and M, put their bits
>>> in
>>> > >>>>> the array.
>>> > >>>>> Now using i and j index replace the value of N[j] to n[i] by M[j]
>>> to
>>> > >>>>> M[i].
>>> > >>>>> On Tue, Sep 20, 2011 at 12:33 PM, Ishan Aggarwal <
>>> > >>>>> ishan.aggarwal.1...@gmail.com> wrote:
>>> >
>>> > >>>>>> You are given two 32-bit numbers, N and M, and two bit
>>> positions, i
>>> > >>>>>> and j.Write a method to set all bits between i and j in N equal
>>> to M (e.g.,
>>> > >>>>>> M becomes a substring of N located at i and starting at j).
>>> >
>>> > >>>>>> EXAMPLE:
>>> >
>>> > >>>>>> Input: N = 100, M = 10101, i = 2, j = 6
>>> >
>>> > >>>>>> Output: N = 10001010100
>>> >
>>> > >>>>>> --
>>> > >>>>>> Kind Re
Re: [algogeeks] Re: Question -->
Hi,
When I am running this program, I am getting segmentation fault. Can u plz
confirm where is the error.
#include
void main()
{
int Num[31]={0};
int Mum[31]={0};
int n = 64,m = 7 ,i=0,j=3,k;
for(k=31;k>=0;k++)
{
Num[k]=n & 1;
Mum[k]=m & 1;
n=n>>1;
m=m>>1;
}
for(k=i;k<=j;k++)
Num[k]=Mum[k];
for(k=0;k<=31;k++)
printf("%d ", Num[k]);
}
On Tue, Sep 20, 2011 at 1:49 PM, tec wrote:
> mask = (1<<(j+1))-(1< n = (n&(~mask)) | m;
>
>
> On Sep 20, 3:43 pm, abhinav gupta wrote:
> > You can also solve the problem by using bit operators. by using >> << & |
> !
> > .
> > Need sm thinking in dat..No time rite nw!
> >
> > On Tue, Sep 20, 2011 at 1:12 PM, abhinav gupta <
> guptaabhinav...@gmail.com>wrote:
> >
> >
> >
> >
> >
> >
> >
> >
> >
> > > Its because o/p should look like dat.Bt dats simple you can do it
> > > by multiplying bits to power(2, i) and
> > > adding all expressions.Simple!
> > > On Tue, Sep 20, 2011 at 1:09 PM, abhinav gupta <
> guptaabhinav...@gmail.com>wrote
> >
> > > In the first loop bits are added into the array N and M .I have taken
> two
> > >> integers n and m .
> > >> Caution :
> > >> declare
> >
> > >> int N[31]={0};
> > >> int M[31]={0};
> > >> int n,m,i,j;
> >
> > >> On Tue, Sep 20, 2011 at 1:02 PM, Ishan Aggarwal <
> > >> ishan.aggarwal.1...@gmail.com> wrote:
> >
> > >>> What are u doing in the first loop running for k=31 to k =0?
> >
> > >>> On Tue, Sep 20, 2011 at 12:50 PM, abhinav gupta <
> > >>> guptaabhinav...@gmail.com> wrote:
> >
> > >>>> U can use single walker (from 0 till 31) to convert integers N and M
> > >>>> into array of bits, then
> > >>>> another walker from i to j to replace values.
> >
> > >>>> for(k=31;k>=0;k++)
> > >>>> {
> > >>>> N[k]=n & 01;
> > >>>> M[k]=m &01;
> > >>>> n>>=1;
> > >>>> m>>=1;
> > >>>> }
> >
> > >>>> for(k=i;k<=j;k++)
> > >>>> N[k]=M[k];
> >
> > >>>> On Tue, Sep 20, 2011 at 12:44 PM, abhinav gupta <
> > >>>> guptaabhinav...@gmail.com> wrote:
> >
> > >>>>> I can tell you the logic.Take two arrays N and M, put their bits in
> > >>>>> the array.
> > >>>>> Now using i and j index replace the value of N[j] to n[i] by M[j]
> to
> > >>>>> M[i].
> > >>>>> On Tue, Sep 20, 2011 at 12:33 PM, Ishan Aggarwal <
> > >>>>> ishan.aggarwal.1...@gmail.com> wrote:
> >
> > >>>>>> You are given two 32-bit numbers, N and M, and two bit positions,
> i
> > >>>>>> and j.Write a method to set all bits between i and j in N equal to
> M (e.g.,
> > >>>>>> M becomes a substring of N located at i and starting at j).
> >
> > >>>>>> EXAMPLE:
> >
> > >>>>>> Input: N = 100, M = 10101, i = 2, j = 6
> >
> > >>>>>> Output: N = 10001010100
> >
> > >>>>>> --
> > >>>>>> Kind Regards
> > >>>>>> Ishan Aggarwal
> > >>>>>> [image: Aricent Group]
> > >>>>>> Presidency Tower-A, M.G.Road,Sector-14
> > >>>>>> Gurgaon,Haryana.122015 INDIA
> > >>>>>> Phone : +91-9654602663
> > >>>>>> ishan2.aggar...@aricent.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 this group, send email to
> > >>>>>> algogeeks+unsubscr...@googlegroups.com.
> > >>>>>> For more options, visit this group at
> > >>>>>>http://groups.google.com/group/algogeeks?hl=en.
> >
> > >>>>> --
> > >>>>> @ |3 # ! /\/ @ \./
> >
> > >>>> --
> > >>>> @ |3 # ! /\/ @ \./
> >
> > >>>> --
>
Re: [algogeeks] Question -->
What are u doing in the first loop running for k=31 to k =0?
On Tue, Sep 20, 2011 at 12:50 PM, abhinav gupta
wrote:
> U can use single walker (from 0 till 31) to convert integers N and M into
> array of bits, then
> another walker from i to j to replace values.
>
> for(k=31;k>=0;k++)
> {
> N[k]=n & 01;
> M[k]=m &01;
> n>>=1;
> m>>=1;
> }
>
> for(k=i;k<=j;k++)
> N[k]=M[k];
>
> On Tue, Sep 20, 2011 at 12:44 PM, abhinav gupta > wrote:
>
>> I can tell you the logic.Take two arrays N and M, put their bits in
>> the array.
>> Now using i and j index replace the value of N[j] to n[i] by M[j] to
>> M[i].
>> On Tue, Sep 20, 2011 at 12:33 PM, Ishan Aggarwal <
>> ishan.aggarwal.1...@gmail.com> wrote:
>>
>>> You are given two 32-bit numbers, N and M, and two bit positions, i and
>>> j.Write a method to set all bits between i and j in N equal to M (e.g., M
>>> becomes a substring of N located at i and starting at j).
>>>
>>> EXAMPLE:
>>>
>>> Input: N = 100, M = 10101, i = 2, j = 6
>>>
>>> Output: N = 10001010100
>>>
>>> --
>>> Kind Regards
>>> Ishan Aggarwal
>>> [image: Aricent Group]
>>> Presidency Tower-A, M.G.Road,Sector-14
>>> Gurgaon,Haryana.122015 INDIA
>>> Phone : +91-9654602663
>>> ishan2.aggar...@aricent.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 this group, send email to
>>> algogeeks+unsubscr...@googlegroups.com.
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>
>>
>>
>> --
>> @ |3 # ! /\/ @ \./
>>
>
>
>
> --
> @ |3 # ! /\/ @ \./
>
> --
> 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 at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Kind Regards
Ishan Aggarwal
[image: Aricent Group]
Presidency Tower-A, M.G.Road,Sector-14
Gurgaon,Haryana.122015 INDIA
Phone : +91-9654602663
ishan2.aggar...@aricent.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 this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Question -->
You are given two 32-bit numbers, N and M, and two bit positions, i and j.Write a method to set all bits between i and j in N equal to M (e.g., M becomes a substring of N located at i and starting at j). EXAMPLE: Input: N = 100, M = 10101, i = 2, j = 6 Output: N = 10001010100 -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] output
int main(){printf("%s",printf("samsung")+fun());return 0;}fun(){return
"electronic";}
On Tue, Sep 13, 2011 at 11:28 PM, kumar raja wrote:
> main(){printf("%s",printf("samsung")+fun());}fun(){return "electronic";}
>
> The printf is a function which returns the number of printed characters , and
> scanf is a function
> which returns the number of inputs scanned .
>
> So after printing "samsung" it returns 7. fun() is returning a pointer to the
> constant string
>
> "electronic" , so it is like 7["electronic"]
>
> so the %s prints that string from the 7th index onwards till end .
>
> So output is "nic"
>
> so the total output is "samsungnic"
>
> but i dont know why it is exiting with some error code..
>
>
>
> On 13 September 2011 10:51, Rajeshwar Patra wrote:
>
>> http://codepad.org/erdnF74M
>>
>> can anyone explain the output ???
>>
>> --
>> *Rajeshwar Patra,*
>> *MCA final year,*
>> *Nit Durgapur*
>>
>> --
>> 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 at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>
>
> --
> Regards
> Kumar Raja
> M.Tech(SIT)
> IIT Kharagpur,
> 10it60...@iitkgp.ac.in
> 7797137043.
> 09491690115.
>
> --
> 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 at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Kind Regards
Ishan Aggarwal
[image: Aricent Group]
Presidency Tower-A, M.G.Road,Sector-14
Gurgaon,Haryana.122015 INDIA
Phone : +91-9654602663
ishan2.aggar...@aricent.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 this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] C Puzzle
*c = *a;
It will result in an run-time error.
On Mon, Sep 12, 2011 at 10:25 AM, teja bala wrote:
> #include
> main()
> {
> int *a;
> char *c;
> *a = 20;
> *c = *a;
> printf("%d %c",*a,*c);
> }
>
> --
> 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 at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Kind Regards
Ishan Aggarwal
[image: Aricent Group]
Presidency Tower-A, M.G.Road,Sector-14
Gurgaon,Haryana.122015 INDIA
Phone : +91-9654602663
ishan2.aggar...@aricent.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 this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Request for crack coding book ebook
Plzz share that book on this group... everyone will get that... Thanks in advance... On Sun, Sep 11, 2011 at 11:17 PM, 9ight coder <9ightco...@gmail.com> wrote: > hey send to me also>>>>>>>crackcoding ebook please. > > On Sep 4, 10:48 pm, Sanjay Rajpal wrote: > > Send it to me also. > > > > Thanx in advance .. :) > > Sanju > > :) > > > > On Sat, Sep 3, 2011 at 9:58 AM, UMESH KUMAR >wrote: > > > > > > > > > > > > > > > > > hi > > > anybody do you have CrackCoding ebook pls send . > > > > > thanks > > > > > -- > > > 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 at > > >http://groups.google.com/group/algogeeks?hl=en. > > -- > 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 at > http://groups.google.com/group/algogeeks?hl=en. > > -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Programs
How will it work>?
On Sun, Sep 11, 2011 at 5:53 PM, sukran dhawan wrote:
> 1.use character count to record frequencey of occurences // initialise
> array to 0
> 2. for(i=0;str[i];i++)
> {
>if(count[str[i]] == 0) // first repeated character break;
> }
>
> On Sun, Sep 11, 2011 at 5:43 PM, Ishan Aggarwal <
> ishan.aggarwal.1...@gmail.com> wrote:
>
>> {Please solve the following questions :-
>>
>> 1.) Find first non repeated character.
>>
>> eg. total --> o
>> teeter --> r
>>
>> 2.) Remove specified letters from a string.
>>
>> input --> "Battle of the vowels: Hawaii vs. Gronzy" , "aeiou"
>>
>> output --> "Bttle f th vwls: Hw vs. Grnzy"
>>
>> What is the problem in this solution ... Its giving compilation error.
>>
>>
>> #include#include
>> void main(){int temp1[256];int i=0;char str[40] = "Battle of the vowels:
>> Hawaii vs. Gronzy";char temp[6] = "aeiou";
>> for(i=0;i<256;i++)
>> temp1[i] = 0;
>>
>> i=0;while(temp[i]){
>> temp1[temp[i]] = 1;
>> i++;}
>> i=0;while(str[i]){if(temp1[str[i]] == 1){
>> str[i] = str[i+1];
>> i--;}
>> i++;}printf
>> <http://www.opengroup.org/onlinepubs/009695399/functions/printf.html>("%s",
>> str);}
>>
>>
>>
>>
>>
>>
>> --
>> Kind Regards
>> Ishan Aggarwal
>> [image: Aricent Group]
>> Presidency Tower-A, M.G.Road,Sector-14
>> Gurgaon,Haryana.122015 INDIA
>> Phone : +91-9654602663
>> ishan2.aggar...@aricent.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 this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
> --
> 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 at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Kind Regards
Ishan Aggarwal
[image: Aricent Group]
Presidency Tower-A, M.G.Road,Sector-14
Gurgaon,Haryana.122015 INDIA
Phone : +91-9654602663
ishan2.aggar...@aricent.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 this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Programs
{Please solve the following questions :-
1.) Find first non repeated character.
eg. total --> o
teeter --> r
2.) Remove specified letters from a string.
input --> "Battle of the vowels: Hawaii vs. Gronzy" , "aeiou"
output --> "Bttle f th vwls: Hw vs. Grnzy"
What is the problem in this solution ... Its giving compilation error.
#include#include
void main(){int temp1[256];int i=0;char str[40] = "Battle of the
vowels: Hawaii vs. Gronzy";char temp[6] = "aeiou";
for(i=0;i<256;i++)
temp1[i] = 0;
i=0;while(temp[i]){
temp1[temp[i]] = 1;
i++;}
i=0;while(str[i]){if(temp1[str[i]] == 1){
str[i] = str[i+1];
i--;}
i++;}printf
<http://www.opengroup.org/onlinepubs/009695399/functions/printf.html>("%s",
str);}
--
Kind Regards
Ishan Aggarwal
[image: Aricent Group]
Presidency Tower-A, M.G.Road,Sector-14
Gurgaon,Haryana.122015 INDIA
Phone : +91-9654602663
ishan2.aggar...@aricent.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 this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Pgm
what should be the output (1,9) (2,8) (3,7) (4,6) (5,5) (6,4) (7,3) (8,2) (9,1) Correct me if I am wrong? On Sun, Sep 11, 2011 at 3:48 PM, parag khanna wrote: > write a program to find the all possible combination of digits ranging 1 > to 9 whose sum is 10, no digit shud be repeated in any combination. > > > > > -- > Parag Khanna > B.tech Final Year > NIT,Kurukshetra > > -- > 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 at > http://groups.google.com/group/algogeeks?hl=en. > -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Questions -->
I dont know. I got this question from Facebook interview page. So posted it here.. On Sun, Sep 11, 2011 at 10:51 AM, bharatkumar bagana < bagana.bharatku...@gmail.com> wrote: > what is seed fill algorithm? > > On Sun, Sep 11, 2011 at 10:45 AM, Ishan Aggarwal < > ishan.aggarwal.1...@gmail.com> wrote: > >> 1.) >> how would you detect mouth in a picture >> >> 2.) >> write iterative version of seed fill algorithm >> >> -- >> Kind Regards >> Ishan Aggarwal >> [image: Aricent Group] >> Presidency Tower-A, M.G.Road,Sector-14 >> Gurgaon,Haryana.122015 INDIA >> Phone : +91-9654602663 >> ishan2.aggar...@aricent.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 this group, send email to >> algogeeks+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > > > -- > > **Please do not print this e-mail until urgent requirement. Go Green!! > Save Papers <=> Save Trees > *BharatKumar Bagana* > **http://www.google.com/profiles/bagana.bharatkumar<http://www.google.com/profiles/bagana.bharatkumar> > * > Mobile +91 8056127652* > > > > -- > 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 at > http://groups.google.com/group/algogeeks?hl=en. > -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Questions -->
1.) how would you detect mouth in a picture 2.) write iterative version of seed fill algorithm -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Write a program
What would be the complexity in that case ?? On Sun, Sep 11, 2011 at 10:29 AM, bharatkumar bagana < bagana.bharatku...@gmail.com> wrote: > @brijesh: > if we don't want to print .. and want to eliminate duplicates ...then ? > means..want to store in some place which doesn't have any duplicate for > further purpose ... > > > On Sun, Sep 11, 2011 at 12:08 AM, Brijesh wrote: > >> Watch this video for the concepts of hashing.. >> http://www.youtube.com/watch?v=KW0UvOW0XIo&feature=player_embedded or >> go through the pdf file >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To view this discussion on the web visit >> https://groups.google.com/d/msg/algogeeks/-/cRPUHhf-2tUJ. >> >> 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. >> > > > > -- > > **Please do not print this e-mail until urgent requirement. Go Green!! > Save Papers <=> Save Trees > *BharatKumar Bagana* > **http://www.google.com/profiles/bagana.bharatkumar<http://www.google.com/profiles/bagana.bharatkumar> > * > Mobile +91 8056127652* > > > > -- > 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 at > http://groups.google.com/group/algogeeks?hl=en. > -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Write a program to Convert an ASCII representation of a positive integer to it's numeric value ??
Not able to find some good solution for this... On Sat, Sep 10, 2011 at 10:17 PM, shady wrote: > string manipulation... google it. > > On Sat, Sep 10, 2011 at 10:06 PM, Ishan Aggarwal < > ishan.aggarwal.1...@gmail.com> wrote: > >> >> >> -- >> Kind Regards >> Ishan Aggarwal >> [image: Aricent Group] >> Presidency Tower-A, M.G.Road,Sector-14 >> Gurgaon,Haryana.122015 INDIA >> Phone : +91-9654602663 >> ishan2.aggar...@aricent.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 this group, send email to >> algogeeks+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > 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 at > http://groups.google.com/group/algogeeks?hl=en. > -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Solve the following problems
Hi All, Please answer these questions :- 1.) A tree is serialized in such a way that all the leaves are market with L and all the other nodes with N. The tree is serialized keeping the order derived by a pre-order traversal. Write an algorithm for reconstructing the tree. Also, suggest a methodology for improving the serialization. 2.) Find top log(n) or top sqt(n) values in an array of integers in less than linear time. 3.) Given an array A of positive integers. Convert it to a sorted array with minimum cost. The only valid operation are: 1) Decrement with cost = 1 2) Delete an element completely from the array with cost = value of element -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Code it
can someone plz provide the solution to it??? On Sat, Sep 10, 2011 at 9:30 PM, sukran dhawan wrote: > best way it to invoke the function recursively > > just like a k-1 ary tree > correct me if im wrong > > On Sat, Sep 10, 2011 at 2:49 PM, Ishan Aggarwal < > ishan.aggarwal.1...@gmail.com> wrote: > >> What would be the efficient way to code this program.?? >> >> Given an array of size n, find all the possible sub set of the array of >> size k(all the subsets must be of size k). >> >> >> -- >> Kind Regards >> Ishan Aggarwal >> Phone : +91-9654602663 >> >> >> -- >> 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 at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > 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 at > http://groups.google.com/group/algogeeks?hl=en. > -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Write a program
Howz this solution??
void main()
{
int a[10] = {9,3,9,3,9,3,2};
int c[10],i,j,k,co;
k=0;
for(i=0;i<7;i++)
{
co = 0;
for( j = 1+1; j<7; j++)
if( a[i] == a[j])
co++ ;
if( co == 0)
{
c[k++] = a[i];
}
for (i=0;iwrote:
> yes for integer arrays we need to sort o(nlogn) and den compare in o(n)
>
>
> On Sat, Sep 10, 2011 at 7:12 PM, Ishan Aggarwal <
> ishan.aggarwal.1...@gmail.com> wrote:
>
>> Hi,
>>
>> Actually I am not good at hash tables. can u plzz suggest me some gud link
>> from where I can study hash tables...
>> and also tell me the logic for integer arrays for which the complexity
>> will be o(n logn).
>>
>> Thanks in advance.
>>
>>
>> --
>> Kind Regards
>> Ishan Aggarwal
>> Phone : +91-9654602663
>>
>>
>> On Sat, Sep 10, 2011 at 7:03 PM, Brijesh wrote:
>>
>>> If you are talking about character array then it can be done in space
>>> O(128)=constant and time O(n),,. as Use Hash table of all 128 characters ,
>>> and then traverse through your array and mark a flag in the hash table..when
>>> you encounter any duplicate character , which would be marked already in the
>>> hash table , dont print it..!
>>>
>>> And if its integer array... best would be sort it in O(n logn) and
>>> traverse through the loop and print those numbers which are not same as
>>> previous number..
>>>
>>> On Saturday, 10 September 2011 14:51:18 UTC+5:30, Ishan Aggarwal wrote:
>>>
>>>> Write a program to remove duplicate elements from an array by printing
>>>> them only once?
>>>>
>>>> What will be the minimum time and space complexity required for this
>>>> program?
>>>>
>>>> --
>>>> Kind Regards
>>>> Ishan Aggarwal
>>>> [image: Aricent Group]
>>>> Presidency Tower-A, M.G.Road,Sector-14
>>>> Gurgaon,Haryana.122015 INDIA
>>>> Phone : +91-9654602663
>>>> ishan2@aricent.com
>>>>
>>>> --
>>> You received this message because you are subscribed to the Google Groups
>>> "Algorithm Geeks" group.
>>> To view this discussion on the web visit
>>> https://groups.google.com/d/msg/algogeeks/-/TqJhP_DAD2AJ.
>>>
>>> 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.
>>>
>>
>>
>>
>> --
>> 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 at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
> --
> 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 at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Kind Regards
Ishan Aggarwal
[image: Aricent Group]
Presidency Tower-A, M.G.Road,Sector-14
Gurgaon,Haryana.122015 INDIA
Phone : +91-9654602663
ishan2.aggar...@aricent.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 this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Question --> plz answer
1.) there is a pyramid with 1 cup at level , 2 at level 2 , 3 at level 3 and so on.. It looks something like this 1 2 3 4 5 6 every cup has capacity C. you pour L liters of water from top . when cup 1 gets filled , it overflows to cup 2,3 equally, and when they get filled , Cup 4 and 6 get water only from 2 and 3 resp but 5 gets water from both the cups and so on. Now given C and M .Find the amount of water in ith cup. -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: How can we find second largest element in an array... in O(n+logn-2)... give me proof.....
+1. On Sat, Sep 10, 2011 at 7:58 PM, Dave wrote: > @Praveen: The question should be "How can we find the second largest > element in an array in n + ceiling(log_2(n)) - 2 comparisons?" The > answer is to use a tournament to select the largest number. The second > largest number will have lost to one of the numbers that lost to the > largest. It takes n - 1 comparisons to determine the largest number. > There are ceiling(log_2(n)) numbers that have lost to the maximum, and > it takes ceiling(log_2(n)) - 1 comparisons to find the largest of > them. > > Dave > > On Sep 10, 9:18 am, praveen raj wrote: > > How can we find second largest element in an array... in O(n > > +logn-2)... give me proof. > > -- > 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 at > http://groups.google.com/group/algogeeks?hl=en. > > -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Write a program
Hi, Actually I am not good at hash tables. can u plzz suggest me some gud link from where I can study hash tables... and also tell me the logic for integer arrays for which the complexity will be o(n logn). Thanks in advance. -- Kind Regards Ishan Aggarwal Phone : +91-9654602663 On Sat, Sep 10, 2011 at 7:03 PM, Brijesh wrote: > If you are talking about character array then it can be done in space > O(128)=constant and time O(n),,. as Use Hash table of all 128 characters , > and then traverse through your array and mark a flag in the hash table..when > you encounter any duplicate character , which would be marked already in the > hash table , dont print it..! > > And if its integer array... best would be sort it in O(n logn) and traverse > through the loop and print those numbers which are not same as previous > number.. > > On Saturday, 10 September 2011 14:51:18 UTC+5:30, Ishan Aggarwal wrote: > >> Write a program to remove duplicate elements from an array by printing >> them only once? >> >> What will be the minimum time and space complexity required for this >> program? >> >> -- >> Kind Regards >> Ishan Aggarwal >> [image: Aricent Group] >> Presidency Tower-A, M.G.Road,Sector-14 >> Gurgaon,Haryana.122015 INDIA >> Phone : +91-9654602663 >> ishan2@aricent.com >> >> -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/TqJhP_DAD2AJ. > > 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. > -- 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 at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] What would be the ans.
How u calculated this?? On Sat, Sep 10, 2011 at 6:19 PM, Neha Singh wrote: > The correct ans is : > for right angled triangle : 0 > for acute angled triangle : 1/2 > for obtuse angled triangle : 1/2 > > -- > 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 at > http://groups.google.com/group/algogeeks?hl=en. > -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] What would be the ans.
According to me, it should be 1/3 for each of the three options... On Sat, Sep 10, 2011 at 4:48 PM, Piyush Grover wrote: > Sorry guys.. I was wrong, radius also matters here... > > still investigating > > > On Sat, Sep 10, 2011 at 3:56 PM, sarath prasath > wrote: > >> @Piyush Grover: >> please explain ur answer >> >> >> On Sat, Sep 10, 2011 at 3:30 PM, Piyush Grover > > wrote: >> >>> I got.. >>> >>> 1.) 2/pi >>> >>> 2.) & 3.) 0.5 - (1/pi) >>> >>> >>> On Sat, Sep 10, 2011 at 2:47 PM, Ishan Aggarwal < >>> ishan.aggarwal.1...@gmail.com> wrote: >>> >>>> three points are randomly chosen on a circle.what the probability that >>>> 1.triangle formed is right angled triangle. >>>> 2.triangle formed is acute angled triangle. >>>> 3.triangle formed is obtuse angled triangle. >>>> >>>> >>>> -- >>>> Kind Regards >>>> Ishan Aggarwal >>>> Phone : +91-9654602663 >>>> >>>> >>>> -- >>>> 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 at >>>> http://groups.google.com/group/algogeeks?hl=en. >>>> >>> >>> -- >>> 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 at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >> >> -- >> 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 at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > 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 at > http://groups.google.com/group/algogeeks?hl=en. > -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] What would be the ans.
three points are randomly chosen on a circle.what the probability that 1.triangle formed is right angled triangle. 2.triangle formed is acute angled triangle. 3.triangle formed is obtuse angled triangle. -- Kind Regards Ishan Aggarwal Phone : +91-9654602663 -- 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 at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Code it
What would be the efficient way to code this program.?? Given an array of size n, find all the possible sub set of the array of size k(all the subsets must be of size k). -- Kind Regards Ishan Aggarwal Phone : +91-9654602663 -- 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 at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Circular Left shift
Solution :-
void main(){int a[9]= {9,7,6,5,3,23,14,2,4} ;int n = 3;int c[3];int
i;int k =0;for ( i=0;i<3;i++)
c[i]= a[i];for(i=3;i<9;i++)
a[i-3] =a[i];for(i=9-3;i<9;i++)
a[i] = c[k++];for(i=0;i<9;i++)printf
<http://www.opengroup.org/onlinepubs/009695399/functions/printf.html>("\n%d",a[i]);}
On Sat, Sep 10, 2011 at 2:09 PM, kumar raja wrote:
> Given an array of 'n' values you need to circular shift it 'k' times
> towards left.
>
> Input : 9 7 6 5 3 23 14 2 4
> output : 5 3 23 14 2 4 9 7 6
>
> n=9 , k= 3
>
> constraints : Time complexity O(n)
> Space complexity O(1)
>
> The solutions with O(kn) time complexity and
> O(n) complexity with O(k) space complexity are already available.
>
> I want the O(n) solution with constant space..
> --
> Regards
> Kumar Raja
> M.Tech(SIT)
> IIT Kharagpur,
> 10it60...@iitkgp.ac.in
> 7797137043.
> 09491690115.
>
> --
> 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 at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Kind Regards
Ishan Aggarwal
[image: Aricent Group]
Presidency Tower-A, M.G.Road,Sector-14
Gurgaon,Haryana.122015 INDIA
Phone : +91-9654602663
ishan2.aggar...@aricent.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 this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Facebook Interview questions. -- Urgent
Hi, Thanks for this information. How many rounds of interview do they have and what package do they offer?? On Thu, Sep 8, 2011 at 9:25 AM, arvinthdd wrote: > Try the " facebook puzzle master " page and few given puzzles there. > FB loves linux, mac a lot. Your exposure to these OS is a big plus. > Its all about puzzle solving and your approach to new problems. > > On Sep 8, 1:04 am, Ankit Minglani wrote: > > they will give a puzzle kind of problem .. and you will have to code to > > output the solution .. i think it was a 75 min coding round. > > > > On Thu, Sep 8, 2011 at 12:17 AM, Ishan Aggarwal < > > > > ishan.aggarwal.1...@gmail.com> wrote: > > > Do anyone know what kind of questions facebook ask in their coding > > > interview?? > > > Wht should I prepare... > > > > > -- > > > 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 at > > >http://groups.google.com/group/algogeeks?hl=en. > > > > -- > > The more you sweat in the field, the less you bleed in war." > > > > Ankit Minglani > > NITK Surathkal > > -- > 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 at > http://groups.google.com/group/algogeeks?hl=en. > > -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Facebook Interview questions. -- Urgent
Hi... can u plzz tell me about the kind of puzzles they asked u and what sort of coding questions they ask.. What they exactly look for ?? Thank u in advance... On Thu, Sep 8, 2011 at 1:34 AM, Ankit Minglani wrote: > they will give a puzzle kind of problem .. and you will have to code to > output the solution .. i think it was a 75 min coding round. > > On Thu, Sep 8, 2011 at 12:17 AM, Ishan Aggarwal < > ishan.aggarwal.1...@gmail.com> wrote: > >> Do anyone know what kind of questions facebook ask in their coding >> interview?? >> Wht should I prepare... >> >> -- >> 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 at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > > > -- > The more you sweat in the field, the less you bleed in war." > > Ankit Minglani > NITK Surathkal > > -- > 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 at > http://groups.google.com/group/algogeeks?hl=en. > -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Facebook Interview questions. -- Urgent
Do anyone know what kind of questions facebook ask in their coding interview?? Wht should I prepare... -- 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 at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Aps
why wont u consider those.. Its no where mentioned in the problem that u are not supposed to count those mahouts sitting on the elephants... The statement is just to make it tricky nothing else... On Wed, Sep 7, 2011 at 9:19 PM, Mani Bharathi wrote: > how? > > mahouts sitting on the elephants shouldn't be considered > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/9hWKNBJXPYEJ. > > 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. > -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Aps
14 elephants On Wed, Sep 7, 2011 at 9:10 PM, Mani Bharathi wrote: > *There were few elephants and an equal number of mahouts.Half of the > mahouts were sitting on the elephants and half were walking.Totally there > was 84 legs,hw many elephants were there?* > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/Xzn6kmDRCGYJ. > 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. > -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.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 this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] unique key
Hi, Unique key with not null constraint works similar to the Primary key. Both will uniquely identify each row of the table with not null constraint. The only difference is a table may have arbitrarily many unique keys but at most one primary key. -- Kind Regards Ishan Aggarwal [image: Aricent Group] Presidency Tower-A, M.G.Road,Sector-14 Gurgaon,Haryana.122015 INDIA Phone : +91-9654602663 ishan2.aggar...@aricent.com On Sun, Sep 4, 2011 at 12:17 PM, sarath prasath wrote: > what is the difference in this.. > we have a table which has one primary key and one unique key with not > null constraint.. > so r they equal... > > -- > 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 at > http://groups.google.com/group/algogeeks?hl=en. > > -- 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 at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Urgent
Hi, Anyone aware what facebook asks in their first phone call, regarding general background details and other related information and what should be prepared for their interview? -- Kind Regards Ishan Aggarwal Phone : +91-9654602663 -- 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 at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Ishan Aggarwal wants to chat
--- Ishan Aggarwal wants to stay in better touch using some of Google's coolest new products. If you already have Gmail or Google Talk, visit: http://mail.google.com/mail/b-29c1639b1-0f10bf7075-C-KR8EyMrsOu-VDR4HVkvtL75XI You'll need to click this link to be able to chat with Ishan Aggarwal. To get Gmail - a free email account from Google with over 2,800 megabytes of storage - and chat with Ishan Aggarwal, visit: http://mail.google.com/mail/a-29c1639b1-0f10bf7075-C-KR8EyMrsOu-VDR4HVkvtL75XI Gmail offers: - Instant messaging right inside Gmail - Powerful spam protection - Built-in search for finding your messages and a helpful way of organizing emails into "conversations" - No pop-up ads or untargeted banners - just text ads and related information that are relevant to the content of your messages All this, and its yours for free. But wait, there's more! By opening a Gmail account, you also get access to Google Talk, Google's instant messaging service: http://www.google.com/talk/ Google Talk offers: - Web-based chat that you can use anywhere, without a download - A contact list that's synchronized with your Gmail account - Free, high quality PC-to-PC voice calls when you download the Google Talk client We're working hard to add new features and make improvements, so we might also ask for your comments and suggestions periodically. We appreciate your help in making our products even better! Thanks, The Google Team To learn more about Gmail and Google Talk, visit: http://mail.google.com/mail/help/about.html http://www.google.com/talk/about.html (If clicking the URLs in this message does not work, copy and paste them into the address bar of your browser). -- 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 at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Ishan Aggarwal wants to chat
--- Ishan Aggarwal wants to stay in better touch using some of Google's coolest new products. If you already have Gmail or Google Talk, visit: http://mail.google.com/mail/b-29c1639b1-b8b9e04428-tqBcy8yfb12RW8a6CcO_UsF3EUc You'll need to click this link to be able to chat with Ishan Aggarwal. To get Gmail - a free email account from Google with over 2,800 megabytes of storage - and chat with Ishan Aggarwal, visit: http://mail.google.com/mail/a-29c1639b1-b8b9e04428-tqBcy8yfb12RW8a6CcO_UsF3EUc Gmail offers: - Instant messaging right inside Gmail - Powerful spam protection - Built-in search for finding your messages and a helpful way of organizing emails into "conversations" - No pop-up ads or untargeted banners - just text ads and related information that are relevant to the content of your messages All this, and its yours for free. But wait, there's more! By opening a Gmail account, you also get access to Google Talk, Google's instant messaging service: http://www.google.com/talk/ Google Talk offers: - Web-based chat that you can use anywhere, without a download - A contact list that's synchronized with your Gmail account - Free, high quality PC-to-PC voice calls when you download the Google Talk client We're working hard to add new features and make improvements, so we might also ask for your comments and suggestions periodically. We appreciate your help in making our products even better! Thanks, The Google Team To learn more about Gmail and Google Talk, visit: http://mail.google.com/mail/help/about.html http://www.google.com/talk/about.html (If clicking the URLs in this message does not work, copy and paste them into the address bar of your browser). -- 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 at http://groups.google.com/group/algogeeks?hl=en.
