An image mask comes as an N×M grid where 1 is foreground and 0 is background. How would you write a function that returns an array with the size of each blob of 1s connected up, down, left, and right? Assume you're processing a 4000×3000 mask on an iPhone.
Scan the grid, and when you hit a 1, flood fill to count the blob, marking cells visited so they aren't counted again. O(N·M) time; extra space is the visited marks plus the queue's maximum frontier.
CS fundamentals and algorithmsShort answerAdvanced
You're given a specific UIView instance in an original view hierarchy, plus a copy of…
#bfs #dfs
UIKitShort answerBasics
How would you write a function that starts at a root view and finds a view matching some…
#bfs #dfs
UIKitShort answerAdvanced
You're implementing flood fill on a large pixel grid drawn with a collection view (say…
#flood-fill #bfs
CS fundamentals and algorithmsShort answerBasics
A home decor recommender follows a graph of room-to-room connections to find the minimum…
#bfs