Anybody having small or demo project on android.I need it urgent.Or provide
me with link where i can get compile and go project.thanx in advamce
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
Contest started.
http://www.spoj.pl/KOPC12/problems/main/sort=0,start=0
Top Indians can get internship at SAPLABS india.
--
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
Use a binary search.
If you have arrays a[n] and b[m], then if you claim that a[i] is the
kth largest element, then b[k-i-2] must be larger than a[i], and b[k-
i-1] must be less (assuming arrays are zero-based). After using a
binary search to find the value of i to meet this condition, you have
You are given a function printKDistanceNodes which takes in a root node of
a binary tree, a start node and an integer K. Complete the function to
print the value of all the nodes (one-per-line) which are a K distance from
the given start node in sorted order. Distance can be upwards or downwards.
In general it is not possible to go from a lower-level language to a
higher-level language. There have been some attempts to do this, but
they have not been very successful. Some debuggers do embed source
information into the executable, and that might be helpful in
recovering the original source.
Hi,
This is not algo question, but has been asked in Google as well as MS.
If you are given infinite supply of resources and money, what will you do
in software. Why? Key criteria and key benefits please.
Best Regards
Ashish Goel
Think positive and find fuel in failure
+919985813081
Please look at the below link.
http://norvig.com/sudoku.html
The tutorial above gives brilliant explanation of how to use Constraint
Propagation with BackTracking to solve every Sudoku puzzle ever.
On Mon, Jan 30, 2012 at 6:46 AM, Don dondod...@gmail.com wrote:
For each group (either a row,
are you sure given tree is binary tree and not BST.
if it is BST then we can search start node and then do inorder traversal
from there.
before thinking printing abt upward node...please confirm if it a binary
tree or BST.
On Tue, Jan 31, 2012 at 9:27 PM, Dhirendra Singh dps...@gmail.com wrote:
if this would have been possible . we can get all software for free.
On Wed, Feb 1, 2012 at 12:36 AM, Don dondod...@gmail.com wrote:
In general it is not possible to go from a lower-level language to a
higher-level language. There have been some attempts to do this, but
they have not been
if it is binary tree then to print the downward node...
we can search for start node and then do level-order traversal or BFS from
start node till distance K recursively.
no as we want nodes to be printed in sorted order..what we do is crated a
linked-list and insert nodes (found in above method)
Hey Ashish check this link
http://stackoverflow.com/questions/8999610/median-of-lists
Thanks and Regards,
Venkat Gottipati
On Jan 31, 10:14 am, Ashish Goel ashg...@gmail.com wrote:
i think this can be done much faster similar to findling median of two
sorted arrays by proceeding with
Ideally it should be invested intellectually to reap fruits for
future.
Invest in RnD for upcoming technologies like wireless, video, roaming,
seamless integration of devices, achieving standards for protocols
which are heavily used but not standardized.
On Feb 1, 5:53 am, Ashish Goel
12 matches
Mail list logo
