# leecode

**Repository Path**: Wjj20020718/leecode

## Basic Information

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

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2024-07-11
- **Last Updated**: 2025-06-12

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# Leetcode

## 2024 June, July: Binary Search + Greedy
### Representative Problems
- [Find the Maximum Number of Marked Indices](https://leetcode.cn/problems/find-the-maximum-number-of-marked-indices/description/)
- [Maximum Value at a Given Index in a Bounded Array](https://leetcode.cn/problems/maximum-value-at-a-given-index-in-a-bounded-array/description/)

### Notes
- For binary search, pay attention to boundaries and loop invariants.
- For greedy algorithms, seek the most greedy solution in line with the problem requirements. This requires practice.

## August: Sliding Window + Greedy
### Representative Problems
- [Replace the Substring for Balanced String](https://leetcode.cn/problems/replace-the-substring-for-balanced-string/description/)
- [Minimum Window Substring](https://leetcode.cn/problems/minimum-window-substring/description/)
- [Minimum Operations to Reduce X to Zero](https://leetcode.cn/problems/minimum-operations-to-reduce-x-to-zero/description/)
- [Find the Longest Equal Subarray](https://leetcode.cn/problems/find-the-longest-equal-subarray/description/)

### Notes
- Sliding window uses two pointers, with `j` moving first and `i` moving when conditions are not met.

## September: Monotonic Stack + Search + Bit Manipulation
### Representative Problems
- [Car Fleet](https://leetcode.cn/problems/car-fleet/)
- [Longest Well-Performing Interval](https://leetcode.cn/problems/longest-well-performing-interval/description/)
- [Largest Rectangle in Histogram](https://leetcode.cn/problems/largest-rectangle-in-histogram/)
- [Bus Routes](https://leetcode.cn/problems/bus-routes/description/)

### Notes
- Understand what to push onto the stack.

## October: Bit Manipulation + Data Structures - Enumeration, Prefix Sum
### Representative Problems
- [Find XOR Beauty of Array](https://leetcode.cn/problems/find-xor-beauty-of-array/)
- [Binary Subarrays with Sum](https://leetcode.cn/problems/binary-subarrays-with-sum/description/)

## November: Difference Array, Stack, Queue, Heap Data Structures + Basic Dynamic Programming
### Representative Problems
- [Edit Distance](https://leetcode.cn/problems/edit-distance/) - Variation of Longest Common Subsequence

## December: Trie, Union-Find and Other Data Structures + Dynamic Programming
### Representative Problems
- [Accounts Merge](https://leetcode.cn/problems/accounts-merge/description/)
- [Exam Room](https://leetcode.cn/problems/exam-room/)
- [Maximize Score of Numbers in Ranges](https://leetcode.cn/problems/maximize-score-of-numbers-in-ranges/)

## 2025 January: Sliding Window + Bit Manipulation
### Representative Problems
- [shortest-subarray-to-be-removed-to-make-array-sorted/](https://leetcode.cn/problems/shortest-subarray-to-be-removed-to-make-array-sorted/)
- [count-substrings-that-can-be-rearranged-to-contain-a-string](https://leetcode-cn.com/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-ii/)
- [find-the-maximum-sequence-value-of-array](https://leetcode.cn/problems/find-the-maximum-sequence-value-of-array/description/)

## Feberary: DP
### Representative Problems
 - [visit-array-positions-to-maximize-score](https://leetcode.cn/problems/visit-array-positions-to-maximize-score/)