Google·Software Engineer·Onsite - Coding / Algorithms
- Given an m x n 2D matrix, how many unique paths exist from the bottom-left corner to the top-right corner if you can only move up, right, or diagonally up-right? Implement the solution and provide test cases.
“The diagonal move is what got me initially.”