To Mr. B
how will you find median in O(n) time? please elaborate.
On Wednesday, July 11, 2012 4:01:43 AM UTC+5:30, Mr.B wrote:
I found a similar solution looking somewhere else.
The solution for this problem is:
a. There can be atmost 3 elements (only 3 distinct elements with each
On 10/29/11, praveen raj praveen0...@gmail.com wrote:
Priority Queue:
when popped ... returns the max priority element and if the priorities
of two or more elements are same...then they will popped as they are
inserted ..
when pushed the element : puts the element in the list
lets take an example...
hello naveen how are you naveen?
how we can store the word each seperated by space into array if we are
considering binary tree???
how we can measure which is smaller than other according to
property??
if we store each word into hash table then how
remove duplicate words from a string with min. complexityy.
--
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
hey gaurav bhai
please provide me your phone number..amdocs visiting thapar on 7
oct.
On Sun, Oct 2, 2011 at 7:45 PM, gaurav yadav gauravyadav1...@gmail.comwrote:
I cracked amdocs interview...u need to stress on following topics..
*ONLINE TEST*
1)UNIX
Questions on various
h anika.amdocs in coming to thapar on 7 oct.
On Sun, Oct 2, 2011 at 11:01 PM, Anika Jain anika.jai...@gmail.com wrote:
hey sachin: amdocs is coming for job at wich location??
On Oct 2, 8:55 pm, gaurav yadav gauravyadav1...@gmail.com wrote:
my number= +919939569122
gtalk
they provide first one year job in puneif your profile is testing then
it may be at gurgaon
On Mon, Oct 3, 2011 at 12:13 AM, Anika Jain anika.jai...@gmail.com wrote:
hiii... ok i meant job offer is for Pune or NCR area ??if u knw..
On Oct 2, 11:29 pm, sachin goyal monugoya
@anup,@sukran ithink u both are right in case of binary search tree...
we can traverse and then easily find the value...
but in case of heap first we have to create the heap and accordingly apply
the algo the create min heap.
it will be the complex program
so simple is bst just traverse by
12345|12345
F|E
WE HAVE TO CREATE THE PATTERN LIKE
F E F E F E F E F E
ACCORDING TO MY UNDERSTANDING WE CAN DIRECTLY REPLACE THE 2ND WITH SECOND
AND 4TH WITH 4TH
TELL CORRECT ME IF I AM WRONG AND I AM TRATING WRONG???
On Sun, Sep 4, 2011 at 8:04 PM, *$* gopi.komand...@gmail.com
PLEASE TELL HOW
On Sun, Sep 4, 2011 at 7:23 PM, sarath prasath prasathsar...@gmail.comwrote:
another sol which i learned from my friend is
think of heap sort...
On Sun, Sep 4, 2011 at 6:28 PM, learner nimish7andr...@gmail.com wrote:
something I Know using quick sort randomization function
PLEASE TELL ME HOW WE CAN USE QUICK SORT TO FIND THE ELEMENT
BECAUSE IN QUICK SORT ONE ELEMENT IN SHIFT IN ITS RIGHT POSITION ALL LEFTS
ARE SMALLER AND ALL RIGHT ARE BIG
On Mon, Sep 5, 2011 at POSIT11:55 AM, sachin goyal
monugoya...@gmail.comwrote:
PLEASE TELL HOW
On Sun, Sep 4, 2011 at 7
PLEASE CORRECT ME ADITYA
On Mon, Sep 5, 2011 at 11:52 AM, sachin goyal monugoya...@gmail.com wrote:
12345|12345
F|E
WE HAVE TO CREATE THE PATTERN LIKE
F E F E F E F E F E
ACCORDING TO MY UNDERSTANDING WE CAN DIRECTLY REPLACE THE 2ND WITH SECOND
AND 4TH WITH 4TH
TELL CORRECT ME
dheerajsharma1...@gmail.com wrote:
i thnk n/2 swaps are required... 1/4 is of the total glasses present..
i.e. 2n/4 ..=n/2
On Mon, Sep 5, 2011 at 11:52 AM, sachin goyal monugoya...@gmail.comwrote:
PLEASE CORRECT ME ADITYA
On Mon, Sep 5, 2011 at 11:52 AM, sachin goyal monugoya
extern try to find the definition of variable var but not able to find so
gives the error
On Wed, Aug 31, 2011 at 8:26 PM, Rajesh Kumar testalgori...@gmail.comwrote:
What we do to remove error??
#includestdio.h
extern int var;
main()
{
var=10;
return 0;
}
Regards
Rajesh Kumar
--
2 3 because d is pointer avriable
On Wed, Aug 31, 2011 at 9:25 PM, aditi garg aditi.garg.6...@gmail.comwrote:
8 3
On Wed, Aug 31, 2011 at 9:22 PM, rohit raman.u...@gmail.com wrote:
output??
int main()
{
char *d = abc\0def\0;
printf(%d %d,sizeof(d),strlen(d));
getch();
}
--
15 matches
Mail list logo
