Count Unique Paths in a Grid
Asked at Okta · Coding Questions · Difficulty: Medium
There is an m-x-n grid, and you start at the top-left cell, and you need to reach the bottom-right cell. You can only move down or right. Find how many different paths you can take, considering all possible ways.
Loading the problem…
More Okta interview questions
- Hiring-Manager / Project Chat + AI Philosophy
- Cross-Domain SSO After an Acquisition, and OIDC Across Sites
- Memory Allocator (Allocate / Free)
- Dependency Cycle Detection (Deadlock)
- JWT-Protected MCP Server with a Scoped whoami Tool
- Validate IPv4 Addresses in an Array