Walls Coloring GeeksForGeeks POTD 14 Feb | C++ Solution |
**************************
#potd #gfg #geeksforgeeks #walls #wallscoloring #potd #14feb
Hello Guys
Welcome to my YouTube Channel
Subscribe and click the bell icon to get notified.: http://bit.ly/_mahaveerYT
In this video we will be solving the POTD i.e. Problem of the day from the geeksforgeeks website.
Problem link:
https://practice.geeksforgeeks.org/pr...
Problem Code Github Link:
https://github.com/codewithgfg/GFG-PO...
Problem Statement = There is a row of N walls in Geeksland. The king of Geeksland ordered Alexa to color all the walls on the occasion of New Year. Alexa can color each wall with either pink, black, or yellow. The cost associated with coloring each wall with a particular color is represented by a 2D array colors of size N*3 , where colors[i][0], colors[i][1], and colors[i][2] is the cost of painting ith wall with colors pink, black, and yellow respectively.
You need to find the minimum cost to color all the walls such that no two adjacent walls have the same color.
You can contact me here:
Instagram :
/ _mahaveer_18
Thanks for watching.
Please like, share and subscribe.
**************************
#c++Solutions #coding #programming #gfg #gfgproblem #gfgproblemoftheday #14febgfg #dailysolutiongfg #potd #potdgfg #wallsgfg #14febwallscoloriproblemgfg
#array #programming #gfg #geeksforgeeks #problem #potd #coding #dsa #leetcode #podtproblem #wallscoloring #walls #house #housecoloring #dp #dpseries #coloring #dpproblems #dpproblem #