---
layout: post
title:  "Daily Coding Problems by Category"
date:   2019-04-01 22:22:32 -0700
categories: Python/Java
---
* This will become a table of contents (this text will be scraped).
{:toc}

# Math


<details><summary> [Medium] LC 240. Search a 2D Matrix II</summary>

[Python Link](https://repl.it/@trsong/Search-a-2D-Matrix-II)

[Solution](https://repl.it/@trsong/Search-a-2D-Matrix-II)


**Question:** Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
- Integers in each row are sorted in ascending from left to right.
- Integers in each column are sorted in ascending from top to bottom.

**Example:**
```py
Consider the following matrix:

[
  [ 1,  4,  7, 11, 15],
  [ 2,  5,  8, 12, 19],
  [ 3,  6,  9, 16, 22],
  [10, 13, 14, 17, 24],
  [18, 21, 23, 26, 30]
]
Given target = 5, return True.
Given target = 20, return False.
```
</details>



## Puzzle
## XOR
## Hashing

# Array
## Basic
## Two Pointers
## Sliding Window
 
# List
## Singly Linked List
## Doubly Linked List
## circular linked list
## Fast-slow Pointers

# Sort
## Merge Sort
## Quick Select & Quick Sort
## Counting Sort

# Tree
## Recursion
## Traversal

# Stack
## Basic
## Advance

# Priority Queue
## Scheduling

# Hashmap
## Basic
## Advance

# Set
## Basic
## Advance

# Greedy

# Divide and Conquer

# Graph
## BFS
## Level-based BFS
## DFS
## Topological Sort
## Union Find

# Backtracking

# Dynamic Programming
## 1D DP
## 2D DP
## DP+ 

# String
## Anagram
## Palindrome


Add Daily Question by Category
Add Daily Question by Category
