Ofcourse we do...... But not only for motivation,but also for your efforts.......😊 Such type of free content is very helpful for those persons who are not capable to buy an expensive course......👍✨
I always amazed the level of intelligence you have brother, Thank you for this playlist, Trust me your playlist is making thousands/millions of students better coder.
used to solve this problem by myself but the solution was brute force method. Never have I ever thought this problem can be solved by such observation. Hats off to the effort Striver puts in his video. Incredible!
- [00:02](th-cam.com/video/bR7mQgwQ_o8/w-d-xo.html) 🧠 Overview of the DS Algo course and problem statement of Pascal's triangle - The course is extensive and covers over 400 problems in DS algo - Introduction to Pascal's triangle and its structure - Explanation of three types of problems related to Pascal's triangle - [03:53](th-cam.com/video/bR7mQgwQ_o8/w-d-xo.html) 🧮 Calculating nCr using brute force method - Discussing the traditional brute force method to calculate nCr - Explaining the formula for nCr and line-by-line code implementation for nCr calculation - Detailed explanation of time complexity considerations and space complexity - [10:55](th-cam.com/video/bR7mQgwQ_o8/w-d-xo.html) 🖨 Optimizing the calculation of nth row of Pascal's triangle - Introducing the optimization to calculate the nth row more efficiently - Deriving a formula based on observations to calculate elements of the nth row - Implementing the optimized code for generating and printing the nth row - [19:30](th-cam.com/video/bR7mQgwQ_o8/w-d-xo.html) 🪙 Generating the entire Pascal's triangle efficiently - Explaining a naive brute force approach to generate the entire Pascal's triangle - Describing a more optimized method using the second type of problem solution - Discussing the time complexity reduction strategy for generating the complete Pascal's triangle with improved efficiency - [22:02](th-cam.com/video/bR7mQgwQ_o8/w-d-xo.html) 🧮 Solution complexity analysis - Optimal time complexity for type 3 problem is O(n^2) - Generating each row has a time complexity of O(n) - Using long long data type is recommended due to potential large number calculations - [24:24](th-cam.com/video/bR7mQgwQ_o8/w-d-xo.html) 📝 Coding the solution - Write a function to generate a row based on the row number - Use the function to generate the entire triangle structure - Code quality is important in interviews, focus on readability and structure - [26:04](th-cam.com/video/bR7mQgwQ_o8/w-d-xo.html) 📚 Final notes and channel engagement - Encouragement to like the video to support content creation - Importance of subscribing for more content - Follow links in the description for further engagement on social media platforms
very very easy solutoion ..every time i can think about only brute solution but u gived both the solution at same time which is fantastic ...amazing love the way you teach
We can reduce the time complexity to (n^2/2) by running the inner loop only for row/2 times and assigning values symmetrically because the pascals triangle is symmetric. Thank you for the videos!
Can you please explain Space complexity of both the approaches of variation 3? Like how come it is O(1)(Written in the sheets notes and also strivers mentioned in the video
@@priyankasoni5537 yes its O(1) because we are not using any extra space like we are asked to print the pascals triangle so we are just using a list to store and print it that's it
Finally I was able to solve a problem before looking at your solution. That too hard one 😎 All thanks to your foundational videos on Arrays ♥ Watched the video anyways. Just to look at your approach
Frankly speaking I am not able to understand Pascal triangle problem until I watched this video, Earlier I see almost 5-7 videos on TH-cam , from those videos I Get what is the pascal triangle, but didn't able to solve the problem. After watching this video, I have confidence to solve any problem based on pascal triangle.
Thanks Striver, my code is not passing because of spacing issue in between digits😌 we can do in more way, pascle is nothing but power of 11, so if it's asking for N, then just run a loop from 1 to N and calculate the power(11, i), push into the vector if spacing is not considered. Stuck with spacing.
Hey striver, I was having a doubt that will you cover up some competitive programming concepts in this course or not?? Because covering all cp topics will make this course legendary and no one will be able to surpass this level in generations.
Timestamps 00:51 What do you mean by Pascal's Triangle? 02:27 3 Types of problems that might be asked to you 03:52 1st Type Problem Statement 06:56 Formula shortcut 07:49 Code 09:46 Complexity 10:31 recap 10:54 2nd Type Problem Statement 11:38 Brute force 12:18 Complexity 12:37 Optimal solution & Deep dive into formula and observation 15:11 Minor changes and formula 17:27 Pseudocode 19:06 Complexity 19:21 3rd Type Problem Statement 20:00 Brute force 20:07 Pseudocode 21:17 Complexity 21:50 Optimal Solution 22:19 Code 25:16 Interview Tip : Code Quality
Just a suggestion, don’t add ‘-‘ in timestamps, its 00:05 Intro Just a space :) it becomes easier for me to copy paste. Thank you for always adding it up 🫶
Python code for 1st variant def pascal(n,r): res = 1 for i in range(r): res = res * (n-i) res = res/(i+1) print(res) n = int(input("Value of N")) r = int(input("Value of R")) pascal(n-1,r-1)
class Solution(object): def pascal(self, numRows): pt=[[1]]*(numRows) pt[0]=[1] for i in range(1,numRows): pt[i]=[1]*(i+1) for j in range(1,i): pt[i][j] = pt[i-1][j-1]+pt[i-1][j] return pt for generating entire pascal's triangle.
I tried solving ncr problem with this approach but still test cases are failing for ex 69c43 You can search ncr problem gfg ... Can you try solving with first approach along with min(n-r, r) modification and let me know?
00:04 Pascal's Triangle - A pattern of numbers where each number is the sum of the two directly above it. 02:05 Finding element at a specific row and column in Pascal Triangle. 06:48 Shortcut for finding nCr in minimal time: multiply numbers from n to n-r+1. 09:11 The numerator in nCr calculation keeps getting multiplied and then divided with the value of i+1. 13:39 Pascal Triangle formula is used to find nCr in minimal time. 15:59 Pascal Triangle for finding nCr 20:22 Generate Pascal Triangle row in minimal time 22:16 Optimal solution for finding nCr in minimal time 26:16 The TH-camr encourages viewers to subscribe and engage with their content.
class Solution{ public: vector generateRow(int row) { long long ans = 1; vector ansRow; ansRow.push_back(1); //inserting the 1st element //calculate the rest of the elements: for (int col = 1; col < row; col++) { ans = (ans * (row - col))); ans = (ans / col)); ansRow.push_back(ans); } return ansRow; } vector nthRowOfPascalTriangle(int n) { // code here vector ans; //store the entire pascal's triangle: for (int row = 1; row
another solution for generating pascal triangle , its Time Complexity is O(n^2/2) and space complexity to O(n^2/2) class Solution { public: vector generate(int numRows) { vector ans(numRows); for(int i=0;i
@striver bhaiya could u please make a video on what are sample input output test cases constraints and how to code on online compilers on coding platforms as i am beginner and i am facing difficulty in understanding these
Need some advice! I have been doing DSA consistently for the last 1 month but I wasn’t able to come up with an efficient solution for this problem by myself. I don’t know if I am doing something wrong. Is this actually kind of advanced or I just need more practice?
00:04 Pascal's Triangle - A pattern of numbers where each number is the sum of the two directly above it. 02:05 Finding element at a specific row and column in Pascal Triangle. 06:48 Shortcut for finding nCr in minimal time: multiply numbers from n to n-r+1. 09:11 The numerator in nCr calculation keeps getting multiplied and then divided with the value of i+1. 13:39 Pascal Triangle formula is used to find nCr in minimal time. 15:59 Pascal Triangle for finding nCr 20:22 Generate Pascal Triangle row in minimal time 22:16 Optimal solution for finding nCr in minimal time 26:16 The TH-camr encourages viewers to subscribe and engage with their content. Crafted by jai rajputana
Just a small improvement for the nCr calculation. int findNumber(int n,int r) { long long res = 1; for(int i = n; i > max(r,n-r); --i) { res*=i; res/=(n-i+1); } return res; } Time Complexity : O( min(r, n-r) )
Can someone please explain how you intuitively figure out that a formula like the binomial coefficient needs to be used in a problem like this? I can't see how it would occur to me unless I've memorized it.
Please watch our new video on the same topic: th-cam.com/video/bR7mQgwQ_o8/w-d-xo.html
Recursion without a base case 😁😁
Bro one dout my code is executed in codestudio but not executed in leetcode y😢
@@arpitbhavsar6020 🤣🤣
Please do like the video, it won't cost you anything, but it will highly motivate me :)
Did this problem move to easy from hard?
Ofcourse we do......
But not only for motivation,but also for your efforts.......😊
Such type of free content is very helpful for those persons who are not capable to buy an expensive course......👍✨
done bhaiya
your videos actually got me out of depression and gave me aa hope at becoming better at DSA!!!!
got better?
What's the status now champ?
What's the update on your depression champ🎉
lol
lol update bro?
I always amazed the level of intelligence you have brother, Thank you for this playlist, Trust me your playlist is making thousands/millions of students better coder.
nCr = nC(n-r) so, we can take i < min(n, n - r) it is more efficient
will not affect complexity though so no need
used to solve this problem by myself but the solution was brute force method. Never have I ever thought this problem can be solved by such observation. Hats off to the effort Striver puts in his video. Incredible!
#include
using namespace std;
class PascalsTriangle{
private:
int Ncr(int n,int r)
{
int ans=1;
for(int i=1;i
- [00:02](th-cam.com/video/bR7mQgwQ_o8/w-d-xo.html) 🧠 Overview of the DS Algo course and problem statement of Pascal's triangle
- The course is extensive and covers over 400 problems in DS algo
- Introduction to Pascal's triangle and its structure
- Explanation of three types of problems related to Pascal's triangle
- [03:53](th-cam.com/video/bR7mQgwQ_o8/w-d-xo.html) 🧮 Calculating nCr using brute force method
- Discussing the traditional brute force method to calculate nCr
- Explaining the formula for nCr and line-by-line code implementation for nCr calculation
- Detailed explanation of time complexity considerations and space complexity
- [10:55](th-cam.com/video/bR7mQgwQ_o8/w-d-xo.html) 🖨 Optimizing the calculation of nth row of Pascal's triangle
- Introducing the optimization to calculate the nth row more efficiently
- Deriving a formula based on observations to calculate elements of the nth row
- Implementing the optimized code for generating and printing the nth row
- [19:30](th-cam.com/video/bR7mQgwQ_o8/w-d-xo.html) 🪙 Generating the entire Pascal's triangle efficiently
- Explaining a naive brute force approach to generate the entire Pascal's triangle
- Describing a more optimized method using the second type of problem solution
- Discussing the time complexity reduction strategy for generating the complete Pascal's triangle with improved efficiency
- [22:02](th-cam.com/video/bR7mQgwQ_o8/w-d-xo.html) 🧮 Solution complexity analysis
- Optimal time complexity for type 3 problem is O(n^2)
- Generating each row has a time complexity of O(n)
- Using long long data type is recommended due to potential large number calculations
- [24:24](th-cam.com/video/bR7mQgwQ_o8/w-d-xo.html) 📝 Coding the solution
- Write a function to generate a row based on the row number
- Use the function to generate the entire triangle structure
- Code quality is important in interviews, focus on readability and structure
- [26:04](th-cam.com/video/bR7mQgwQ_o8/w-d-xo.html) 📚 Final notes and channel engagement
- Encouragement to like the video to support content creation
- Importance of subscribing for more content
- Follow links in the description for further engagement on social media platforms
very very easy solutoion ..every time i can think about only brute solution but u gived both the solution at same time which is fantastic ...amazing love the way you teach
His involvement while he delivers the lecture is motivational ❤
We can reduce the time complexity to (n^2/2) by running the inner loop only for row/2 times and assigning values symmetrically because the pascals triangle is symmetric.
Thank you for the videos!
that's what I was thinking
To add symmetry to the result, you need to run a loop right? Or is there any other ways?
Can you please explain Space complexity of both the approaches of variation 3? Like how come it is O(1)(Written in the sheets notes and also strivers mentioned in the video
@@priyankasoni5537 yes its O(1) because we are not using any extra space like we are asked to print the pascals triangle so we are just using a list to store and print it that's it
@@AnkitKumar-su1yi thank u understood
Finally I was able to solve a problem before looking at your solution. That too hard one 😎 All thanks to your foundational videos on Arrays ♥
Watched the video anyways. Just to look at your approach
450 questions will need many months of continuous hard work. Hats off bhaiya
We have already covered > 60%, trees : 56, graphs: 56 dp: 56 ;)
there is no good playlist for string on TH-cam only one or two videos and its and important topic please start with string@@takeUforward
Frankly speaking I am not able to understand Pascal triangle problem until I watched this video, Earlier I see almost 5-7 videos on TH-cam , from those videos I Get what is the pascal triangle, but didn't able to solve the problem. After watching this video, I have confidence to solve any problem based on pascal triangle.
i think best teacher present is this man. Please try to motivate him and support him. Love you bro
Understood! Super awesome explanation as always, thank you very very much for your effort!!
APPROACH TO THIS PROBLEM IS SUPER SE V BHT BHT BHT ZYADA UPAR🔥🔥🔥🔥🔥🔥🔥🔥🔥
Thanks Striver, my code is not passing because of spacing issue in between digits😌 we can do in more way, pascle is nothing but power of 11, so if it's asking for N, then just run a loop from 1 to N and calculate the power(11, i), push into the vector if spacing is not considered. Stuck with spacing.
Hey striver, I was having a doubt that will you cover up some competitive programming concepts in this course or not?? Because covering all cp topics will make this course legendary and no one will be able to surpass this level in generations.
😂😂😂lol
Thank you very much for this amazing course 🎉❤
Thanks for taking us forward,, Striver❤
🔥🔥 love your teaching 🤗 you are my inspiration
Excellent 👌
Your explanation is superb ❤️❤️..
Ride on Striver.
It's a very tricky problem based of math nCr.. approach by you is really good
3:40 4th type question can be asked is sum of nth row
ans :simple left lift 1 by (n-1) that is 1
Each row is binomial expansion coefficient for certain power. We can directly use combination formula to get it .
SDE Sheet: Day 1 Problem 2 Done!
so how many have you done till now>?
UNDERSTOODDDD STRIVER !!!
Very Nice Explanation
Amazing explanation. thanks a ton. Working harder to make u proud.
Loved it, very well explained!
I did the last part with dp. Complexity was O(n^2)
You are the GOD of dsa
Timestamps
00:51 What do you mean by Pascal's Triangle?
02:27 3 Types of problems that might be asked to you
03:52 1st Type Problem Statement
06:56 Formula shortcut
07:49 Code
09:46 Complexity
10:31 recap
10:54 2nd Type Problem Statement
11:38 Brute force
12:18 Complexity
12:37 Optimal solution & Deep dive into formula and observation
15:11 Minor changes and formula
17:27 Pseudocode
19:06 Complexity
19:21 3rd Type Problem Statement
20:00 Brute force
20:07 Pseudocode
21:17 Complexity
21:50 Optimal Solution
22:19 Code
25:16 Interview Tip : Code Quality
Just a suggestion, don’t add ‘-‘ in timestamps, its
00:05 Intro
Just a space :) it becomes easier for me to copy paste.
Thank you for always adding it up 🫶
verrry good explanation and even the methods of solving the given problem😇
Python code for 1st variant
def pascal(n,r):
res = 1
for i in range(r):
res = res * (n-i)
res = res/(i+1)
print(res)
n = int(input("Value of N"))
r = int(input("Value of R"))
pascal(n-1,r-1)
Striver!!Please upload videos on binary search.
NICE SUPER EXCELLENT MOTIVATED
Understood brother, Thanks for this amazing amazing explanation...
superb explanation
Awesome explanation as usual💗
class Solution(object):
def pascal(self, numRows):
pt=[[1]]*(numRows)
pt[0]=[1]
for i in range(1,numRows):
pt[i]=[1]*(i+1)
for j in range(1,i):
pt[i][j] = pt[i-1][j-1]+pt[i-1][j]
return pt
for generating entire pascal's triangle.
Samaj aa gaya!!
instead, for the first problem, the loop should run for min(r, n-r) and not 'r' because if it is 10C7, r is bigger than n-r
I tried solving ncr problem with this approach but still test cases are failing for ex 69c43
You can search ncr problem gfg ... Can you try solving with first approach along with min(n-r, r) modification and let me know?
understood 😇
You are the best !
Excellent👍👏
Really amazed by ur Intelligence but i don't know why i am not think this kind of solution on my own why 😭😭😭
whats the intiution behind (n-1)C(r-1) ? can someone plz tell
I am also looking for its intuition, thanks for raising this , but nobody has still answered on it yet
12:43 yaha se dekh Bhai agr phir bhi na smjh aye TB btayio
Awesome video. Thankyou striver ❤❤
Understood very well
understood, thank you!
Understood, sir.
understood. Respect!
Great work....
Or you could use the previously stored values to generate the lower rows which will take O(n*n) TC
00:04 Pascal's Triangle - A pattern of numbers where each number is the sum of the two directly above it.
02:05 Finding element at a specific row and column in Pascal Triangle.
06:48 Shortcut for finding nCr in minimal time: multiply numbers from n to n-r+1.
09:11 The numerator in nCr calculation keeps getting multiplied and then divided with the value of i+1.
13:39 Pascal Triangle formula is used to find nCr in minimal time.
15:59 Pascal Triangle for finding nCr
20:22 Generate Pascal Triangle row in minimal time
22:16 Optimal solution for finding nCr in minimal time
26:16 The TH-camr encourages viewers to subscribe and engage with their content.
Aap 3rd year me the tab aap kitane hours Coding karate the??
Bhaiya, Combination wale question ki bhi list bana do please, Ya phir Combination ke concept ke baare mai ek acchi video bana do.
Understood, thank you.
Understood! sir
1st -> 3:51
2nd -> 10:55
3rd -> 19:21
Keep doing great 👍🎉
understood!!
understood ..Thanks🙂
thank you Anna
understood :) thankyou striver
Wonderful
Thanks bro. Understood
good video ... understood
For Part 1- 3:51 to 10:52, part 2- 10:56 to 19:14
We can use ncr=nc(n-r) when r>n/2 10:44
Thanks a lot my ninja.....
Understood ❤
understood!
Understood!
class Solution{
public:
vector generateRow(int row) {
long long ans = 1;
vector ansRow;
ansRow.push_back(1); //inserting the 1st element
//calculate the rest of the elements:
for (int col = 1; col < row; col++) {
ans = (ans * (row - col)));
ans = (ans / col));
ansRow.push_back(ans);
}
return ansRow;
}
vector nthRowOfPascalTriangle(int n) {
// code here
vector ans;
//store the entire pascal's triangle:
for (int row = 1; row
another solution for generating pascal triangle , its Time Complexity is O(n^2/2) and space complexity to O(n^2/2)
class Solution {
public:
vector generate(int numRows)
{
vector ans(numRows);
for(int i=0;i
Understood✅🔥🔥
I don't get the point where he bring the formula. How did he arrive that formula will give the output? anyone knows the answer?
understood👍
int mod = 1000000007;
int nCr(int n, int r){
if(n
mila iska ans ??
understood bhaiya
Can you pls pls plsssss do strings before binary search next plsss🙏 ?
Understood
Maja aagaya 😊
@striver bhaiya could u please make a video on what are sample input output test cases constraints and how to code on online compilers on coding platforms as i am beginner and i am facing difficulty in understanding these
Understood, thanks :)
Hi, Did anyone here faced probelm in Test Case 50 of Gfg. If yes, then can you please expalin how did you tackle?
We personally call it Parallel computing or Stacking method.
Need some advice! I have been doing DSA consistently for the last 1 month but I wasn’t able to come up with an efficient solution for this problem by myself. I don’t know if I am doing something wrong. Is this actually kind of advanced or I just need more practice?
00:04 Pascal's Triangle - A pattern of numbers where each number is the sum of the two directly above it.
02:05 Finding element at a specific row and column in Pascal Triangle.
06:48 Shortcut for finding nCr in minimal time: multiply numbers from n to n-r+1.
09:11 The numerator in nCr calculation keeps getting multiplied and then divided with the value of i+1.
13:39 Pascal Triangle formula is used to find nCr in minimal time.
15:59 Pascal Triangle for finding nCr
20:22 Generate Pascal Triangle row in minimal time
22:16 Optimal solution for finding nCr in minimal time
26:16 The TH-camr encourages viewers to subscribe and engage with their content.
Crafted by jai rajputana
Understood 🎉
understood.
This is great...I hope you earn enough from all this 😊
UNDERSTOOD;
helpful❤
Just a small improvement for the nCr calculation.
int findNumber(int n,int r)
{
long long res = 1;
for(int i = n; i > max(r,n-r); --i)
{
res*=i;
res/=(n-i+1);
}
return res;
}
Time Complexity : O( min(r, n-r) )
Can someone please explain how you intuitively figure out that a formula like the binomial coefficient needs to be used in a problem like this? I can't see how it would occur to me unless I've memorized it.