Programming Interview Problems: Dynamic Programming (with solutions in Python) 1st Edition Leonardo ‎9798558191189

This completed downloadable of Programming Interview Problems: Dynamic Programming (with solutions in Python) 1st Edition Leonardo Rossi

Instant downloaded Programming Interview Problems: Dynamic Programming (with solutions in Python) 1st Edition Leonardo Rossi pdf docx epub after payment.

Product details:

• ISBN-13 ‏ : ‎ 9798558191189
• Author: Leonardo Rossi

Are you preparing for a programming interview?
Would you like to work at one of the Internet giants, such as Google, Facebook, Amazon, Apple, Microsoft or Netflix?
Are you looking for a software engineer position?
Are you studying computer science or programming?
Would you like to improve your programming skills?

If the answer to any of these questions is yes, this book is for you!

The book contains very detailed answers and explanations for the most common dynamic programming problems asked in programming interviews. The solutions consist of cleanly written code, with plenty of comments, accompanied by verbal explanations, hundreds of drawings, diagrams and detailed examples, to help you get a good understanding of even the toughest problems. The goal is for you to learn the patterns and principles needed to solve even dynamic programming problems that you have never seen before.

Table of contents:

Solution 1: brute force, O(2^n) time
Solution 2: dynamic programming, top-down
Solution 2: dynamic programming, bottom-up
Optimal stock market strategy
Solution 1: dynamic programming, top-down, O(n) time
Solution 2: dynamic programming, bottom-up, O(n) time
Variation: limited investment budget
Variation: limited number of transactions
Change-making
Clarification questions
Solution 1: dynamic programming, top-down, O(nv) time
Solution 2: dynamic programming, bottom-up, O(nv) time
Solution 3: dynamic programming + BFS, bottom-up, O(nv) time
Variant: count the number of ways to pay (permutations)
Solution: dynamic-programming, top-down, O(nv)
Variant: count the number of ways to pay (combinations)
Solution: dynamic-programming, top-down, O(nv)
Number of expressions with a target result
Clarification questions
Solution 1: brute-force, O(2^n) time
Solution 2: dynamic programming, top-down, O(nS) time
Solution 3: dynamic programming + BFS, bottom-up, O(nS) time
Unit tests
Partitioning a set into equal-sum parts
Clarification questions
Solution 1: dynamic programming, top-down, O(nS) time
Splitting a string without spaces into words
Clarification questions
Solution 1: dynamic programming, top-down, O(nw) time
Solution 2: dynamic programming + BFS/DFS, bottom-up, O(nw) time
The number of binary search trees
Solution 1: dynamic programming, top-down, O(n^2) time
The maximum-sum subarray
Clarification questions
Solution 1: dynamic programming, O(n) time, O(n) space
Solution 2: dynamic programming, O(n) time, O(1) space
Unit tests
The maximum-product subarray
Clarification questions
Solution 1: greedy, two-pass, O(n) time
Solution 2: dynamic programming, one-pass, O(n) time
Unit tests
Shortest pair of subarrays with target sum
Clarification questions
Solution 1: dynamic programming + sliding window, O(n) time, O(n) space
Longest palindromic substring
Clarification questions
Solution 1: brute force, O(n^3)
Checking if a string is a palindrome
Checking if a string is a palindrome: a faster way
Putting it all together
Solution 2: dynamic programming, O(n^2)
Solution 3: dynamic programming, O(n)
Unit tests
Longest valid parentheses substring
Clarification questions
Solution 1: dynamic programming, bottom-up, O(n)
Solution 3: dynamic programming, top-down, O(n)
Unit tests
Longest increasing subsequence
Clarification questions
Solution 1: dynamic programming, bottom-up, O(n^2) time, O(n^2) space
Solution 2: dynamic programming, bottom-up, O(n^2) time, O(n) space
Variant: count the number of solutions
Solution: dynamic programming, bottom-up, O(n^2) time, O(n) space
Longest arithmetic subsequence
Clarification questions
Solution 1: dynamic programming, bottom-up, O(n^2) time, O(n^2) space
Unit tests
Dealing the best hand of cards
Clarification questions
Solution 1: brute force, O(n^2) time
Solution 2: dynamic programming, O(n) time
Unit tests
Number of ways to climb stairs
Clarification questions
Solution 1: dynamic programming, top-down, O(n) time
Solution 2: dynamic programming, bottom-up, O(n) time
Solution 3: dynamic programming, bottom-up, O(1) time
Unit tests
Number of paths through maze
Clarification questions
Solution 1: dynamic programming, top-down, O(n^2) time
Solution 2: dynamic programming, bottom-up, O(n^2) time
Solution 3: dynamic programming, bottom-up, O(n^2) time, linear space
Unit tests
Maximum-score path through maze
Clarification questions
Solution 1: dynamic programming, top-down, O(n^2) time
Solution 2: dynamic programming, bottom-up, O(n^2) time
Solution 3: dynamic programming, bottom-up, O(n^2) time, linear space
Unit tests
Subarray sum
Clarification questions
Solution 1: brute-force
Solution 2: dynamic programming
Submatrix sum
Clarification questions
Solution 1: brute-force
Solution 2: dynamic programming
Unit tests
Largest square submatrix of ones
Clarification questions
Solution 1: brute-force
Solution 2: dynamic programming
Largest rectangle in skyline
Clarification questions
Solution 1: brute-force
Solution 2: dynamic programming
Solution 3: dynamic programming + stack
Largest submatrix of ones
Clarification questions
Solution 1: brute-force
Solution 2: dynamic programming
Solution 3: dynamic programming
Interleaved strings
Clarification questions
Solution 1: brute-force
Solution 2: dynamic programming
Regular expression matching
Clarification questions
Solution 1: brute-force
Solution 2: dynamic programming

People also search:

java programming problems for interview

common coding interview problems

50 popular coding interview problems

programming interview exercises

programming interview preparation