dynamic programing related querry

i havnt studied dynaminc programing yet n m curious to kno wethr q. lyk dese PCYCLE and MAXCOUNT uses dynamic programing if not den wich algo wil be used to solve dem

i think both problem can be solve without dp very easily(by adhoc).

here are some dp problem (in decreasing order of difficulty) try to solve them

TABUS DEFACING OMAX RG_01 PACKBAND AEHASH LUCKPAL GERALD05 LEMAGIC LUKYDRIV LUCKY2 NUMPATH LEBALONS DIAMOND LWS LEMOUSE TOURNAM WSTRING RDF REIGN PANSTACK SHIRO DELISH MAXCOMP AMSGAME2 DBOY MGCRNK PPTEST SUMTRIAN

search for problem in easy section :slight_smile:

3 Likes

thanks man

//