Swiggy Dynamic Programming Questions

10 dynamic programming problems asked at Swiggy interviews

Easy (1)Medium (6)Hard (3)

Questions

Title	Difficulty	Acceptance	Frequency
Best Time to Buy and Sell Stock	Easy	56.4%	73.1%
Edit Distance	Medium	60.2%	73.1%
Unique Binary Search Trees	Medium	63.3%	66.1%
Distinct Subsequences	Hard	51.5%	66.1%
Maximum Profit in Job Scheduling	Hard	54.6%	56.2%
Minimum Number of Work Sessions to Finish the Tasks	Medium	34.6%	56.2%
Trapping Rain Water	Hard	66.8%	56.2%
Maximum Subarray	Medium	53.0%	56.2%
Longest Palindromic Substring	Medium	37.4%	56.2%
Maximum Product Subarray	Medium	36.0%	56.2%

Showing 10 questions