Dynamic programming, or DP, is an optimization technique. It is used in several fields, though this article focuses on its applications in the field of algorithms and computer programming.

The Defective Chessboard problem, also known as the Tiling Problem is an interesting problem. It is typically solved with a “divide and conquer” approach. The algorithm has a time complexity of O(n²). The problemGiven a n by n board where n is of form 2^k where k >

Most people look at terminals as bare screens with not much to do. In this tutorial, we'll find ways to spice up the unix terminal to make your workflow smooth and efficient. Hopefully, by the end of it, you'll fall in love with the terminal.