$1000 coding challenge from E la Carte (YC S10)

Re:$1000 coding challenge from E la Carte (YC S10) by rohananil on Sunday August 14, 2011 @12:50AM (#2882827)

there is O(m*n) solution for problem 1.

[ Parent | on HN ]

Re:$1000 coding challenge from E la Carte (YC S10) by oleg_kikin on Sunday August 14, 2011 @01:07AM (#2882847)

Yeah, dynamic programming. It's a well known problem. I'm pretty sure you can just convert the matrix to 1s and 0s, and dump it into Matlab.

[ Parent | on HN ]

Re:$1000 coding challenge from E la Carte (YC S10) by rohananil on Sunday August 14, 2011 @01:16AM (#2882853)

Is it DP? I think DP is O(N^3)? That will be a funny way(Matlab) to solve this...

[ Parent | on HN ]

Re:$1000 coding challenge from E la Carte (YC S10) by Joshim5 on Sunday August 14, 2011 @02:06AM (#2882913)

Eh, why not just use a flood-fill type algorithm?

[ Parent | on HN ]

Re:$1000 coding challenge from E la Carte (YC S10) by rohananil on Sunday August 14, 2011 @04:31AM (#2883130)

Wouldn't the constrained that output area should be for a rectangle cause a problem?

[ Parent | on HN ]