[algogeeks] Re: Interview Question

2012-08-17 Thread sahil taneja

@Hraday
worst case complexity of your algorithm comes out to be O(n^4)..
What I was thinking is precompute sums of all the rectangles in a sum 
matrix ..using dynamic programming because I read some where that sum of 
rectangles in a matrix has an optimal substructure property..

So we can get sum of all the partitioned rectangles in O(1) reducing our 
complexity to O(n^2)..So, our job now is just to precompute the matrix..


On Sunday, 12 August 2012 17:48:07 UTC+5:30, sahil taneja wrote:

 Divide 2D array into 4 parts. Compute sum of each partition and get max 
 value from the four of them. For all possible partitions get min value of 
 such max values computed.


-- 
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/-/dOI2SIuw-nMJ.
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: Interview Question

2012-08-16 Thread sahil taneja
Can any one help me with this ...Any DP solution?

On Sunday, 12 August 2012 17:48:07 UTC+5:30, sahil taneja wrote:

 Divide 2D array into 4 parts. Compute sum of each partition and get max 
 value from the four of them. For all possible partitions get min value of 
 such max values computed.


-- 
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/-/tNlJhsd8r-MJ.
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] Interview Question

2012-08-12 Thread sahil taneja
Divide 2D array into 4 parts. Compute sum of each partition and get max 
value from the four of them. For all possible partitions get min value of 
such max values computed.

-- 
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/-/G5YC7Lq0ovkJ.
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: Need Help with PHP/HTML

2012-07-19 Thread sahil taneja
hey check this out.. http://www.w3schools.com/html/html_forms.asp 
Hope this will serve the purpose:)

On Tuesday, 17 July 2012 01:12:02 UTC+5:30, nandita raman wrote:

 Hello, 

 I am working on PHP/HTML/ XML-RPC.

 I have a website, where one link shows the list of files as checkboxes and 
 a submit button below that.

 I am stuck at point where when submit button is clicked, it has to go to 
 another .php page and execute whatever is there in that .php file.


 Form intput type= method =post = I have tried and does not seem 
 like its working.

 I would really appreciate any thoughts/inputs/help with this!

 Thanks!

 -- 

 Regards,
 Nandita



-- 
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/-/UoeuXA1smdgJ.
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.