Factorial of Large Numbers🔥🔥 | Array | Amazon | Flipkart | Love Babbar DSA Sheet | Hindi
Vložit
- čas přidán 27. 07. 2024
- Time Stamps :
Problem discussion : 0:00
Approaching the problem : 03:00
Dry Run Algorithm : 04:30
Algorithm discussion : 07:10
Code explanation : 13:10
Time Complexity : O(n)
Space Complexity : O(d) where d is number of digits in factorial of n
Problem Link :www.geeksforgeeks.org/factori...
C++ Code Link : github.com/Ayu-99/Love-Babbar...
Love Babbar DSA Sheet : drive.google.com/file/d/1FMdN...
Please like, share and subscribe if you found the video useful. Feel free to ask in comments section if you have any doubts. :)
#DataStructuresAndAlgorithms
#LoveBabbarDSASheet
#interviewpreparation
Factorial of Large Numbers solution
Factorial of Large Numbers Leetcode
Factorial of Large Numbers C++
Factorial of Large Numbers C++ Hindi
Factorial of Large Numbers Hindi
Checkout the series: 🔥🔥🔥
👉 Array: • Arrays
👉 Recursion : • Recursion
👉 Stack and Queue : • Stack And Queue
👉 Greedy : • Greedy
👉 Leetcode contests : • Leetcode contests
👉 Leetcode June Challenge : • Leetcode June Challenge
👉 Leetcode July Challenge : • Leetcode July Challenge
LIKE | SHARE | SUBSCRIBE 🔥🔥😊
What an explanation 🤯!!! , Willing to see your more videos on similar topics 👌🏻🙌🏻
LIterally thanks yarrr. your explanations really very good ...really thanks yarr
Most welcome 😊
Thank thanks thanks a lot of thanks mam☺️
My pleasure. I am glad they are helping :)
yrr.. tum to best ho👍
abhi linked list start nhi kri mne.. but explanation was so clean.. samajh to aa gya😌
That's nice :)
Lovely explanation maam,maaza agaya approach mein.
Thanks Nitya😊
at 11:58, how will you print 120 ? if prev is pointing to the last node itself and how will you visit the next node?
Thank u mam got the idea
Welcome Rajarshi 😊
Thank You
Greatttt Work!!!!
Thank you🙂✌🏻
thanks a lot ayushi
Welcome. Glad it helped😊
Your voice is awesome
And thanks 🙏
Thank you so much for appreciating🙂
Ayushi ma'am nice explanation.
Thank you. Glad it helped :)
very nice explaination di
Thanks :)
What would be the time complexity of this approach? Loved the explanation tho! :)
Nice Explanation
Thank you. Glad you liked it :)
@@AyushiSharmaDSA I subscribed your channel after seeing your linked post yesterday :)
@@AyushiSharmaDSA waiting for backtracking videos
@@kvdmt2401 thank you :)
Thanks❤🌹🙏
Welcome :)
if you use vector data structure it would be much better. still, nice approach
But using linked list we are saving space.
we know that we are storing the unit digit in every node, then it is sure that we will always have carry
Suppose if your N = 1000 and the last node (whose prev is null) is having value 2 so you will multiply 1000 by 2 and will get 2000 and you will store 0 (2000%10) and you will get carry as 200 . Now you cannot insert 200 in one node itself. That's why she is breaking the carry
Hello Ayushi mam,
You explain very well any type of problem in my point of view you should not be a software engineer you should be a mathematics teacher.
😅😅 thanks Ajeet😊
@@AyushiSharmaDSA Mam, if you solve the questions that Love Babbar sir has prepared, will we get placement?
Please mention time and space
this code is giving wrong test case result for the first test case of 802
jhaa aapne null likhaa hai vhaa pe 100 aanaa cheeye thaa and vice versa
I have a question. In python, the integer datatype automatically expand it's limit and can store the factorial of large number. Is it allowed to use this method of python to use in interviews, etc. Thanks in advanced.
Yes Tushar, I think we can, never asked not to use in interviews to me :)
@@AyushiSharmaDSA Ohkk, thank you!
Aapne programming kha se sikhi main competitive programming ki tyaari kr rha hu
leetcode, gfg, interview bit, codeforces
@@AyushiSharmaDSA thankyou
Wrost explanation