🔴 2860. Happy Students II Weekly Contest 363 II Leetcode 2860

[@iZoopSoul]

Great explanation. I have to remember to consider sorting the array first - sometimes you find cool patterns like this one.

[@notmewooshme9916]

The actual author of this question is the Tourist himself. Basically lc just took this question out from a codeforces contest.

[@yashwanthkumar817]

I find it difficult to come up with an approach

[@jeehub041]

Mast clear ho gya ❤

[@karapureddyjaswanthreddy6053]

Great explanation 🎉

[@udayanvats3640]

Really great explanation bhaiya🥳❤

[@ashishgoyal6256]

Guru ji linkdein request to accept kr lo 🙏🙏🙏

[@ritikanand3425]

i was able to come up with a recursive approach using all possible ways but was not able to memoize it as no subproblem exists

[@saswatamukherjee7144]

Can you share your recursive appraoch ?

[@AnkitKumar-ys7vs]

Yep can U share the recursive approach?

[@ritikanand3425]

@@AnkitKumar-ys7vs class Solution { public int countWays(List nums) { int n = nums.size(); int total = 0; for(int i = 0 ; i < n ;i++){ total+=nums.get(i); } int dp[][] = new int[n][total+1]; for(int i = 0 ; i < n ;i++){ Arrays.fill(dp[i] , -1); } return helper(nums , n-1 , Integer.MIN_VALUE , Integer.MAX_VALUE , 0,dp); } public int helper(List nums , int ci , int gt ,int lt ,int takeCount,int dp[][]){ if(ci < 0){ if(takeCount > gt && takeCount < lt){ return 1; }else{ return 0; } } if(dp[ci][takeCount]!=-1){ return dp[ci][takeCount]; } int take = helper(nums , ci-1 , Math.max(gt , nums.get(ci)) , lt , takeCount+1,dp); int notTake = helper(nums , ci-1 , gt , Math.min(lt , nums.get(ci)) , takeCount,dp); return dp[ci][takeCount] = take+notTake; } }

[@subhamsadhukhan9098]

Leetcode daily contest ka bhi le ke aao

[@doomhead9109]

leetcode par daily contest kaha hote h ?

[@subhamsadhukhan9098]

@@doomhead9109 daily challenge