Salesforce SDE Interview Question 2024-January | Advanced Dynamic Programming | Off-campus

Question 1: Burst Balloons Problem Statement You are given n balloons, indexed from 0 to n - 1. Each balloon is painted with a number on it represented by an array nums. You are asked to burst all the balloons. If you burst the i-th balloon, you will get nums[i - 1] * nums[i] * nums[i + 1] coins. If i - 1 or i + 1 goes out of bounds of the array, then treat it as if there ...