#process bloomberg phone

1 messages · Page 1 of 1 (latest)

simple ledge
#

what kind of problems were asked?

tawdry path
#

I got asked two easy/medium level questions. First was finding the first non repeated char in a string and the second was called countClouds. Given a 2D n x m matrix (the sky) filled with 1 or zeroes, count the number of contiguous groups of ones (clouds).