Practice makes perfect!

A large part of the problems come from LeetCode OJ, really a good platform for preparing technical coding interviews.

Some notes are taken while I was taking online courses Algorithms: Design and Analysis, Part 1 and Algorithms: Design and Analysis, Part 2 on Coursera. They are great algorithms courses.

The most useful program in this repository which solves sudoku puzzles:

• Sudoku Solver

Really hard LeetCode problems:

• Largest Rectangle in Histogram
• Maximal Rectangle
• Word Ladder II

There are some notes about classical algorithms:

• Next Permutation
• Edit Distance
• KMP
• Min Cut
• BFS & DFS
• Dijkstra's Algorithm
• Kosaraju's algorithm

Some notes about data structures:

• Linked List
• Heap
• Balanced Binary Search Tree
• Hash Tables

Some notes about classical algorithm design paradigms:

• Greedy
• Dynamic Programming

• Finish all problems on LeetCode OJ.
• Learn Algorithms: Design and Analysis, Part 1
• Learn Algorithms: Design and Analysis, Part 2
• Classify these problems into different categories.
• Simplify answers.