Dynamic Programming with Java – Learn to Solve Algorithmic Problems & Coding Challenges
via freeCodeCamp
Overview
Learn how to apply Dynamic Programming with Java to solve algorithmic problems and coding challenges in this course. The course aims to equip beginners with the skills to tackle complex programming problems commonly encountered in technical interviews, focusing on data structures and algorithms. The teaching method involves practical application through solving various problems like fib, tribonacci, sum possible, min change, count paths, max path sum, non-adjacent sum, summing squares, and counting change. This course is intended for individuals interested in enhancing their problem-solving abilities and preparing for programming interviews.
Syllabus
course introduction
fib
tribonacci
sum possible
min change
count paths
max path sum
non adjacent sum
summing squares
counting change
Taught by
freeCodeCamp.org