Determine if a path is navigable given a 2D array of 1's and 0's given that 1's are walkable and 0's are not. The start is defined as the top left and the end is defined as the bottom right. The user may walk up, right, left, or down to walkable spaces or jump over one unwalkable space and land on walkable space.
Standard Leetcode questions, as well as some behavioral questions, and an open-ended question.
Can't say due to NDA
Design Data Structures, Stacks, Hashmaps, Topological Search
coding question, problem solving portion, decision making portion
Talk about a time you head to deal with someone that wasn't actively contributing to your team?
write down how to render items in two components that would make them random?
Two LeetCode style medium difficulty algo questions on CodeSignal.
Tell me about your work experiences
Trees and special sorts.
Viewing 6891 - 6900 interview questions