Edit Distance - Dynamic Programming

 

Data Structure Operations Cheat Sheet

 

Sorting Algorithms Cheat Sheet

 

Look for Similarities Between Problems

 It is always a good idea to look for similarities between problems. By studying the differences and similarities between two problems, one usually gains insight into both problems. Given a new problem, the first question should be in almost all cases, "Is this problem similar to a known problem?" Sometimes, the similarities between two problems become apparent only after complicated reductions are exhibited. The reductions between matrix and graph algorithms are especially interesting.  

Eulerian Graphs

Longest Increasing Subsequence

Binary Search in a Cyclic Sequence

 

The Knapsack Problem

Finding the Maximum Consecutive Subsequence

 

The Skyline Problem

 

The Celebrity Problem