DSA - Level 1 - Tiling with M x 1 Tiles Dynamic Programming | Explanation with Code

Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that. NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we discuss the second variation of the Tiling problem where we are required to find and print all the configurations to tile a path of m*n units using tiles of m*1 units such that the path is completely paved. In this problem, 1. You are given a number n and a number m separated by line-break representing the length and breadth of a n * m floor. 2. You've an infinite supply of m * 1 tiles. 3. You are required to calculate and print the number of ways floor can be tiled using tiles. To submit this question, click here: https://www.pepcoding.com/resources/online-java-foundation/dynamic-programming-and-greedy/tiling2-official/ojquestion For a better experience and more exercises, VISIT: https://www.pepcoding.com/resources/online-java-foundation #dp #dynamicprogramming Have a look at our result: https://www.pepcoding.com/placements Follow us on our FB page: https://www.facebook.com/pepcoding Follow us on Instagram: https://www.instagram.com/pepcoding Follow us on LinkedIn: https://www.linkedin.com/company/pepcoding-education