3098. Find the Sum of Subsequence Powers | Leetcode Biweekly 127

[@Susindran.K]

what an explanation :) ,from brute force to optimized , just loved it 🙌

[@jayantsharma3968]

Great explanation!

[@miketsubasa3611]

Excellent Explanation

[@NeerajSharma-mz4es]

nice solution explanation

[@ujjwalagnihotri5001]

TOP notch content

[@prithwirajmitra3811]

Best explanation. Especially O(N^4) part

[@visheshmittal9985]

Loved the detailed explanation. Really helpful in building the intuition from scratch. Thankyou for the efforts. Keep it up!! 💯

[@Cools74]

Any hint for today leetcode problem D

[@codingmohan]

Haven't solved it yet. Will check in sometime.

[@ankurb07]

It's a simple multiset prob

[@PriyanshuGautam-v6e]

Hello sir, this is my code without memoization. It's giving TLE , but I haven't been able to implement memoization yet. I've been trying for a day now. Could you please help me by making changes to my code or providing some guidance to fix my solution? "After implementing memoization, the code produces incorrect output" int dp[55][55][2501]; int fxn(int i, int prev, int n, vector&nums, int k, int dif) { if (i == n) { return (k == 0); } // if (dp[i][prev + 1][k] != -1) return dp[i][prev + 1][k]; // Check if value is already computed int ans = 0; ans += fxn(i + 1, prev, n, nums, k, dif); if (prev == -1) { ans += fxn(i + 1, i, n, nums, k - 1, dif); } else if (nums[i] - nums[prev] >= dif) { ans += fxn(i + 1, i, n, nums, k - 1, dif); } return ans; // Memoize the result before returning } int32_t main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int n; cin >> n; int k; cin >> k; vectornums(n); for (int i = 0; i < n; i++) { cin >> nums[i]; } sets; sort(nums.begin(), nums.end()); for (int i = 0; i < nums.size(); i++) { for (int j = i + 1; j < nums.size(); j++) { s.insert(-1 * abs(nums[i] - nums[j])); } } int ans = 0; int prevCnt = 0; memset(dp, -1, sizeof(dp)); // Initialize dp array with -1 for (auto &i : s) { int dif = abs(i); int cnt = fxn(0, -1, nums.size(), nums, k, dif); cout

[@codingmohan]

Because you don't have "diff" inside your state, you need to reset your "dp" array for every "diff" you are calculating for.

[@PriyanshuGautam-v6e]

@@codingmohan Thank you, sir, it worked 🛐