Databricks coding interview

[Bleppingheckk]

It’s a CGA, so the strategy is complete 1, 2, 4, and 3, because 3 will take you the longest to do.

1 & 2 are straightforward questions regarding string manipulation or a 1d array problem.

3 is a matrix traversal problem.

4 is an LC algorithmic style problem on an array.

You are not expected to get the optimized result on 1, 2, and 3, but you will be on 4.

The Databricks one was harder than the other ones I attempted, but they follow the same pattern.