Google SWE Interview 2024 | DP & Backtracking | Arranging Bricks

Question 1: Arranging Bricks Problem Statement You have a line that contains N spaces of length 1 unit each. You also have a list L of length M containing bricks where each brick is of length L[i] units. Find the number of ways these M bricks can be placed in the same order as the list L with the minimum distance between any two bricks being at least K units. Input Format The first line of input contains T - ...