User Tools

Site Tools


programming:dynamic_programmig_questions

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Next revision
Previous revision
advanced:dynamic_programmig [2020/07/07 11:24] – created gerhardprogramming:dynamic_programmig_questions [2020/07/07 11:40] (current) gerhard
Line 2: Line 2:
 |<100% 25% - >| |<100% 25% - >|
 ^  \\ DATA ANALYTICS REFERENCE DOCUMENT\\ \\   ^^ ^  \\ DATA ANALYTICS REFERENCE DOCUMENT\\ \\   ^^
-^  Document Title:|Document Title|+^  Document Title:|Dynamic programming questions with solutions and detailed explanations|
 ^  Document No.:|1594121056| ^  Document No.:|1594121056|
 ^  Author(s):|Gerhard van der Linde| ^  Author(s):|Gerhard van der Linde|
Line 12: Line 12:
 |< 100% 10% - - 10% 17% 10% >| |< 100% 10% - - 10% 17% 10% >|
 ^  \\  Revision\\  \\  ^\\ Details of Modification(s)^\\ Reason for modification^  \\ Date  ^  \\ By  ^ ^  \\  Revision\\  \\  ^\\ Details of Modification(s)^\\ Reason for modification^  \\ Date  ^  \\ By  ^
-|  [[:doku.php?id=advanced:dynamic_programmig&do=revisions|0]]  |Draft release|Document description here|  2020/07/07 11:24  |  Gerhard van der Linde  |+|  [[:doku.php?id=advanced:dynamic_programmig&do=revisions|0]]  |Draft release|Document the collection of dynamic programming problems and solutions in python code|  2020/07/07 11:24  |  Gerhard van der Linde  |
  
  
 ---- ----
  
-====== Top 20 Dynamic programming Questions ======+====== Dynamic Programming Questions ====== 
 + 
 +Dynamic programming questions pops up in interview situations with the big technology companies and is used to asses analytical thinking and algorithm problem solving. 
  
   - Longest Common Subsequence   - Longest Common Subsequence
Line 169: Line 172:
   * The pair do not match   * The pair do not match
  
-{{:personal:leventein_1.jpg?nolink|}}+{{:advanced:dynamic_programming:leventein_1.jpg?nolink|}}
  
 If the pair match copy the diagonal value across If the pair match copy the diagonal value across
  
-{{:personal:leventein_2.jpg?nolink|}}+{{:advanced:dynamic_programming:leventein_2.jpg?nolink|}} 
  
 If the pair do not match, take the smallest of the three values highlighted and **add 1**. If the pair do not match, take the smallest of the three values highlighted and **add 1**.
programming/dynamic_programmig_questions.1594121066.txt.gz · Last modified: 2020/07/07 11:24 by gerhard