Location: Los Angeles
When: A few weeks ago
Questions
* Random Pick Index (verbatim)
* Variant of the Unique Paths series

TL;DR of Variant of Unique Paths

• You are given a method signature of List<String> uniquePaths(int n), where n is the size of an n x n 2-dimensional array. You have to return a dynamic array of all possible paths, where you may only go down and right--a single move right will be represented by the character R, and a single move down will be represented by the character D. Each string represents each possible path from the top-most index to the bottom-most index. Backtracking may be used to achieve this.