OPEN AI NEW GRAD SWE OA Q2

Question 2 — Count Paths
Objective It's back-to-school time! In order to buy school supplies for your kids, you have to go to 4 different types of shop:

• a bookshop to buy a workbook,
• a school shop to buy some glue,
• a sport store to buy a pair of sneakers,
• a stationery store to buy a pencil.

Shopping for school isn't a fun hobby for you, so you started to search for the shortest

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

counts as two valid paths.
There are a maximum of 50 shops and 250 roads.

Example
With these inputs:

1. shops = [1, 0, 3, 2, 2]roads = [ [0, 1], [1, 2], [1, 4], [2, 3], [2, 4]]

复制代码

The valid paths are below, each list contains the 4 shop indexes to visit:

1. [0, 1, 2, 3][0, 1, 2, 4][0, 1, 4, 2][3, 2, 1, 0][4, 2, 1, 0][2, 4, 1, 0]

复制代码

As there are 6 solutions, your code must output:

1. 6

复制代码

求加米～～～