{{ !articles[0].partner.isSponsoringArticle ? "Platinum" : "Portal" }} Partner
java,code puzzler

Thursday Code Puzzler: Matrix Search

Thursday is code puzzler day here at DZone. The idea is simple: solve the coding problem as efficiently as you can, in any language or framework that you find suitable.

Note: Even though there really is nothing stopping you from finding a solution to this on the internet, try to keep honest, and come up with your own answer.  It's all about the participation!

Do you have code puzzlers that you'd like to share with the DZone community?  If so, please submit here. 

Matrix Search 

Given a matrix of 1s and 0s, write an algorithm that will find the groups of 1s. A group is a series of 1's that are connected in any direction. An example matrix would look as follows, defined as a 2d array of integers


Catch up on all our previous puzzlers here.


{{ tag }}, {{tag}},

{{ parent.title || parent.header.title}}

{{ parent.tldr }}

{{ parent.urlSource.name }}
{{ parent.authors[0].realName || parent.author}}

{{ parent.authors[0].tagline || parent.tagline }}

{{ parent.views }} ViewsClicks