# Week9 (May 13)

## 79. Word Search

### Question
Given an <mark>$m \ \text{ x } \ n$</mark> grid of characters <mark>board</mark> and a string <mark>word</mark>, return <mark>true</mark> if <mark>word</mark> exists in the grid.

The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once.

### Hand in homework before Saturday.

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

## 103. Binary Tree Zigzag Level Order Traversal

### Question
Given the <mark>root</mark> of a binary tree, return the zigzag level order traversal of its nodes' values. (i.e., from left to right, then right to left for the next level and alternate between).

### Hand in homework before Saturday.

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