You've successfully subscribed to Nicholas Workshop
Great! Next, complete checkout for full access to Nicholas Workshop
Welcome back! You've successfully signed in.
Success! Your account is fully activated, you now have access to all content.
Success! Your billing info is updated.
Billing info update failed.

Dynamic Programming

Nicholas Wong
Nicholas Wong
  1. Come up with a recursive function
  2. Memorize the intermediate results
  3. Make it bottom up
Algorithm
Nicholas Wong

Nicholas Wong

Fullstack software engineer with strong background in computer science and extensive experience in software engineering and architecture. Studied in NYU, worked in Yahoo, Rakuten and Manulife.

You might also like

0/1 Knapsack Problem Dynamic Programming

0/1 Knapsack Problem Dynamic Programming
Members Public

Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. Drawing graphint[] plot(int[

Nicholas Wong
Nicholas Wong
Algorithm
Palindrome

Palindrome
Members Public

Definition of Palindromeleft-to-right, and right-to-left, and it’s the same. For examples: Abba A man, a plan, a canal - Panama!SolutionYou need 2 pointers, one at the beginning, another one in the end. Move them one by one towards the center and check if it's palindrome. boolean check(String

Nicholas Wong
Nicholas Wong
Algorithm

Authors →

Nicholas Wong

Fullstack software engineer with strong background in computer science and extensive experience in software engineering and architecture. Studied in NYU, worked in Yahoo, Rakuten and Manulife.