Expand the pond

#1

here is a link to my code: https://ide.codingblocks.com/s/195730
I’m getting correct submission only for half test cases. Please help!
how to write a recursive solution for the same.

#2

@SWIFTY
hello mayur,
ur approach complexity is high roughly O(n^4) .
once go through this link -> https://csacademy.com/contest/archive/task/black-shapes

check its solution ,then try to optimise ur code ,if u still stuck then feel free to ask

#3

Is it similar to boundary fill algorithm?

#4

here is the link to my code : https://ide.codingblocks.com/s/196283

#5

but its not giving any output i don’t know why

#6

flood fill + grouping(union find)

#7

it is running in infinite loop . make an extra array to track vistited state .

#8

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.

#9

im getting tle,what is possible optimization?code:https://ide.codingblocks.com/s/199348