M (hint: replace ü and û with their actual meaning.. u 'll understand)
On Fri, Aug 19, 2011 at 4:10 AM, payal gupta gpt.pa...@gmail.com wrote:
was there anything more specified
Regards,
PAYAL GUPTA
On Fri, Aug 19, 2011 at 3:29 AM, Aditya Virmani
virmanisadi...@gmail.comwrote:
I have an answer to the problem which requires a single pass of string
to get the output string. (Though debatable if it covers all cases)
Look to make it as time efficient as possible.
On Aug 19, 2:28 am, Dave dave_and_da...@juno.com wrote:
@Icy: We agree that you have to look ahead in order
My two cents on this book -
Too lengthy and written more like an exhaustive tutorial rather than
idea book. I purchased hard copy but sold it for didn't like it
much.
On Aug 19, 2:56 am, Swati Sarraf swati1...@gmail.com wrote:
Hi guys,
Does any one of u has the book - Data Structures and
I think we are using hash , which is like extra spaace , but as per the
question , O(s) = 1.
Thx,
--Gopi
On Fri, Aug 19, 2011 at 2:15 AM, icy` vipe...@gmail.com wrote:
#!/usr/bin/ruby -w
#array of unsorted positive integers
# find the [only] one that is duplicated
arr=
The element is repeated only once or can be repeated k number of times??
On Fri, Aug 19, 2011 at 7:50 AM, *$* gopi.komand...@gmail.com wrote:
I think we are using hash , which is like extra spaace , but as per the
question , O(s) = 1.
Thx,
--Gopi
On Fri, Aug 19, 2011 at 2:15 AM, icy`
only once
On Fri, Aug 19, 2011 at 7:57 AM, saurabh singh saurab...@gmail.com wrote:
The element is repeated only once or can be repeated k number of times??
On Fri, Aug 19, 2011 at 7:50 AM, *$* gopi.komand...@gmail.com wrote:
I think we are using hash , which is like extra spaace , but as
Hey Navneet , which book are you talking abt- Data structure and algo made
easy OR Data structure Puzzles ?
http://www.slideshare.net/nakarumaka/data-structures-and-algorithms-made-easy-cover-page
On Thu, Aug 18, 2011 at 10:16 PM, Navneet navneetn...@gmail.com wrote:
My two cents on this book -
substrings and subsets are two different things.
If you want an easy solution brute force it...:)
Its not that difficult to code a suffix tree if it makes you a
millionare:)
On Thu, Aug 18, 2011 at 7:59 PM, Arun Vishwanathan
aaron.nar...@gmail.comwrote:
am just asking but how can u get
O(1) space means constant space. It doesn't mean you can't use extra space.
Refer here:
http://stackoverflow.com/questions/2219109/what-does-this-mean-on-steps-and-o1-space
According to the question you can definitely use a Hash Table for keeping
hit record, as it will be a constant space
Overriding doesn't remove the function. It just changes the function
definition.
So 2 will be the answer.
On 19 August 2011 00:33, siddharth srivastava akssps...@gmail.com wrote:
On 19 August 2011 00:31, priya ramesh love.for.programm...@gmail.comwrote:
it can remove methods defined in
true. I agree , we can use additional memory which will be constant
irrespective of counjt of elements.
But using an hash wont be a constant memory as input can keep on varying.
Thx,
--Gopi
On Fri, Aug 19, 2011 at 8:16 AM, Dipankar Patro dip10c...@gmail.com wrote:
O(1) space means constant
hash map is the solution provided the elements lie in a predefined range..
On Fri, Aug 19, 2011 at 8:46 AM, *$* gopi.komand...@gmail.com wrote:
true. I agree , we can use additional memory which will be constant
irrespective of counjt of elements.
But using an hash wont be a constant memory
override is not removal..u can still call the base variables and functions..
2 would be the answer i gues..
On Fri, Aug 19, 2011 at 8:34 AM, Dipankar Patro dip10c...@gmail.com wrote:
Overriding doesn't remove the function. It just changes the function
definition.
So 2 will be the answer.
yes , but that constraint is not provided by the interviewer , hence ,
solution of hash is not acceptable
On Fri, Aug 19, 2011 at 8:58 AM, Dheeraj Sharma dheerajsharma1...@gmail.com
wrote:
hash map is the solution provided the elements lie in a predefined range..
On Fri, Aug 19, 2011 at 8:46
In the first loop, numbers are the numbers in the given array
but in the second loop, numbers are just natural numbers.
I forgot to mention as people may get confused.
*Regards
Sanju
Happy to Help :)*
--
You received this message because you are subscribed to the Google Groups
Algorithm
@siva thanks bro for info.
@rahul thru Amcat so its offcampus tey given call to specific students
On Fri, Aug 19, 2011 at 1:12 AM, Rahul Tiwari rahultiwari6...@gmail.comwrote:
@rohit singhal
off-campus or on-campus ?
if on-campus ---mention ur college plz
--
Rahul Tiwari aka
after the aptitude written round .. there were 15 questions in technical (c
c++)
and 5 questions on coding in 45 min.
On Thu, Aug 18, 2011 at 11:01 PM, Anika Jain anika.jai...@gmail.com wrote:
the level is very easy.. i dont remember the questions .. but they are
easy.. but tht makes cut off
find
1length1 (arr1)
2length 2(arr2)
3sum = length1 +length 2
4loops = sum /2
5... set two pointer (say ptr1 ptr2) on arr[0] arr2[0]
6 start loop for i =1 to loops
if (*ptr1 = *ptr2 )
ptr1++
else
ptr2++
please manage it
Plz make one point clear can we use extra space or not ?
because complexity will vary depending upon the approach.
*Regards
Sanju
Happy to Help :)*
On Fri, Aug 19, 2011 at 11:04 AM, arjoo kumar 2009ar...@gmail.com wrote:
find
1length1 (arr1)
2length 2(arr2)
3sum = length1
101 - 119 of 119 matches
Mail list logo
