Techniques

The general methods of algorithm design, such as divide and conquer and dynamic programming.

• Divide and conquer0 pages
• Dynamic programming0 pages
• Greedy0 pages
• Backtracking0 pages
• Branch and bound0 pages
• Search strategies0 pages
• Two pointers and windows0 pages
• Sweep line0 pages
• Meet in the middle0 pages
• Randomization techniques0 pages
• Reductions and transforms0 pages
• Bit tricks0 pages

This area has no pages yet. The coverage plan lists the pages that it needs. You can write one of them. Read how to contribute.