Algorithm Geeks Google Group

Re: An interview question

2009-12-27T03:05:15Z

The best solution is going to depend on properties of the graph. One
solution not yet mentioned is to perform breadth first searches from
both v and N (if it's a digraph, backward search from N) and report
paths when some node appears in the current "wave" from both ends. If
number of nodes visited much lower than (roughly 2sqrt of) doing depth

Re: Hight of a node whose leafs are connected by DLL .. A MS question

2009-12-26T11:03:44Z

we need to traverse the BST to the left recursivly until we reach the
node of left is null. we would have reached the node for which left
pointer is null.. so we are in leaf node .. so we can easily calculate
the height of the node
Is my solution is correct... if any thing is wrong
with me.. pls revert me back..

Re: Hight of a node whose leafs are connected by DLL .. A MS question

2009-12-25T15:34:11Z

One way of doing is by means of augmented nodes. Each node will have
additional flag indicating whether its leaf node.

Re: sort the LL

2009-12-25T16:02:06Z

Separate the ascending and descending lists.
lets say ascending lists are l1,l2,l3 and l4 and descending lists
are l5,l6,l7.
Reverse all these descending list.(reverse(l5),reverse(l6) and
reverse(l7))
Now keep on merging all these 7 sorted lists two at a time.
Its of ~o(n)time and o(1)space

Re: An interview question

2009-12-23T10:31:36Z

The adjacency matrix A shows all paths between vertices of lenghts 1.
Its powers A^n shows all paths between vertices ij of length n.
kunzmilan

Re: Hight of a node whose leafs are connected by DLL .. A MS question

2009-12-23T09:03:57Z

Hi ,
First Identify the leaf nodes: Have an array or list. keep populating
the pointer to left child into the list in the same order as they
come.
When you encounter the first duplicate, You know the nodes between the
2 duplicates (including the duplicate) are the leaf nodes.
Now recursively scan the left and right subtree , like its done in

Re: Sort the data from a big file.

2009-12-22T17:38:21Z

I hope this helps [link]

Re: Hight of a node whose leafs are connected by DLL .. A MS question

2009-12-22T12:34:02Z

I think that the soln to the same would be something like :
say the length of the linked list be n.
then height = no. of bits in n + ( no . of ones that are there in
the binary representation of n) -1
kindly confirm if the above can be an answer.
thanks in advance.

Re: Hight of a node whose leafs are connected by DLL .. A MS question

2009-12-22T10:49:31Z

what do u mean by height of a node exactly ...
can u give examples
like height (6) = 1
height(10) = 2 ???
what ever be the thing the trick lies in identifying the leaf
level...
which can be done by (node->left->right == node ) this check.
if it is true we are at the leaf level ...

Re: [algogeeks] Sort the data from a big file.

2009-12-21T15:13:41Z

This wikipedia article on external sorting may help :
[link]

Re: [algogeeks] Sort the data from a big file.

2009-12-21T14:48:59Z

A merge sort would be helpful i guess... it can also happen in parallel and
IIRC databases use them internally.
Please correct me if im wrong.
Regards,
Abhilash

Re: [algogeeks] Sort the data from a big file.

2009-12-21T13:32:36Z

could you describe what kind of data exists . i mean are duplicates allowed?

Re: [algogeeks] Sort the data from a big file.

2009-12-21T13:36:02Z

Hi Linus,
Thanks for the reply. But yes we cannot guarantee that data value are
unique.

Re: [algogeeks] Sort the data from a big file.

2009-12-21T13:17:12Z

If the numbers are unique you could use a bitmap-sort this way you could
easily read just parts of the file at a time.
If they aren't unique it gets a bit trickier.
/L

Sort the data from a big file.

2009-12-21T13:14:07Z

Hi All,
Suppose I have a big file (~100M) containing integer data. I want to sort
this file. The problem is I don't want to load the complete file data into
main memory in one shot. I mean I can read the file in batches and sort the
batch and save it in another file but cannot store the entire file contents