# Leetcode Solutions Category by Class

See the [solutions](https://hackmd.io/@Albert-Hu/leetcode-category-by-number) in a category by number.
See the [solutions](https://hackmd.io/@Albert-Hu/leetcode-category-by-level) in a category by level.

## Array

- [1. Two Sum](https://hackmd.io/@Albert-Hu/leetcode-1)

## Binary Search

- [1. Two Sum](https://hackmd.io/@Albert-Hu/leetcode-1)

## Bit Manipulation

- [338. Counting Bits](https://hackmd.io/@Albert-Hu/leetcode-338)

## Dynamic Programming

- [338. Counting Bits](https://hackmd.io/@Albert-Hu/leetcode-338)
- [343. Integer Break](https://hackmd.io/@Albert-Hu/leetcode-343)

## Hash Table

- [1. Two Sum](https://hackmd.io/@Albert-Hu/leetcode-1)
- [3. Longest Substring Without Repeating Characters](https://hackmd.io/@Albert-Hu/leetcode-3)

## Linked List

- [2. Add Two Numbers](https://hackmd.io/@Albert-Hu/leetcode-2)

## Math

- [2. Add Two Numbers](https://hackmd.io/@Albert-Hu/leetcode-2)
- [343. Integer Break](https://hackmd.io/@Albert-Hu/leetcode-343)

## Sliding Window

- [3. Longest Substring Without Repeating Characters](https://hackmd.io/@Albert-Hu/leetcode-3)

## Sort

- [1. Two Sum](https://hackmd.io/@Albert-Hu/leetcode-1)

## String

- [3. Longest Substring Without Repeating Characters](https://hackmd.io/@Albert-Hu/leetcode-3)
- [6. ZigZag Conversion](https://hackmd.io/@Albert-Hu/leetcode-6)

## Two Pointers

- [3. Longest Substring Without Repeating Characters](https://hackmd.io/@Albert-Hu/leetcode-3)

###### tags: `leetcode`