[algogeeks] direct i online round

Given N points in 2D plane, you have to calculate the number of right triangles, with their shorter sides parallel to the coordinate axis, that can be formed using these N points. Input/OutputYou don't have to read or write anything from/to stdin and stdout respectively. Use the template code

[algogeeks] direct i online test

A smart 3 year old Sandeep knows counting. But he doesn't know how to read and write properly. He has learnt 1, 2 and 3 but thinks that 4 is another way to write 1. So when given any number with 1, 2, 3 & 4, he tries to sum up their digits as follows : 213 = 2 + 1 + 3 = 6 33 = 3 + 3 = 6 1

[algogeeks] Re: [Amazon] : constructing fully binary tree

Can u please explain the algorithm. is n't inorder always needed to construct a unique tree? On Sunday, July 15, 2012 1:41:15 AM UTC+5:30, Navin Kumar wrote: > > Given Preorder and postorder traversals of a tree. Device an algorithm to > constuct a fully binary tree from these traversals. -- Y

Re: [algogeeks] BFS

12 at 11:48 PM, jalaj jaiswal wrote: > Can you give proper data structure used to represent graph in your case ? > > On Wed, Aug 1, 2012 at 9:42 PM, harsha wrote: > >> hello all, >> i was recently trying to solve a BFS problem where each node is >> represented by a d

[algogeeks] DE Shaw written test

there is a stock company whose stock prices are known to u for next 365 days. u have to write the code on which day u should buy and sell the stock. U cannot sell a stock until you haven't bought any stock. my approach was to buy the stock when the stock prices are the lowest and sell them when

[algogeeks] bfs

hello guys, i was recently solving a bfs problem here each node is a different arrangement of elements of an array. but i was unable to come up with a suitable data structure to keep track of the visited nodes in the expanded tree. generally the nodes are different strings so we can just use a m

[algogeeks] BFS

hello all, i was recently trying to solve a BFS problem where each node is represented by a different arrangement of elements in an array but am unable to come with a data structure to keep track of the visited nodes. generally nodes are different strings so we can just use map and set visited n

Re: [algogeeks] Data Structure Q

uot;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. > &g

[algogeeks] question

show the stack status and the output string at every step in converting the following infix expression to prefix expression insisting on the usual precedence and associativity rules? a+b*c-(d*e/f)*g -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" gr

Re: [algogeeks] probability question

geeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Regards Sri Harsha -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, se

[algogeeks] Re: how to minimize a set expression?

standard problem in literature. On Aug 7, 7:10 pm, Dave wrote: > Doesn't mapping "union" to "or" and "intersection" to "and" map the > set expression minimization problem to a boolean expression > minimization problem? Am I missing something

[algogeeks] how to minimize a set expression?

to ((A union B) intersection (C union D) ) Can anybody please point me to existing literature in this area or how can this problem be mapped to other problem? Thanks Harsha -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To po

[algogeeks] finding repeated substrings

is to convert the tree into a prefix notation and solve the above mentioned substring problem. Thanks Harsha -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubs

[algogeeks] MAINFRAME Training with IBM Certification and JOB GUARANTEE:

MAINFRAME Training with IBM Certification and JOB GUARANTEE: Mainframe industry has shortage of people. Mainframe Education gives you the competitive advantage you'll need to succeed in an exciting, leading-edge career in Enterprise Systems. KASSHKU is proud to announce Mainframe Training Progr