u r right.
On Mon, Mar 12, 2012 at 11:17 AM, atul anand atul.87fri...@gmail.comwrote:
@sanjiv : wont work for this test case :-
{1,5,3,6,2,7,8};
On Mon, Mar 12, 2012 at 10:54 AM, sanjiv yadav sanjiv2009...@gmail.comwrote:
@atul anand- It will still work as follows---
@atul anand : it will work,i can give u the code.
On Mon, Mar 12, 2012 at 11:53 AM, sanjiv yadav sanjiv2009...@gmail.comwrote:
u r right.
On Mon, Mar 12, 2012 at 11:17 AM, atul anand atul.87fri...@gmail.comwrote:
@sanjiv : wont work for this test case :-
{1,5,3,6,2,7,8};
On
@piyush : i dont knw what modification you have made to the BIT to make it
work for this problem .
please provide the code for better understanding or algo will do.
On Mon, Mar 12, 2012 at 3:56 PM, Piyush Kapoor pkjee2...@gmail.com wrote:
@atul anand : it will work,i can give u the code.
On
1)First map the array numbers into the position in which they would be, if
they are sorted,for example
{30,50,10,60,77,88} --- {2,3,1,4,5,6}
2)Now for each number ,find the cumulative frequency of index ( = the
corresponding number in the map - 1).
3)Output the cumulative frequency and increase
This is nearly what malloc() and similar memory allocators do. If you
look at an operating system book or web search you'll get lots of
approaches. The overall problem of finding the best allocation is NP
hard, so you must use some kind of heuristic. The most common ones
are called First fit
Hello friends,
I recently had an onsite MS interview. One of the questions that they asked
was:
- Given a directed graph, write a program that takes root of the graph
and returns root of a tree which comprises of all the nodes of the graph in
the same way as they appeared in the graph
@atul...
if its the sum of the elements to the left of a[i] which are smaller the my
approach works w/o any flaw
here's the working code for ithttp://ideone.com/CH7VW
if its the sum of all elements lesser than the element a[i] then this algo
is surely wrong
n we then have to proceed by the
plz put these on interview street
On Mon, Mar 12, 2012 at 2:59 AM, Supraja Jayakumar suprajasank...@gmail.com
wrote:
Hi
Has anyone here given a VMWare interview. Could someone tell me about it.
Thanks
--
U
--
You received this message because you are subscribed to the Google Groups
Hi,
The online programming contest of ITRIX, the national level technical
symposium of the Department of Information Sciences and Technology, College
of Engineering Guindy is up and running. Prizes worth 15k to be won.
Contest page: www.spoj.pl/ITRIX12/
Participate and enjoy the contest.
@atul
if its sum of numbers lesser than a[i] in left to i, then still i think it
can be solved in O(nlgn) using Balanced Tree structures
ie: if we use AVL tree, then we just need a little care of how to update
sum stored with rotations
and required ans for ith index must be calculated just after
Hi
Yes I will do that. I posted it to interview-str...@googlegroups.com. I do
not find this group's id right. Pls tell me the id to which I have to
subscribe.
Thanks
On Mon, Mar 12, 2012 at 10:09 AM, rahul sharma rahul23111...@gmail.comwrote:
plz put these on interview street
On Mon, Mar
Construct an infinite family of strings over a fixed alphabet, where
the total length of the edge-labels on their suffix tree grows faster
than O(m), where 'm' is the length of the string. [That is, show that
linear time suffix tree algorithm would be impossible if edge-labels
were written
Algorithm to find the longest common substring of given set of
strings, with much less time and space complexity.
--
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
it's a classic problem like Time = O(n*n), space = O(n)
On Tue, Mar 13, 2012 at 12:55 PM, InThirstOfWisdom.rr
reni.reyn...@gmail.com wrote:
Algorithm to find the longest common substring of given set of
strings, with much less time and space complexity.
--
You received this message because
14 matches
Mail list logo
