[algogeeks] invitation for CODECRACKER 2012 [ TODAY, 9:00 PM ]
CodeCracker is an online programming contest with fully automated judge system. The main drive and motivation behind this platform is to inculcate the culture of programming among us, helping understand the importance of algorithms in problem solving and recognizing the power of GNU/Linux as a powerful programming platform. The judge is built using Open Source te chnologies. Date: Wednesday February 1, 2012 [Today] Time: 21:00 IST to 01:00 IST [FOUR hours] So come, code, challenge yourself... prove your intelligence and win recognition for yourself and your college. Prizes *over 10,000 INR* to be won See you at http://codecracker.in/ http://codecracker.in/ MUKTI: mkti.in for more details, contact: Saurabh Araiyer (siz...@gmail.com) Jasneet Bhatti (jazneetbha...@gmail.com) Gourab Taparia (its.gour...@gmail.com) Neeraj Nayal (neeraj.nayal.2...@gmail.com) -- Regards Saurabh Araiyer http://saurabharaiyer.blogspot.com/ -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Director Round MS Google
RD is the best way to go. On Wed, Feb 1, 2012 at 12:59 PM, Varun tewari.va...@gmail.com wrote: 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 ashg...@gmail.com wrote: 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 +919966006652 -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Amazon written test question
^same as above.. for upward.. start again from the nodes now distance is distance is (distance of start node -k) .. if you reach this from the root.. print it.. also better is we use array rather than using linked list .. as sorting can be a tedious task in case of link lists ! On 2/1/12, atul anand atul.87fri...@gmail.com wrote: 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) in sorted way. then print the linked list. for upward nodes. thinking... On Wed, Feb 1, 2012 at 9:52 AM, atul anand atul.87fri...@gmail.com wrote: 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: 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. anyone any idea ?? how to print nodes above the specified node, Note : we do not have a reference to parent -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Reverse Engg.
@atul true... :P:P:P:P and definately linux will develop within a year after release of windows95...:P On Jan 30, 11:20 am, Karthikeyan V.B kartmu...@gmail.com wrote: hi, can anyone tell me how i can convert exe back to c source? -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Amazon written test question
@Manni : nodes should be added to the linklist ..such that linklist remain in sorted orderno need to sort the linklist. On Wed, Feb 1, 2012 at 2:30 PM, Manni mbd mbd2...@gmail.com wrote: ^same as above.. for upward.. start again from the nodes now distance is distance is (distance of start node -k) .. if you reach this from the root.. print it.. also better is we use array rather than using linked list .. as sorting can be a tedious task in case of link lists ! On 2/1/12, atul anand atul.87fri...@gmail.com wrote: 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) in sorted way. then print the linked list. for upward nodes. thinking... On Wed, Feb 1, 2012 at 9:52 AM, atul anand atul.87fri...@gmail.com wrote: 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: 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. anyone any idea ?? how to print nodes above the specified node, Note : we do not have a reference to parent -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Amazon written test question
@Manni : didnt get your algo for upward nodes. On Wed, Feb 1, 2012 at 2:30 PM, Manni mbd mbd2...@gmail.com wrote: ^same as above.. for upward.. start again from the nodes now distance is distance is (distance of start node -k) .. if you reach this from the root.. print it.. also better is we use array rather than using linked list .. as sorting can be a tedious task in case of link lists ! On 2/1/12, atul anand atul.87fri...@gmail.com wrote: 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) in sorted way. then print the linked list. for upward nodes. thinking... On Wed, Feb 1, 2012 at 9:52 AM, atul anand atul.87fri...@gmail.com wrote: 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: 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. anyone any idea ?? how to print nodes above the specified node, Note : we do not have a reference to parent -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] algorithm to sort based on frequency.
I was asked this question sometime during an interview.
WE have an array of known length. The elements in array can be repetitive.
now sort the array based on frequency of occurrence of each element in
array.
Eg: a= {4.3.2.5.4.6.2.6}
after sorting a={4,4,2,2,6,6,3,5}
4,2,6 all occurs twice, in this case retain the order in which they
appeared in original array.
I was able to give a solution using hashing the elements of the array to a
new array, and if hash matches, incrementing the count, and then sort the
hash values. Later, re scan the array to retain the order in case there's a
match in frequency of any two element.
Looking for better alternatives.
Please pour in.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/ODTZfmgepZIJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: algorithm to sort based on frequency.
Build a hashmap with the array value as a key mapping to a struct
which contains the key, frequency, and location of first occurance.
Then sort the hashed elements comparing first by frequency and
breaking ties based on first occurance. Then iterate through the
sorted elements and fill in the array. All steps are O(n) except for
the sort, so the overall complexity is O(n*log n).
Don
On Feb 1, 2:58 am, Varun tewari.va...@gmail.com wrote:
I was asked this question sometime during an interview.
WE have an array of known length. The elements in array can be repetitive.
now sort the array based on frequency of occurrence of each element in
array.
Eg: a= {4.3.2.5.4.6.2.6}
after sorting a={4,4,2,2,6,6,3,5}
4,2,6 all occurs twice, in this case retain the order in which they
appeared in original array.
I was able to give a solution using hashing the elements of the array to a
new array, and if hash matches, incrementing the count, and then sort the
hash values. Later, re scan the array to retain the order in case there's a
match in frequency of any two element.
Looking for better alternatives.
Please pour in.
--
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 email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Android Project
If you have Android sdk setup then you can find samples in that only. If you haven't done that please find necessary information in http://developer.android.com/index.html - Abhirup On Tue, Jan 31, 2012 at 5:20 PM, saurabh singh saurab...@gmail.com wrote: Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Tue, Jan 31, 2012 at 5:16 PM, rahul sharma rahul23111...@gmail.com wrote: 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 algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] decimal to binary..c code....
I think you have to think about the manual way of doing it - how to handle the integer part and decimal part. You can find this in any standard book. Then try out the algorithm. On Mon, Jan 30, 2012 at 12:26 AM, Rahul Kumar rahul.cs.mn...@gmail.com wrote: ur subject is decimal to binary but in content u have written float to decimal... I don't get it On Sat, Jan 28, 2012 at 11:49 PM, rahul sharma rahul23111...@gmail.com wrote: it should be able to convert not only int but also float like 190.345 to decimalcan ny one suggest thnx in advance -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] not recieving mails
HI, i am not recieving any mails since 20 jan , plz chk thank you -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Android Project
i need some mini project...i know about this site...if anyone has any small app.plz share...i hhave to submitbut note enough tym to prepare...thnx On Wed, Feb 1, 2012 at 10:16 PM, Abhirup Ghosh abhiru...@gmail.com wrote: If you have Android sdk setup then you can find samples in that only. If you haven't done that please find necessary information in http://developer.android.com/index.html - Abhirup On Tue, Jan 31, 2012 at 5:20 PM, saurabh singh saurab...@gmail.com wrote: Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Tue, Jan 31, 2012 at 5:16 PM, rahul sharma rahul23111...@gmail.com wrote: 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 algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] decimal to binary..c code....
sry... i need for decimal to binary... On Wed, Feb 1, 2012 at 10:20 PM, Abhirup Ghosh abhiru...@gmail.com wrote: I think you have to think about the manual way of doing it - how to handle the integer part and decimal part. You can find this in any standard book. Then try out the algorithm. On Mon, Jan 30, 2012 at 12:26 AM, Rahul Kumar rahul.cs.mn...@gmail.com wrote: ur subject is decimal to binary but in content u have written float to decimal... I don't get it On Sat, Jan 28, 2012 at 11:49 PM, rahul sharma rahul23111...@gmail.com wrote: it should be able to convert not only int but also float like 190.345 to decimalcan ny one suggest thnx in advance -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
