Flipkart Dynamic Programming Questions

22 dynamic programming problems asked at Flipkart interviews

Easy (1)Medium (13)Hard (8)

Questions

Title	Difficulty	Acceptance	Frequency
The Score of Students Solving Math Expression	Hard	34.0%	82.0%
Trapping Rain Water	Hard	66.8%	76.6%
Cherry Pickup II	Hard	72.3%	59.9%
Sum of Subarray Minimums	Medium	38.3%	59.9%
Unique Paths	Medium	66.6%	59.9%
Edit Distance	Medium	60.2%	53.0%
Dungeon Game	Hard	40.9%	53.0%
Generate Parentheses	Medium	78.3%	53.0%
Cheapest Flights Within K Stops	Medium	41.4%	53.0%
Maximal Square	Medium	50.0%	53.0%
Partition Equal Subset Sum	Medium	49.2%	43.3%
01 Matrix	Medium	53.4%	43.3%
Cherry Pickup	Hard	39.1%	43.3%
Maximal Rectangle	Hard	58.1%	43.3%
House Robber	Medium	52.9%	43.3%
Filling Bookcase Shelves	Medium	68.6%	43.3%
Ways to Split Array Into Good Subarrays	Medium	34.8%	43.3%
Decode Ways	Medium	37.6%	43.3%
Best Time to Buy and Sell Stock	Easy	56.4%	43.3%
Binary Tree Maximum Path Sum	Hard	42.0%	43.3%
Longest Palindromic Substring	Medium	37.4%	43.3%
Split Array Largest Sum	Hard	59.9%	43.3%

Showing 22 questions