Hi,
Based on most comments, The popular puzzle of the last week is
*
http://dailybrainteaser.blogspot.com/2011/04/math-prime-number-puzzle-15april.html?lavesh=lavesh
*
*Please subscribe and follow this blog to show your liking to the blog*
--
You received this message because you are
Can anyone send the resources to learn MATLAB?
Thanks in advance.
-Vishnutej.Mylavarapu
--
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
@subharansu
When I meant the n/2 space in worst case, assuming u have 1 million total
numbers(n), and according to the problem,
it can have single non-repitive number. soo.. 99 entires will comprise
of at max 99/2 values.. assumuing.. none of them repeated more than
twice
Hi,
Can anyone share the places or locations for the algorithmic challenges,
puzzles etc.
here are few I know.
thealgorithmist.com (google it) -- Its not active now... but has previous
good set of articles..
topcoder -- really good
this site.. :P
please post all relevent sites... :)
--
You
www.codechef.com
www.spoj.ol
On Sun, Apr 17, 2011 at 11:00 PM, sravanreddy001
sravanreddy...@gmail.comwrote:
Hi,
Can anyone share the places or locations for the algorithmic challenges,
puzzles etc.
here are few I know.
thealgorithmist.com (google it) -- Its not active now... but has
I think ,Gunjan's solution is right.
suppose {1,2,1,3,2} is given,
1 --- 01
2 10
3 - 11
..
..
..
So XOR these elements 01 XOR 10 --- 11
11 XOR 01 --- 10
10 XOR 11
can u explain ur solution with one of these sets?
{1,2,1,3,2,1}
{1,2,1,3,2,2}
an element can repeat for any number of times = 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 get the non repeating element we have to travese array atleast once.so
Time complixity has to minimum o(n).as I suppose..
The XOr solution will fail because odd number will be there...
Hashing itself require o(n) space in worst case.
On Mon, Apr 18, 2011 at 12:40 AM, sravanreddy001
@vaibhav shukla:
3 1 2 2 1 1 is ok
but how 1 3 1 1 2 2 2 1 came
Thanks
On Apr 13, 2:57 pm, vaibhav shukla vaibhav200...@gmail.com wrote:
On Wed, Apr 13, 2011 at 1:02 PM, Lavesh Rawat lavesh.ra...@gmail.comwrote:
* Sequence Puzzle *
*
*
*The below is a number puzzle. It should be
Dont worry got it!!!
On Apr 13, 2:57 pm, vaibhav shukla vaibhav200...@gmail.com wrote:
On Wed, Apr 13, 2011 at 1:02 PM, Lavesh Rawat lavesh.ra...@gmail.comwrote:
* Sequence Puzzle *
*
*
*The below is a number puzzle. It should be read left to right, top to
bottom.
Question 1 What is
Hey can u mail it to me plzzz??
On Mar 23, 7:55 am, Anand anandut2...@gmail.com wrote:
Thanks!!
On Tue, Mar 22, 2011 at 7:11 PM, D.N.Vishwakarma@IITR
deok...@gmail.comwrote:
thanx...
On 3/22/11, Himanshu Neema potential.himansh...@gmail.com wrote:
-- Forwarded
Hey plzz mail me too..
On Apr 14, 9:29 am, Rajeev Kumar rajeevprasa...@gmail.com wrote:
check this
link:https://docs.google.com/viewer?a=vpid=explorerchrome=truesrcid=1B5...
If you have any problem in access,please inform me
On Thu, Apr 14, 2011 at 1:04 AM, Abhishek Goswami
12 matches
Mail list logo
