#Dsa 2

Solve a variation of the Paint House problem with K colors using optimized dynamic programming.

Solve a variation of the Surrounded Regions problem using either DFS or BFS and a border flood fill approach.

Explain the brute-force approach for the weighted-graph shortest-path problem (Dijkstra's algorithm), move to the optimized solution, code it, and discuss its complexity and trade-offs. What would change if the constraints were different?

Solve the Round Robin CPU Scheduling problem.

Find the maximum alternating sum of an array after applying a right-shift operation on an arbitrary subarray.