tag:blogger.com,1999:blog-1257878355908648494.post5157465782610812720..comments2024-03-14T02:10:54.087-07:00Comments on Get that Job at Google!: Google TestChinmayhttp://www.blogger.com/profile/05849000619156676678noreply@blogger.comBlogger3125tag:blogger.com,1999:blog-1257878355908648494.post-7049215532982635542013-01-25T10:27:38.435-08:002013-01-25T10:27:38.435-08:00@waterloonian I was able to do it using O(m*n*x) s...@waterloonian I was able to do it using O(m*n*x) space in O(n*x) time. How did you arrive at a solution with O(n*x) complexity?Chinmayhttps://www.blogger.com/profile/05849000619156676678noreply@blogger.comtag:blogger.com,1999:blog-1257878355908648494.post-33625802128063782222013-01-21T21:26:18.656-08:002013-01-21T21:26:18.656-08:00An approximate solution would be
0.5*[1-2*(x-n(m...An approximate solution would be <br /><br />0.5*[1-2*(x-n(m+1)/2)/sqrt(2*n*(m^3-1))]<br /><br />Note that is not the exact solution. The exact solution cannot be computed by hand, but the approximate solution can, and should be accurate to within a few percent. Bob the builderhttps://www.blogger.com/profile/02726365524786584283noreply@blogger.comtag:blogger.com,1999:blog-1257878355908648494.post-5293756412677007132013-01-06T12:53:48.768-08:002013-01-06T12:53:48.768-08:00Hello, my friend, I can solve this problem with O(...Hello, my friend, I can solve this problem with O(N*X) running time and O(N*X) spaces.I believe there must be a better solution. Do you mind to provide your solution?waterloonian in ottawahttps://www.blogger.com/profile/12340599946166307972noreply@blogger.com