Turing Dynamic Programming Questions

10 dynamic programming problems asked at Turing interviews

Easy (2)Medium (7)Hard (1)

Questions

Title	Difficulty	Acceptance	Frequency
Minimum Cost For Tickets	Medium	67.4%	85.6%
Longest Arithmetic Subsequence	Medium	49.9%	72.2%
Longest Palindromic Substring	Medium	37.4%	67.2%
Minimum Number of Operations to Satisfy Conditions	Medium	41.7%	67.2%
Best Time to Buy and Sell Stock	Easy	56.4%	60.6%
Ugly Number II	Medium	49.5%	51.5%
Maximum Subarray	Medium	53.0%	51.5%
Maximum Repeating Substring	Easy	41.1%	51.5%
Race Car	Hard	44.6%	51.5%
Jump Game	Medium	40.5%	51.5%

Showing 10 questions