# Introduction

每一題標題都會是總結這題我學到的東西，之後複習會比較有效率 另外若忘記一些演算法/資料結構原理，可以複習之前自己寫的鐵人賽

**JavaScript 學演算法**

什麼是演算法， Big O 是什麼等等

* [開始用 javaScript 學演算法囉之前言](https://ithelp.ithome.com.tw/articles/10213184)
* [什麼是演算法 (Algorithm)](https://ithelp.ithome.com.tw/articles/10213206)
* [評量演算法好壞的 Big O](https://ithelp.ithome.com.tw/articles/10213615)

**Data Structure**

介紹常見的 Data Structure 例如 linked list、Array、Queue、Stack... 搭配 LeetCode 題目。 # 代表對應的 LeetCode 第幾題

* [陣列 Array](https://ithelp.ithome.com.tw/articles/10213787)
* [\[番外篇\] 解 LeetCode 之前](https://ithelp.ithome.com.tw/articles/10213928)
* [\[LeetCode #905,  #561\] Array](https://ithelp.ithome.com.tw/articles/10214111)
* [集合 Set](https://ithelp.ithome.com.tw/articles/10214228)
* [Array vs. Set](https://ithelp.ithome.com.tw/articles/10214361#response-310863)
* [\[LeetCode #217, #804\] Set](https://ithelp.ithome.com.tw/articles/10214541)
* [Map](https://ithelp.ithome.com.tw/articles/10214746)
* [Map vs. Object](https://ithelp.ithome.com.tw/articles/10214880)
* [\[LeetCode #1\] Map](https://ithelp.ithome.com.tw/articles/10215037)
* [堆疊 Stack](https://ithelp.ithome.com.tw/articles/10215118)
* [\[LeetCode #20\] Stack](https://ithelp.ithome.com.tw/articles/10215394)
* [佇列 Queue](https://ithelp.ithome.com.tw/articles/10215666)
* [鏈結串列 Linked List](https://ithelp.ithome.com.tw/articles/10216257)
* [\[LeetCode #206\] Linked List](https://ithelp.ithome.com.tw/articles/10216443)
* [資料結構 Data Structure 總結](https://ithelp.ithome.com.tw/articles/10217419)

**Algorithms**

介紹常見排序，Binary search、Two pointer... 以及 LeetCode 解題

* [排序 1 : 排序簡介 & 氣泡排序 Bubble Sort](https://ithelp.ithome.com.tw/articles/10217933)
* [排序 2 : 選擇排序 Selection Sort & 插入排序 Insertion Sort](https://ithelp.ithome.com.tw/articles/10218442)
* [排序 3: 合併排序 Merge Sort](https://ithelp.ithome.com.tw/m/articles/10218895)
* [排序 4: 快速排序 Quick Sort](https://ithelp.ithome.com.tw/articles/10219567)
* [\[補充\] Array.prototype.sort](https://ithelp.ithome.com.tw/articles/10226679)
* [簡易搜尋 Sequential Search & 二分搜尋 Binary Search](https://ithelp.ithome.com.tw/articles/10219931)
* [\[LeetCode #1064\] Binary Search](https://ithelp.ithome.com.tw/articles/10220434)
* [遞迴 Recursion](https://ithelp.ithome.com.tw/articles/10220904)
* [動態規劃 Dynamic programming](https://ithelp.ithome.com.tw/articles/10221370)
* [\[LeetCode #322\] Dynamic Programming](https://ithelp.ithome.com.tw/articles/10221988)
* [\[LeetCode #167\] Two Pointer](https://ithelp.ithome.com.tw/articles/10222287)

**聊聊美國找工作以及面試經驗**

介紹一些有趣題目以及面試經驗

* [\[有趣面試題\] 網頁效能問題改善之 Debounce & Throttle](https://ithelp.ithome.com.tw/articles/10222749)
* [夢想與現實的差距之國外工作亂聊最終章](https://ithelp.ithome.com.tw/articles/10223276)
* [\[番外篇\] 面試前除了刷 LeetCode 還要準備的事](https://ithelp.ithome.com.tw/articles/10225219)

## 其他

#### LeetCode 紀錄

* 10/16:  43 題
* 10/19:  50 題
* 10/25:  59 題

若是有錯或其他意見歡迎 Email 我 <hannahpun@gmail.com>


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://hannahpun.gitbook.io/leetcode-note/master.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.