# Plan for May - 198

## 2024.06.02 - 200

## 2024.04.21 - 190
## 2024.05.01 - 192
## 2024.05.12 - 193
## 2024.05.13 - 194
## 2024.05.19 - 196
## 2024.05.23 - 198

## Practice

| Category | Name | Notes |
| -------- | -------- | -------- |
| Backtracing | 46. Permutation | (0428)先不看頭，回頭後再加回來 |
| Backtracing | 90. Subset II | (0428)對於重複數字的處理 |
| Backtracing | 131. Palidrome | (0501) 切分字母的組合並確認是否為迴文 |

## Select 10

LeetCode : 188 - 190 - 200

:::spoiler
:::

## Select 4

LeetCode : 192 - 197 - 200

## Select 2
1 Medium 1 Hard

### LeetCode 90
:::spoiler
:::

### LeetCode Seq

#### V: 46,40,17
#### todo: `90`,`131`,[684](https://leetcode.com/problems/redundant-connection/description/),[130](https://leetcode.com/problems/surrounded-regions/description/),[695](https://leetcode.com/problems/max-area-of-island/description/),[51](https://leetcode.com/problems/n-queens/description/)
:::spoiler

:::
#### not in LC : [(994)](https://leetcode.com/problems/rotting-oranges/description/)

# register EASY one - buy choco
:::spoiler

:::
# register HARD - 857. Minimum Cost to Hire K Workers
:::spoiler

:::
## python heap

# register Medium - remove (STARTS)* from a string
# register EASY - evaluate-boolean-binary-tree
https://youtu.be/9a_cP54jn8Q?si=Wa4Oouc1bvE3K61v

https://leetcode.com/problems/evaluate-boolean-binary-tree/description/
## need provide iterative
:::spoiler

:::

# register & finish N Queue I&II