Day 50 🔥🔥🔥| 100DaysofCode | Tamil | Tech Siddhar | Python Programming #TS

தமிழில் Progarmming தொடர்பான update பெற டெக் சித்தர் சேனலையை subscribe செய்யுங்க

---------------------------------------------------------------------------------
#DAY50

Question :Rod Cutting Problem

Given a rod of length n and list of prices of rod of length i where 1 graterthan or equal i greaterthan or equal n, find the optimal way to cut rod into smaller rods in order to maximize profit.

Input : length = [1, 2, 3, 4, 5, 6, 7, 8]

price = [1, 5, 8, 9, 10, 17, 17, 20]

n=4

Output : profit is 10

100DaysOfCode Playlist : https://www.youtube.com/playlist?list=PLhVRQY-S8E3QVslcUzl5wBcn6c1iehoZ9

Cracking the coding interview Playlist : https://www.youtube.com/watch?v=TA1x1Vf12zU&list=PLhVRQY-S8E3Rf2P1MqgFf4b5wX_27_OjA
GitHub Gist Link (Coding) : https://gist.github.com/JAYASANKARG/fee6329c28ad28d5a52330eaeda51bc7
---------------------------------------------------------------------------------
This channel content :

📌 Free certificate courses
📌 Competitive Programming
📌 Beginner to Expert
📌 Problem solving
📌 Tips and Tricks For Coding
📌 Current update technology

---------------------------------------------------------------------------------
Tech Siddhar
techsiddhar@gmail.com
---------------------------------------------------------------------------------

Disclaimer : this channel does not promote or encourage any illegal activities, all contents provided by this channel.

Copyright disclaimer under section 107 of the copyright act 1976, allowance is made for fair use for purposes such as criticism, comment, news reporting, teaching, scholarship and research. Fair use permitted by copyright statute that might otherwise be infringing. Non-profit, educational or personal use Tips the balance in favour of fair use.

Видео Day 50 🔥🔥🔥| 100DaysofCode | Tamil | Tech Siddhar | Python Programming #TS канала Tech Siddhar