Category: Dynamic Programming

Categorised TODO - Interview Bit List Tiling Problem- Given a “2 x n” board and tiles of size “2 x 1”, count the number of ways to tile the given board using the 2 x 1 tiles. A tile can either be placed horizontally i.e., as a 1 x 2 tile or vertically i.e., as… Continue reading Dynamic Programming | Set 1 →

InterviewBIT [Type 1] Longest Common Substring GFG  Video (If you are seeing the video, note: - The number in matrix is not representing representing length of common substring but it is common substring length from the ending index. So "zbc" and "ab" are not having end index common so it should be 0. The is different… Continue reading Dynamic Prog | Depreacted →