Meesho Dynamic Programming Questions

9 dynamic programming problems asked at Meesho interviews

Medium (5)Hard (4)

Questions

Title	Difficulty	Acceptance	Frequency
Minimum Edge Reversals So Every Node Is Reachable	Hard	57.3%	100.0%
Number of Strings Which Can Be Rearranged to Contain Substring	Medium	57.0%	78.0%
Delete and Earn	Medium	57.1%	78.0%
Painting the Walls	Hard	48.9%	78.0%
Number of Ways to Form a Target String Given a Dictionary	Hard	56.6%	73.9%
Minimum Number of Taps to Open to Water a Garden	Hard	51.0%	71.1%
Beautiful Arrangement	Medium	64.7%	61.3%
Jump Game	Medium	40.5%	61.3%
Longest Non-decreasing Subarray From Two Arrays	Medium	31.0%	61.3%

Showing 9 questions