Accenture Dynamic Programming Questions

28 dynamic programming problems asked at Accenture interviews

Easy (5)Medium (19)Hard (4)

Questions

Title	Difficulty	Acceptance	Frequency
Best Time to Buy and Sell Stock	Easy	56.4%	86.9%
Climbing Stairs	Easy	53.9%	86.9%
Maximum Subarray	Medium	53.0%	82.7%
Delete and Earn	Medium	57.1%	77.7%
Longest Palindromic Substring	Medium	37.4%	74.8%
Perfect Squares	Medium	56.3%	63.1%
Fibonacci Number	Easy	73.9%	57.5%
Integer Break	Medium	61.9%	50.4%
Pascal's Triangle	Easy	78.7%	50.4%
House Robber	Medium	52.9%	50.4%
Coin Change	Medium	48.0%	50.4%
Edit Distance	Medium	60.2%	40.6%
Generate Parentheses	Medium	78.3%	40.6%
Unique Paths	Medium	66.6%	40.6%
01 Matrix	Medium	53.4%	40.6%
Longest Common Subsequence	Medium	58.9%	40.6%
Regular Expression Matching	Hard	30.5%	40.6%
Maximum Number of Moves in a Grid	Medium	58.8%	40.6%
Minimum Insertion Steps to Make a String Palindrome	Hard	73.7%	40.6%
Palindrome Partitioning	Medium	73.7%	40.6%
Trapping Rain Water	Hard	66.8%	40.6%
Best Time to Buy and Sell Stock II	Medium	70.8%	40.6%
Longest Palindromic Subsequence	Medium	65.1%	40.6%
Longest Increasing Subsequence	Medium	59.1%	40.6%
Longest Valid Parentheses	Hard	38.1%	40.6%
Sum of Subarray Minimums	Medium	38.3%	40.6%
Rotate Function	Medium	45.4%	40.6%
N-th Tribonacci Number	Easy	63.3%	40.6%

Showing 28 questions