Atlassian Dynamic Programming Questions

11 dynamic programming problems asked at Atlassian interviews

Easy (1)Medium (5)Hard (5)

Questions

Title	Difficulty	Acceptance	Frequency
Minimum Cost to Convert String II	Hard	59.7%	62.6%
Best Time to Buy and Sell Stock	Easy	56.4%	52.9%
Russian Doll Envelopes	Hard	37.7%	45.3%
Longest String Chain	Medium	62.8%	45.3%
Jump Game II	Medium	42.5%	39.9%
Maximum Subarray	Medium	53.0%	39.9%
Longest Increasing Subsequence	Medium	59.1%	32.4%
Wildcard Matching	Hard	31.4%	32.4%
Count Palindromic Subsequences	Hard	41.0%	32.4%
Tallest Billboard	Hard	51.8%	32.4%
Best Time to Buy and Sell Stock II	Medium	70.8%	32.4%

Showing 11 questions