Book: Data Structures And Algorithms Made Easy: Data Structure And
Algorithmic Puzzles
Author: Narasimha Karumanchi
ISBN: 0615459811
ISBN-13: 9780615459813, 978-0615459813
Binding: Paperback
Publishing Date: 2011
Publisher: CareerMonk Publications
Edition: 2ndEdition
Number of Pages: 484
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
this is one is the elegant solution i came across
if u got an element just go to the elements index and mark the value to its
negative...
say for eg:
if u got a[i]=9;
then go to a[9] and make it as
a[9]=-a[9];
then do like this for all the elements in the array
so now u can get the logic to how to
@Piyush Grover:
please explain ur answer
On Sat, Sep 10, 2011 at 3:30 PM, Piyush Grover piyush4u.iit...@gmail.comwrote:
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
consider this approach..
first reverse the entire array...
so it will be.. 4,2,14,23,3,5,6,7,9
and u want to shift k times right so
u have to cut the array as n-k and reverse both the sides u ll get it..
so in ur scenario we are reversing upto the element 5 in array and reversing
the remaining
just look at the cormen's 9th chapter in 3rd edition..
randomized_select procedure is exactly suitable for this..
it is less complex than heapify procedures and all
actually it is of modification of quick sort and u guys ll appreciate that..
On Sat, Sep 10, 2011 at 3:12 PM, a.maiskar
first round: mainly quantitative aptitude(nearly 20) and some questions on
java and c(10)..
and
coding round: they will give a scenario like u have to host the game and all
so u have write program for it..
and my wish for u is to read server programming in the complete reference of
java 2..
and
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
here is my approach
where i left the non repeating characters as it is and done some good code..
char * runlengthencode(char* str,int size)
{
int i,j,flag=0;
for(i=0,j=1;str[i]str[j]jsize;i++,j++)
{
while(str[i]==str[j])
{
j++;
flag=1;
}
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 we can find
kt smallest/largest in unsorted array , but i am not able to write
code , please
2..
On Aug 18, 11:31 pm, jestincobol nair jestinco...@gmail.com wrote:
In (typical) object-oriented programming languages which one of the
following can be done by a subclass (derived class) of class *C*?
1. Remove methods defined in *C*
2. Define instance variables (data members) not
pls do send the algorithm for interviews book to this email id..
prasat...@live.com
pls...
--
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
pls do share the book named Algorithm for interviews..
ebook pls
--
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
ex-or operation on all the elements give you the answer.
On Jun 9, 5:45 am, Dumanshu duman...@gmail.com wrote:
Q1. I have a file in which there are supposed to be 4 billion
numbers,
starting from 1 to 4,000,000,000 but unfortunately one number is
missing,
i.e there are only 3,999,999,999
14 matches
Mail list logo
