programming:dynamic_programmig_questions
Differences
This shows you the differences between two versions of the page.
Next revision | Previous revisionNext revisionBoth sides next revision | ||
advanced:dynamic_programmig [2020/07/07 11:24] – created gerhard | advanced:dynamic_programmig [2020/07/07 11:33] – [Top 20 Dynamic programming Questions] 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.: | ^ Document No.: | ||
^ Author(s): | ^ Author(s): | ||
Line 12: | Line 12: | ||
|< 100% 10% - - 10% 17% 10% >| | |< 100% 10% - - 10% 17% 10% >| | ||
^ \\ Revision\\ | ^ \\ Revision\\ | ||
- | | [[: | + | | [[: |
---- | ---- | ||
- | ====== | + | ====== Dynamic programming ====== |
+ | |||
+ | 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: | + | {{:advanced: |
If the pair match copy the diagonal value across | If the pair match copy the diagonal value across | ||
- | {{:personal: | + | {{:advanced: |
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.txt · Last modified: 2020/07/07 11:40 by gerhard