# leetcode

**Repository Path**: fe-knowledge-system/leetcode

## Basic Information

- **Project Name**: leetcode
- **Description**: No description available
- **Primary Language**: Unknown
- **License**: Not specified
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2024-07-20
- **Last Updated**: 2024-08-27

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# 力扣代码

<a href="https://leetcode.cn/studyplan/top-interview-150/">面试经典 150 题</a>

# T0

## 数组

## 字符串

## 双指针

## 滑动窗口

## 链表

## 二叉树

## 回溯

## 一维动态规划

## 进度总结

### 1 done,but need re do

```js

```

### 2 needReDoAgain

```js

```

### 3 done,but need opt

```js
(55)[needOpt];
(274)[needOpt];
(238)[needOpt];
(13)[needOpt];
(12)[needOpt];
(150)[needOpt];
(392)[needOpt];
(383)[needOpt];
(290)[needOpt];
(20)[needOpt];
(21)[needOpt]; // https://leetcode.cn/problems/merge-two-sorted-lists/description/
(70)[needOpt]; // https://leetcode.cn/problems/climbing-stairs/description/
(88)[needOpt]; // https://leetcode.cn/problems/merge-sorted-array/description/?envType=study-plan-v2&envId=top-interview-150
```

### 4 hold

```js
(380)[(hold, oneCaseFail)];
(68)[hold];
(134)[(needLearn, 超时)];
(135)[(needLearn, tried)];
(42)[needLearn,感觉和135 差不多,需要学习下此类题目如何解];
```

### 5 done

```js
(27)[done];
(26)[done];
(80)[done];
(169)[done];
(122)[done];
(51)[done];
(58)[done];
(14)[done];
(151)[done];
(125)[done];
(1)[done];
(202)[done];
(219)[done];
(141)[done];
(226)[done];
(222)[done];
(637)[done];
(190)[done];
(191)[done];
(9)[done];
(66)[done];
(242)[done]; // https://leetcode.cn/problems/valid-anagram/description/
(104)[done]; // https://leetcode.cn/problems/maximum-depth-of-binary-tree/description/?envType=study-plan-v2&envId=top-interview-150
(100)[done]; // https://leetcode.cn/problems/same-tree/description/?envType=study-plan-v2&envId=top-interview-150
(101)[done]; // https://leetcode.cn/problems/symmetric-tree/description/?envType=study-plan-v2&envId=top-interview-150
(530)[done]; // https://leetcode.cn/problems/minimum-absolute-difference-in-bst/description/?envType=study-plan-v2&envId=top-interview-150
(35)[done]; // https://leetcode.cn/problems/search-insert-position/description/?envType=study-plan-v2&envId=top-interview-150
(67)[done]; // https://leetcode.cn/problems/add-binary/description/?envType=study-plan-v2&envId=top-interview-150
(136)[done]; // https://leetcode.cn/problems/single-number/description/?envType=study-plan-v2&envId=top-interview-150
(205)[done]; // https://leetcode.cn/problems/isomorphic-strings/description/?envType=study-plan-v2&envId=top-interview-150
(112)[done]; // https://leetcode.cn/problems/path-sum/description/?envType=study-plan-v2&envId=top-interview-150
(108)[done]; // https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/description/?envType=study-plan-v2&envId=top-interview-150
(69)[done]; // https://leetcode.cn/problems/sqrtx/description/
(28)[done]; // https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string/description/?envType=study-plan-v2&envId=top-interview-150
(228)[done]; // https://leetcode.cn/problems/summary-ranges/description/?envType=study-plan-v2&envId=top-interview-150
(2022)[needOpt]; // https://leetcode.cn/problems/convert-1d-array-into-2d-array/
```