Seonglae ChoResort to Optimal substructure
Dynamic Programming Notion
Dynamic Programming Techniques
Dynamic Programming - Learn to Solve Algorithmic Problems & Coding Challenges
Learn how to use Dynamic Programming in this course for beginners. It can help you solve complex programming problems, such as those often seen in programming interview questions about data structures and algorithms.
This course was developed by Alvin Zablan from Coderbyte. Coderbyte is one of the top websites for technical interview prep and coding challenges.
🔗 Check out the Coderbyte channel: https://www.youtube.com/channel/UCOJtQcnBnIy4LERo6vkrItg
🔗 Improve your coding and interview skills: https://coderbyte.com/member?promo=janpromo4351&utm_source=FCC&utm_medium=Video&utm_campaign=promo&utm_content=Dynamic%20Programming (NOT an affiliate link)
This course uses images and animations to help you visualize problems and important concepts. After understanding problems conceptually, you will learn how to solve them in JavaScript using Dynamic Programming. Even though JavaScript is used in this course, you will learn concepts and knowledge that you can apply to other programming languages.
⭐️ Course Contents ⭐️
⌨️ (00:00:00) course introduction
⌨️ (00:03:30) fib memoization
⌨️ (00:38:39) gridTraveler memoization
⌨️ (01:04:52) memoization recipe
⌨️ (01:09:56) canSum memoization
⌨️ (01:29:29) howSum memoization
⌨️ (01:52:06) bestSum memoization
⌨️ (02:12:45) canConstruct memoization
⌨️ (02:38:36) countConstruct memoization
⌨️ (02:47:30) allConstruct memoization
⌨️ (03:10:53) fib tabulation
⌨️ (03:22:17) gridTraveler tabulation
⌨️ (03:34:32) tabulation recipe
⌨️ (03:37:59) canSum tabulation
⌨️ (03:53:01) howSum tabulation
⌨️ (04:07:21) bestSum tabulation
⌨️ (04:20:50) canConstruct tabulation
⌨️ (04:38:06) countConstruct tabulation
⌨️ (04:50:23) allConstruct tabulation
⌨️ (05:07:44) closing thoughts
⭐️ Special thanks to our Champion supporters! ⭐️
🏆 Loc Do
🏆 Joseph C
🏆 DeezMaster
--
Learn to code for free and get a developer job: https://www.freecodecamp.org
Read hundreds of articles on programming: https://freecodecamp.org/news
https://www.youtube.com/watch?v=oBt53YbR9Kk
[Algorithm] DP(Dynamic Programming), 동적 계획법 (Bottom-Up, Top-Down)
#. 동적 계획법? ㅇ 동적계획법 = 다이나믹 프로그래밍(Dynamic Programming), DP- 벨만-포드 알고리즘을 개발한 벨만이 만들어낸 알고리즘- 알고리즘 이름을 어떻게 지으면 기억에 잘 남고, 간지(?)가 날지 생각하다가 다이나믹이라는 단어가 좋아서 이렇게 되었다는.. ㅇ 특징- 다음 상태를 구하기 위해, 이전 상태를 저장하고, 사용(Memoization)- 무엇을 어떻게 저장할지 정하는 것이 중요- 많이 풀어보고, 생각 과정을 연습하는 것이 중요.. ㅇ 적용 순서1. 상태 정의- dp배열을 만들었을 때, index값이 의미하는 상태- 문제의 초기상태를 정의(직관적인 작은 문제의 해)2. 점화식 구하기- 다음 상태를 나타내기 위한 표현식3. 시간복잡도 계산4. 구현 ㅇ 적용 방법1. Top..
![[Algorithm] DP(Dynamic Programming), 동적 계획법 (Bottom-Up, Top-Down)](https://www.notion.so/image/https%3A%2F%2Ft1.daumcdn.net%2Ftistory_admin%2Ffavicon%2Ftistory_favicon_32x32.ico?table=block&id=ec660d19-b46b-42e5-891f-c7558318c4b1&cache=v2){kind=small}
https://data-make.tistory.com/384
![[Algorithm] DP(Dynamic Programming), 동적 계획법 (Bottom-Up, Top-Down)](https://www.notion.so/image/https%3A%2F%2Fimg1.daumcdn.net%2Fthumb%2FR800x0%2F%3Fscode%3Dmtistory2%26fname%3Dhttps%253A%252F%252Ft1.daumcdn.net%252Ftistory_admin%252Fstatic%252Fimages%252FopenGraph%252Fopengraph.png?table=block&id=ec660d19-b46b-42e5-891f-c7558318c4b1&cache=v2)
Only Solve One New Problem At A Time
A few months ago, CodePen co-founders Chris Coyier and Alex Vazquez spent an hour reflecting on the top 10 lessons they've learned over the last decade of work at CodePen. The entire episode is value-packed; but, the one lesson that has haunted me is 6: One thing at a time (jump to track).
https://www.bennadel.com/blog/4352-only-solve-one-new-problem-at-a-time.htm
