Rishi Srivastava Pseudo code: int dp new intn + 1; for (int i 1; i is less than or equal to n; i++) int maxVal 1; for (int j 0; j is less than i; j++) maxVal MAX(maxVal, pricej + dpi j 1); dpi maxVal; return dpn; Time complexity O(n2) Space complexity O(n) Github: Coding Ninjas: