.
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
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
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 puneet.ar...@aricent.com
--
You received this message because you
In both the cases... what would be the condition?
On Thu, Sep 22, 2011 at 10:19 PM, sukran dhawan sukrandha...@gmail.comwrote:
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
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 puneet.ar...@aricent.com
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
] 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
, 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
Again it is giving the same error. on changing it to 32.
On Tue, Sep 20, 2011 at 2:18 PM, abhinav gupta abhinav@gmail.comwrote:
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
in there
return ( n mask ) | ( m i)
}
On Tue, Sep 20, 2011 at 10:11 PM, Dave dave_and_da...@juno.com wrote:
@Ishan: Using bitwise operations:
N = (N ~((2 j) - (1 i) | (M i);
Dave
On Sep 20, 2:03 am, Ishan Aggarwal ishan.aggarwal.1...@gmail.com
wrote:
You are given two 32-bit
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
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
[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
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
/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 puneet.ar...@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
=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 puneet.ar...@aricent.com
--
You received this message because you are subscribed to the Google Groups
Algorithm
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
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
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
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
@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
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
...@gmail.comwrote:
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
can someone plz provide the solution to it???
On Sat, Sep 10, 2011 at 9:30 PM, sukran dhawan sukrandha...@gmail.comwrote:
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
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 puneet.ar...@aricent.com
--
You received this message because you
Not able to find some good solution for this...
On Sat, Sep 10, 2011 at 10:17 PM, shady sinv...@gmail.com 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
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
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 puneet.ar...@aricent.com
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
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
@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
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
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
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
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
---
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
36 matches
Mail list logo
