Number of Ways to Reorder Array to Get Same BST II Pattern II Math II Combinatorics II Recursion

[@ARYANMITTAL]

Code & Notes: drive.google.com/file/d/1rsGuUwu-mWQT-I-oOvn6tctNc8McMJQZ/view?usp=sharing This is one of the best questions to use Combinatorics + Recursion 💪🙈 !!

[@dhanashreegodase4445]

thanks aryan , you are the real gem:) your videos never disspoints, thanks for giving each minor details for evey problems.

[@pokerfaced8139]

what a great intuition building, i m impressed.

[@artistic__08]

in all your videos you really put in a lot of effort. And you love to teach, clearly shows in the videos. Keep up the good work, I can see this channel become popular in future. Other channel don't explain intuition which makes this channel stand apart.

[@shashankarora2945]

Amazing explanation

[@AnshulSharma-gq2vn]

Brilliant!! Keep Going!💪💪

[@AnandKumar-qj2iy]

i just saw your video for the first time and I loved it so much......great explanation!!!

[@pranshu_awasthi]

GEM , ABSOLUTE GEM !

[@arihantjainajbil8182]

very nice

[@ShreyaMalik-1207]

thankyou i was about to cry

[@jagratgupta8392]

very nice problem.....understood the problem myself but couldn't understand that recursion will be used to solve subproblems.....great explaination sir

[@anujgupta9081]

man this is one of the best explanation I've ever seen, kudos!

[@tejuschaturvedi6234]

Your videos are always satisfyingly expalanatory . Never leave any doubt after completing the video .

[@mukultaneja7243]

Thanks Aryan, for this great explanation. Can you please also explain this?: We have another formula to find nCr -> ""(n * (n-1) * (n-2) * ..... r times) / (r * (r-1) * (r-2) * .... 1)"". Why does using this formula give us the wrong answer? Thanks already.

[@benoitblanc-zl8rc]

Im pretty sure this was 2+ hrs of effort Massive respect

[@yashagrawal1663]

wow

[@RahulMaurya-tc2wi]

Java Code if anybody is struggling, class Solution { private long[][] table; public int numOfWays(int[] nums) { ArrayListlist=new ArrayList(); for(int x:nums) { list.add(x); } long mod = (long)1e9 + 7; int n = nums.length; table=new long[n+1][n+1]; for (int i = 0; i < n + 1; ++i) { Arrays.fill(table[i],1); for (int j = 1; j < i; ++j) { table[i][j] = (table[i - 1][j - 1] + table[i - 1][j]) % mod; } } long ans = dfs(list, mod); return (int)((ans % mod - 1) % mod); } private long dfs(ArrayList nums,long mod) { int n = nums.size(); if (n

[@067_ayushkarroy9]

Thanks bro

[@gauravkungwani]

great explanation !!

[@balmukundkanodia6776]

Amazing explanation. Thanks a lot!!

[@rishijain8472]

understood in one go... Great Explanation

[@rishabhgupta9846]

Awesome explanation bro,bhai aise hi padhate raho

[@snigdhobhattacharya4697]

Thank you for the amazing explanation!

[@anzidd02091988]

awesome man, especially at time 20:46, 😃

[@Sakshi_6888]

Great Explanation, Thanks

[@MP-ny3ep]

Phenomenal explanation. I was having a hard time understanding the final formula but you explained it so good. Thank you . Please continue doing more videos.

[@gouthamp9066]

PYTHON: class Solution: def numOfWays(self, nums: List[int]) -> int: mod=10**9+7 def dfs(nums): if len(nums)nums[0]: right.append(num) else: left.append(num) left_poss=dfs(left) right_poss=dfs(right) n=len(nums) return ((comb(n-1,len(left))*left_poss)*(right_poss))%mod return dfs(nums)-1

[@yogesh8526]

Awesome Explanation !!!

[@rakeshydc4139]

Amazing Explanation brother! Didn't get confuse or bore even though it was Hard and 40 mins long

[@thisismrsanjay]

great work

[@यात्रा-ङ4छ]

return (((dp[n-1][len(left)] * left_perm) % mod )*right_perm) % mod is working but return ((dp[n-1][len(left)] * left_perm *right_perm) % mod isn't. If there any explaination please provide a response

[@gauravkungwani]

in each step, you should take mod because the value can go out of range.

[@yashagrawal1663]

Bhai why so about corporate life what happened?

[@thiyaneswarana3656]

jyada overacting mat kar yaar

[@amitbajpai6265]

Aryan bhai apko LISP hai ya acting karte ho ????