# Week10 (May 20)

## 260. Single Number III

### Question
Given an integer array <mark>nums</mark>, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once. You can return the answer in **any order**.

You must write an algorithm that runs in linear runtime complexity and uses only constant extra space.

### Hand in homework before Saturday.

:::success
[Roger的作業](https://github.com/GametreeRoger/LeetCode/blob/main/LeetCode260.playground/Contents.swift)
[xander的作業](https://github.com/Takumi47/30Plus/blob/main/30Plus/Problems/260_SingleNumberIII.swift)
[Stephen的作業](https://github.com/mirrorsalt667/LeetCodePractice/blob/master/1-500/260-Single%20Number%20III%20.playground/Contents.swift)
...`Continue filling by yourself`
:::

## 797. All Paths From Source to Target

### Question
Given a directed acyclic graph **(DAG)** of <mark>$n$</mark> nodes labeled from <mark>$0$</mark> to <mark>$n - 1$</mark>, find all possible paths from node <mark>$0$</mark> to node <mark>$n - 1$</mark> and return them in any order.

The graph is given as follows: <mark>$graph[i]$</mark> is a list of all nodes you can visit from node <mark>$i$</mark> (i.e., there is a directed edge from node <mark>$i$</mark> to node <mark>$graph[i][j]$</mark>).

### Hand in homework before Saturday.

:::success
[Roger的作業](https://github.com/GametreeRoger/LeetCode/blob/main/LeetCode797.playground/Contents.swift)
[xander的作業](https://github.com/Takumi47/30Plus/blob/main/30Plus/Problems/797_AllPathsFromSourceToTarget.swift)
...`Continue filling by yourself`
:::