a small question, if matrix has 'r' rows and 'c' columns, how many different rectangles can be there for this problem ? Space Complexity = O( (r*r)*(c*c) )
On Sat, Aug 11, 2012 at 7:10 PM, Srividhya <[email protected]> wrote: > hi all:) > > The coordinates of a rectangle will be specified. there is a matrix of > integers. yo should find the sum of the integers that fall in the region > specified by the coordinates . > > The solution to be in constant time . > > -- > 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/-/qHSmXBshmS4J. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
