[User] Please transcribe this text

[Assistant] Even though Barr, I guess you could say Barr is more respected for what he did with Minnesota.


[User] Please transcribe this text

[Assistant] Babar is an older veteran player. Jalen Smith's a young veteran with a lot of production. And like I said, the dude was a multi pro bowler.


[User] Please transcribe this text

[Assistant] And the saints get him as their third linebacker.


[User] Please transcribe this text

[Assistant] That's not bad that's actually pretty good at the linebacker level.


[User] Please transcribe this text

[Assistant] Whether Die Hard, The Great St. Tank, and Who That Nation was saying, bro, we need to get this line. We need another linebacker. What y'all doing? Zach Bowen is not it. And I'm not saying.


[User] Please transcribe this text

[Assistant] No disrespect to Zach Bowen, but sometimes we need a little competition. You know, sometimes that's in sports. You needed something, a little extra incentive, extra motivation to kind of make sure you understand what you're doing because they got a guy that's right here that could be a problem for you. You know, if you won't stay in the league, we got a problem for you because this guy has been productive.


[User] Please transcribe this text

[Assistant] And two separate stints with two different teams and he's bringing that to New Orleans and he's talking like, Oh, it won't take me long to figure out what they don't. Cause I played in this style of system before. It's terrific.


[User] Please transcribe this text

[Assistant] All right. So anyway, shout out to the fam. I appreciate y'all being here. If y'all got any questions, what's up, brother Jared? How you doing?


[User] Please transcribe this text

[Assistant] Alright, what's up, Barbara? Good to see Barbara, and here, shout out to you, Queen.


[User] Please transcribe this text

[Assistant] Alright, y'all throw it in the chat, man. Y'all got any questions right quick or comments, man. Y'all can feel free. Please feel free to throw them in the chat, man. Let me know how you guys feel.


[User] Please transcribe this text

[Assistant] Uh, about some of this stuff that we covering. What's up, Dana? Shout out to you, baby. Pammy. Good to see you in the chat as well. The queens are representing. Much love to all the beautiful queens in here. My dog, Molly Mall was popping, brother. Good to see you in here as well.


[User] Please transcribe this text

[Assistant] And the rest of the fam. Much love to everybody. Brother Eric, I see you sir. Appreciate you being here as well. Demetra is much love. Fam, appreciate you. T Dirty. What's happening? T Dirty. Hey bro, I've seen your vid, man. With you getting up in the morning for the game day.


[User] Please transcribe this text

[Assistant] Shout out to my dog, T-Dirty, man. T-Dirty got a Saint 2 brush and every damn thing. T-Dirty got everything.


[User] Please transcribe this text

[Assistant] Sing, shout out to my brother T Dirty, man. Much love. Very, very, very imaginative and, uh, very smart sketch you did there, bro. Shout out to my boy, Phillip, man. Appreciate you, bro. How you doing, sir? He said, I agree about bowling. He's a liability in the passing game. Yes, sir. Bro, in practices, man. Listen, you know what?


[User] Please transcribe this text

[Assistant] Bro, you true to farm on that. Zach born, that's a part of his game that he still struggles struggles with and.


[User] Please transcribe this text

[Assistant] I don't think it's difficult for us to diagnose that he's not very good in it because the tape shows that he's not very good in it.


[User] Please transcribe this text

[Assistant] To me and y'all give y'all spill on, on why he's not good. It seems like it's.


[User] Please transcribe this text

[Assistant] His enti- and I call it anticipation. His enti- his anticipo- how do I phrase it? His enti- his anticipatat- I'm just gonna say. His anticipatory abilities. That's what I'm- that's what I'm trying to get out of here. His anticipatory abilities, if that's a word. Jesse, uh, he's- he's a type of dude that


[User] Please transcribe this text

[Assistant] Is reading, you can see he's reading the plays, but he reacts just like a little slow. And at times he takes, his angles are not good. You see what I'm saying?


[User] Please transcribe this text

[Assistant] So if he was, like if he can work on his anticipation abilities and what he's seeing, I think that'll help him out.


[User] Please transcribe this text

[Assistant] But when you got Jalen Smith, who's actually a lot better than him at that part of his game plan linebacker, because Zach Bowen, credit to him, Zach Bowen will get after you. He'll go and get the quarterback and sack you and bring you down. He's a good tackling linebacker.


[User] Please transcribe this text

[Assistant] But the other part of the game is dropping into coverage and covering running backs out of the backfield. He struggles with that.


[User] Please transcribe this text

[Assistant] Do we've had linebackers here that didn't have the best straight speed, you know what I'm saying? But they were well positioned. If you think about guys like.


[User] Please transcribe this text

[Assistant] Uh, who we had like that, that was here that I could think about, like linebackers that didn't have the great athleticism.


[User] Please transcribe this text

[Assistant] But they know, they knew they had great vision, they knew to put themselves.


[User] Please transcribe this text

[Assistant] In certain areas where they weren't out of position. We had quite a few of them, so.


[User] Please transcribe this text

[Assistant] That's a part of Zach Bowen's game that I personally see when I look at Zach Bowen is anticipation's off.


[User] Please transcribe this text

[Assistant] And he takes poor angles at times and it's just, that's a part of the game. That's not going to help. Now.


[User] Please transcribe this text

[Assistant] If Jalen Smith is what I'm anticipating him being, what he did with the Dallas Cowboys in a year, he played solidly with the Giants last year.


[User] Please transcribe this text

[Assistant] If he brings that here, Zach Bourne's in trouble. The only issue is, does Dennis Allen do what he did last year and says, uh, when it comes down to Zach Bourne and Eric Wilson, does he say, uh, I take Zach Bourne? You know, and then Eric Wilson on the practice squad, somebody pilfer's him later on in the year.


[User] Please transcribe this text

[Assistant] Or does he say, I got Jalen Smith here? You see what I'm saying? Is this the year Zach Vaughn is going if Jalen Smith beats him out for the third linebacker position? That's the question I'm asking.


[User] Please transcribe this text

[Assistant] Does Dennis Allen pull the trigger and say, uh, you're out of here? I don't know, bro. I don't really know. Y'all let me know how y'all feel about that. I don't know. Alright, so anyway.


[User] Please transcribe this text

[Assistant] Yeah. Okay. Yeah. Barbara says Vilma. Yeah. Yeah. He wasn't. That's a great one. Barbara, by the way, that's, that's actually a really great. That's Jonathan Vilma.


[User] Please transcribe this text

[Assistant] When he was with the Jets, Jonathan Vilma had, you know, he had some athleticism with him, but remember, didn't Jonathan Vilma, I remember he got hurt. And that's how the Saints was able to pick up Jonathan Vilma.


[User] Please transcribe this text

[Assistant] He was like a reclamation project that the Saints has cause he got hurt with the Jets and the Jets released them. If I'm, if my recollection serves, y'all back me up in a, in a great saying tank, tank man. Um.


[User] Please transcribe this text

[Assistant] I remember he got hurt with the Jets because Jonathan Billman was a guy that flew around the field. He got hurt with the Jets. The Jets put them in, they released them and the Saints picked them up and he was a bit of a reclamation project for the Saints and he took off, regained.


[User] Please transcribe this text

[Assistant] Uh, his, you know, he had division and everything and seeing that Jonathan Billman was no big guy, but Jonathan Billman was a guy that.


[User] Please transcribe this text

[Assistant] He had the ability to be around the ball.


[User] Please transcribe this text

[Assistant] You know, he didn't take all the poor angles and all that kind of stuff, but I remember him being hurt if my mind serves me correctly.


[User] Please transcribe this text

[Assistant] I remember him being hurt with the jets, the jets getting rid of them, the saints picked them up as a reclamation project. And that's how that stuff kind of popped and went. So man, let me tell you, that was something interesting.


[User] Please transcribe this text

[Assistant] Okay, K-Man said they both make the team. Okay, okay, cool. Okay, shout out to you K-Man. Thank you.


[User] Please transcribe this text

[Assistant] Yeah, that would be easy when Dennis South said, hey, they all both make the team. Well, what, one of these other linebackers?


[User] Please transcribe this text

[Assistant] Somebody got to play special teams, right? So, you know, well, we'll see how it all goes, man. Tim, shout out to you fam. Good to see you in the chat.


[User] Please transcribe this text

[Assistant] Dealing with the black and gold man and which direction they go. But yes, the, the, these are solid young veteran free agent pickups for the new Orleans saints. Getting Darryl Williams, getting a Jalen Smith and bringing them here. We were pushing for the saints for all of off season. Like where's the linebacker at? You know, Zach born's going to need somebody to push him.


[User] Please transcribe this text

[Assistant] If there's an injury with the linebacker room and it took all but a calf issue from DeMario Davis for the Saints sale.


[User] Please transcribe this text

[Assistant] Oh, let's go in the room and go see if we can find somebody out there.


[User] Please transcribe this text

[Assistant] And then they go at the bottom of the barrel and pick up some guy.


[User] Please transcribe this text

[Assistant] That you need to put a generic Saints helmet on his picture so that you can write a story about him. No, they actually got guys that were pro bowlers. They had multiple pro bowl years, respectable linebackers like Anthony Barr, who was respectable, who could still


[User] Please transcribe this text

[Assistant] Still has some gas in the tank. A young veteran like Jalen Smith who was a pro bowler as well.


[User] Please transcribe this text

[Assistant] And bring them on the team and they're doing really good. Like Darrell Williams is a really good acquisition for the Saints to bring for a third running back.


[User] Please transcribe this text

[Assistant] You know, to make the team. These are solid moves that show you that the saints are serious about.


[User] Please transcribe this text

[Assistant] During the season, you go out there with the 13 odd million dollars or whatever the Saints currently have.


[User] Please transcribe this text

[Assistant] Matter of fact, let me take a look at that. Let me see how much money these people got. I ain't checking the last couple of days. Let me see what the...


[User] Please transcribe this text

[Assistant] Give me a second fam, let me see what the Saints, cause that just popped up on my mind. Check the Saints, uh, cat figure right now.


[User] Please transcribe this text

[Assistant] Okay, it dropped a bit fam. Okay, okay. Alright.


[User] Please transcribe this text

[Assistant] The cap figure dropped about 8 million. They just over 8 million. That's according to SportTrack. Let me check over the cap right quick. Give me just a second fam. Let me check it over. Let me check that right quick. Okay, over the cap is saying, okay, alright, they got it at 11.4. Okay.


[User] Please transcribe this text

[Assistant] Alright, so over the cap, which is a lot of people prefer them over sport track.


[User] Please transcribe this text

[Assistant] And, uh, sport track is saying the saints are just over $8 million. So between eight to 11.4 is a nice little gap in money. But, uh.


[User] Please transcribe this text

[Assistant] But yes, that's, that's what it took. So the Saints still got money, man. They still have.


[User] Please transcribe this text

[Assistant] Uh, some money to be able to do some things here to keep things shaking and moving in the city.


[User] Please transcribe this text

[Assistant] And I just like the way they're doing that. You know, they're, they're moving in and handling the business. And of course.


[User] Please transcribe this text

[Assistant] During the season, it could be possible things that can happen. There's still the Zach Bowen, I mean, the Cesar Ruiz card, uh, to be played. There's several offensive linemen.


[User] Please transcribe this text

[Assistant] Uh, the Saints might need to address and, you know, usually kind of look at things during the season. We'll see how it all looks, uh, as we go forward, but.


[User] Please transcribe this text

[Assistant] Uh, the Jalen Smith deal is, uh, just over a million dollars. What was it? Uh, one year, one, uh, what a meal.


[User] Please transcribe this text

[Assistant] Uh, just over a million dollars for him. So he did got him cheap, cheap. I don't know if y'all seen that contract according to sport track, but here's the jail and Smith contract.


[User] Please transcribe this text

[Assistant] Uh, that signed with the team one year, just over a million bucks right there. Annual salary there. You see it. And, uh,


[User] Please transcribe this text

[Assistant] Cap hit of 940 grand. So that sport track showing you that it's just a one year deal. We knew it was a one year deal. Uh, but you know, just showing you guys here.


[User] Please transcribe this text

[Assistant] Well yeaah, it's interesting man to see exactly how this stuff is gonna all turn and go. So any questions fam? I'll throw it in the chat before we get ready to get on the part of this thing. Alright, Tuck Graph says 8 mil. They could lower the beer.


[User] Please transcribe this text

[Assistant] Well, that was, that was sport track and a lot of people prefer.


[User] Please transcribe this text

[Assistant] Over the cap because of the resources, a lot of that is executives and people like that that's feeding them the information. And you know, they figured it's the best, but it's really, I use both of them because usually the figure is somewhere in the middle between both of them.


[User] Please transcribe this text

[Assistant] But one is saying 8 or just over 8 and another one is saying 11.4.


[User] Please transcribe this text

[Assistant] Which would make sense because the Saints had what 13 million and they spent, uhm, like a million on Jalen Smith, a mil, just over a million on, uh, Darryl, on Darryl Williams. So that would take two million off of the cap. So that would put them.


[User] Please transcribe this text

[Assistant] At 11 something million dollars, somewhere between 10 and 11 million, unless something else hit. So, you know, yeah, so I would have to say that's probably where it is. All right.


[User] Please transcribe this text

[Assistant] All right. So anyway fam, uh, yeah. 11.4 says Pobatius. Yeah. Yeah. I just seen that, man. I would kind of, I probably would kind of lean on that side of things, man. Well, yeah. Anyway.


[User] Please transcribe this text

[Assistant] So that's what it comes down to when we talk about the linebacker position. So it's good to see Jalen Smith there to push Zach on.


[User] Please transcribe this text

[Assistant] Because Zach Bourne is still showing his inability to play the pass. That's problematic. That could be a big issue because people are targeting the hell out of him, man.


[User] Please transcribe this text

[Assistant] If, you know, if we have an issue with Pete Warner, God forbid, or DeMario Davis, you know, God forbid, uhm, that could be.


[User] Please transcribe this text

[Assistant] Pretty big for us if Zach Bowen is in there and Zach Bowen is, you know,


[User] Please transcribe this text

[Assistant] You know, getting their, they're going to target Zach Bowen and he getting towed up by Kyle Pitts or.


[User] Please transcribe this text

[Assistant] You know what I'm saying? Juneau Smith or, or, you know, they just targeting him because they know that guy can't cover that good. Just, you know, throw it at him.


[User] Please transcribe this text

[Assistant] So it can be problematic, so hopefully we don't have to deal with that.


[User] Please transcribe this text

[Assistant] Alright, Tuck Graf says, uh, Mickey Loomis acts like there's no cap. He really do. Ramsey says, who that Q? How did Smoke Monday during preseason game against the Chiefs? Not much to talk about with Smoke, Smoke.


[User] Please transcribe this text

[Assistant] Smoke is doing alright. He had a few flashes here or there. You'll hear Smoke Monday making some plays right here, uh, there, but there are a lot of other guys that you hear more than him. You're hearing.


[User] Please transcribe this text

[Assistant] Uh, more Hugo, you hear Hugo Amadi at the interception in the game off Alante, Taylor got there and got his hand, his ball, his hand on the ball to deflect it. And Hugo Amadi was around the ball. Like we know he always is, makes their interception on the play. And he's the one in practice that's showing up, making these things happen. So you hear from him a few things from Jordan Howden, uh,


[User] Please transcribe this text

[Assistant] Jonathan Abrams, not as much as I would like to hear on Jonathan Abrams.


[User] Please transcribe this text

[Assistant] But, uh, Lonnie Johnson Jr. Had a few things as well. So there are a few other guys there. And Smoke, here or there, you'll hear stuff from Smoke.


[User] Please transcribe this text

[Assistant] Uh, as well, but you know, we need to hear more from him over the next two weeks to kind of.


[User] Please transcribe this text

[Assistant] You know, to kinda, if he's trying to push for a position, he's kinda back there.


[User] Please transcribe this text

[Assistant] So he going to have to start flashing quick man, or he might, or he's definitely headed toward the practice squad. So yeah, it's a lot of competition in the safety room. So we'll see what's happening with smoke Monday, man.


[User] Please transcribe this text

[Assistant] Yeah, the hit was something. He had a big hit there. That's not bad.


[User] Please transcribe this text

[Assistant] All right, Rebsisq, how long you think we're going to Foskey before they cut him? I don't think they cut Foskey.


[User] Please transcribe this text

[Assistant] I don't think they cut, I don't think they cut Fosky. I think right now, now we just, the family was talking about this because of how Fosky looked in the game.


[User] Please transcribe this text

[Assistant] I think he will improve. I really do, but I just think other people are looking better than Foskey right now.


[User] Please transcribe this text

[Assistant] You know, like coming into this thing, we kind of look past passing you and pass you as like, hold on, don't pass me by.


[User] Please transcribe this text

[Assistant] Watch me pass this guy by and pass and you'll been stepping up and pass and you'll been looking good. And truth be told, pass and you'll has looked really solid. I mean, he's been what? If you want to talk about the defensive end, we know Cam look with excluding, excluding Cam and how they've been playing and, and, uh, and Cam.


[User] Please transcribe this text

[Assistant] And Cam, Cam's always what Cam does, he's the standard.


[User] Please transcribe this text

[Assistant] But you won't talk about other guys that's really playing hard. Carl Granderson and Peyton Turner look good, but PassingYo is a dude that really been handling this damn business.


[User] Please transcribe this text

[Assistant] And he's been turning it up and he has looked a lot, lot really good.


[User] Please transcribe this text

[Assistant] You know, he's like with them, he's grouped with those guys, like looking really good. Then we forget about the fact that, uh, passing y'all.


[User] Please transcribe this text

[Assistant] And Colin Sanders used to be on the team. So I was like, damn, that makes all the sense in the world.


[User] Please transcribe this text

[Assistant] But he's another big guy, 6, 7, 300 pound monster that's, that's past rushing, that's been working and getting better.


[User] Please transcribe this text

[Assistant] Cause he was hurt last year. Remember he was doing some positive things for the saints. He got banged up. We lost him for the rest of the year.


[User] Please transcribe this text

[Assistant] He's back with a vengeance and he's been playing his ass off this pre, this, this, this camp and he's just looked a lot better. And then of course.


[User] Please transcribe this text

[Assistant] It's Isaiah Foskey. He has to pick it up. That's one thing. He's a young player. He'll get it. But another thing is what guys playing like that, you don't Foskey can kind of.


[User] Please transcribe this text

[Assistant] I don't know if I can say take his time, but he's going to take some time to learn the position.


[User] Please transcribe this text

[Assistant] And eventually, you know, you rather have all of these great guys, but eventually Foskill flash.


[User] Please transcribe this text

[Assistant] But he's a rookie and all these other guys have been in the league for years. You got, uh, Peyton Turner has been in the league. This is third year. Uh, Granderson's been in the league for five years. He's been with the Saints for five years. This is fifth season.


[User] Please transcribe this text

[Assistant] So Granderson is playing well. He knows all the ins, the ins and outs of what he needs to do. He's improved every year and Granderson's solid. So you got Granderson there five years, Peyton Turner there three years passing your what was passing you.


[User] Please transcribe this text

[Assistant] Like seven, eight years. I want to say passing y'all been in the league. Is it that long for passing y'all? Let me, let me check on that.


[User] Please transcribe this text

[Assistant] It gotta be every bit of like seven or eight years for, for, for passing you. I want to say.


[User] Please transcribe this text

[Assistant] I don't know. Seven years. Yes. Seven years. So those guys have got him beat by a lot of time. So it's going to take some time for him to figure it out, but I think we are right. I think you'll be all right.


[User] Please transcribe this text

[Assistant] Tim says let's bring in Clowny to the Saints. Why bro? What do we need Clowny for? I don't think we need Clowny. I don't think we need him.


[User] Please transcribe this text

[Assistant] What's up brother Anthony, how you doing sir? Good to see you. JT says, I think, uh,


[User] Please transcribe this text

[Assistant] Shaq will make the team and the linebackers will field the special teams. You think Shaq Davis makes the team? Uh, give me, uh, let me see.


[User] Please transcribe this text

[Assistant] Okay, brother JT, you think he makes the team over AT Perry? Cause we know what our first top three wide receivers are going to be. So who's the other two? You know, you're thinking like they're going to keep five because.


[User] Please transcribe this text

[Assistant] They not gonna put A.T. Perry on the practice squad the way he playing.


[User] Please transcribe this text

[Assistant] You know, so does Shag Davis beat out A.T. Perry for a spot?


[User] Please transcribe this text

[Assistant] And then you also have to reserve a spot for a return man.


[User] Please transcribe this text

[Assistant] Somebody that's going to kick return, punt return. Shaq Davis doesn't return any punts, neither does A.T. Perry.


[User] Please transcribe this text

[Assistant] So you got, it's, it's a spot for AT Perry and a spot for Shaq Davis, the same damn spot. And then you look at the kick returner position, the fifth spot, which is going to be.


[User] Please transcribe this text

[Assistant] More probably between, uh, Lin Bowden Jr. and John Trey Kirkland for the kick return position. You gotta, you gotta have the returner spot, so.


[User] Please transcribe this text

[Assistant] You know, I think AT and Shaq are battling for that fourth spot for the wide receiver position for that guy that's behind the guy if he gets banged up.


[User] Please transcribe this text

[Assistant] He has to step in and make something happen. And then you get down to it. You got to decide on which one of these guys look ready to go.


[User] Please transcribe this text

[Assistant] Got in that game, six targets, six catches. He had a fantastic outing, the touchdown. He had the effort to go and dive for it.


[User] Please transcribe this text

[Assistant] Uh, he had concentration issues and I said when they drafted him, I said, oh man, Cody burns and get that out of.


[User] Please transcribe this text

[Assistant] And Cody Burns has been handling the business. So.


[User] Please transcribe this text

[Assistant] With those wide receivers. So Shaq Davis, I like Shaq. I don't know if he makes the team. I would have to go with A.T. Perry over him. I think Shaq will probably end up on the practice squad, but if injuries start mounting up, you never know what happens, bro. So we'll see.


[User] Please transcribe this text

[Assistant] What's up, brother Slim? How you doing, sir? Alright, so anyway.


[User] Please transcribe this text

[Assistant] Yeah, I don't know if I would say I wouldn't have, I don't think they cut them bro. All right. T dirty says, yeah. Trey Quine said what time you gonna pick?


[User] Please transcribe this text

[Assistant] You're not going to practice squad AT Perry. I'm just, I'm just, I'm sorry. The Saints, he's a what? Six round draft pick Saints picked up. They're not going to practice squad AT Perry. So Shaq Davis, it's a good problem to have is what it is. Cause we got these guys and somebody got to end up on the practice squad. Cause.


[User] Please transcribe this text

[Assistant] Injuries happen and we might have to pull guys from the practice squad on the active roster during the season. But in the end, it's inevitable that


[User] Please transcribe this text

[Assistant] Rayquan Smith is going to be right now. He got a growing issue.


[User] Please transcribe this text

[Assistant] Right now he's suffering from a groin issue. Other guys are getting their shine on. A.T. Perry got the ultimate shine.


[User] Please transcribe this text

[Assistant] And all the thing he has to do is just keep doing, stay healthy and keep doing maybe not six for six outings, but just be solid and he'll make the squad. Like I said, the Saints drafted Trey Quant, drafted.


[User] Please transcribe this text

[Assistant] Who out there didn't think, oh, they gonna cut trade requirements? Who out there? We seen this happening because we've been talking about it for years. Cause the man is not the first one in the building. He's not the last one to leave.


[User] Please transcribe this text

[Assistant] He got Mike Thomas as a teammate and I still don't understand.


[User] Please transcribe this text

[Assistant] Well, Mike Thomas, Taysom Hill and the guys that he had in that building and his same group, how he wasn't five times better than what he is now is beyond me. I'm sorry. No disrespect to Trey Quinceman. I don't know what you, I don't know what you got going on.


[User] Please transcribe this text

[Assistant] But all I'm saying is how could you not be better than what you was and you have Michael Thomas as your teammate?


[User] Please transcribe this text

[Assistant] All you have to do is just go follow Michael Thomas around. Cause all he do is just want to win. Hell, he trying to thumb wrestle. He trying to win.


[User] Please transcribe this text

[Assistant] You know, everything he trying to win. He playing toss the bottle he trying to win. Horseshoes. You know what I'm saying? Just follow Michael Thomas around. Look what Rashid Shahid did and he became out. He be great. He became overnight.


[User] Please transcribe this text

[Assistant] You know, working with Chris Olavi is it? Michael Thomas knows how to help guys that's in it. How did he not help you?


[User] Please transcribe this text

[Assistant] You know, that's the question. We don't need to be talking about whether or not the Saints are going to keep Trey Quine Smith. That's a far gone conclusion. The real question and the real mystery to the Trey Quine Smith thing is how did Trey Quine Smith not be better than what he is and he got Michael Thomas as a teammate. That's the bigger question. Explain that one to me.


[User] Please transcribe this text

[Assistant] Well, Michael Thomas ain't a good teacher. Tell that to Rashid Shahid. Tell that to Chris Olavi. So that's not an excuse. Next, Raekwon Smith's dedication to the game.


[User] Please transcribe this text

[Assistant] That's what it comes down to, to being a better person, not a person, but a better player.


[User] Please transcribe this text

[Assistant] Which can translate to being a better person as well.


[User] Please transcribe this text

[Assistant] But maybe he needs a breath of fresh air or a change of environment.


[User] Please transcribe this text

[Assistant] Maybe we're just too good here for him. Maybe he needs a stinky garbage time team they can go to and shine to make himself feel better.


[User] Please transcribe this text

[Assistant] Well, I would definitely invite him to go to the Tampa Bay Buccaneers. No disrespect to the Bucs. Go to the Atlanta Falcons. No disrespect to the Falcons. Oh, the Carolina Panthers. No disrespect.


[User] Please transcribe this text

[Assistant] You could take Trey Kwan Smith and you can help him out and he can go to and block wealth for you and drop passes that he's supposed to catch. We've seen enough. We've had enough. We've given him what? Five, six years. He been in for what? Five years now.


[User] Please transcribe this text

[Assistant] He worked all the way through his third round contract and then the Saints bring him back for an extra year and he still don't do nothing.


[User] Please transcribe this text

[Assistant] Man, it's time to go, man. Let's go, man. What we talking about? What we talking about?


[User] Please transcribe this text

[Assistant] What we talking about? This is, he even know that his people know it's over with. This is a competitive business. You have to produce.


[User] Please transcribe this text

[Assistant] You got to produce in the NFL. This is a positive result. They say it's a result driven business. No, no, no, no. It is a positive result. It's a big difference between result driven and positive result driven because you can get a result.


[User] Please transcribe this text

[Assistant] You know, it's a difference, but it's a positive result driven business. That's how this thing goes. And you have to produce. Demand does not produce and blocking is not enough. So the saints line up all of these people to compete with him.


[User] Please transcribe this text

[Assistant] And pushing further and the saints even gave him an extra year on top of it to figure out whether or not you can finally do it and he still didn't do it.


[User] Please transcribe this text

[Assistant] So I mean, this is a far gone conclusion. It's A.T. Perry time now.


[User] Please transcribe this text

[Assistant] Treyquan Smith, man, whatever, man. Treyquan Smith the hell up outta here, man.


[User] Please transcribe this text

[Assistant] All right, Kuvayda said the way they releasing Trey Quine might stick around against Selling. Let me tell you, bro.


[User] Please transcribe this text

[Assistant] When it come down to Dennis Allen picking 53 men in roster, like what he did last year, the ones that really came down, like he practiced quite a Kirk Merritt when Kirk Merritt was


[User] Please transcribe this text

[Assistant] To me, probably to precede, well, he was like the training camp MVP. He was really doing a lot of positive stuff for him last year. He was playing wide receivers, balling, running back. Oh, you won't play running back. He was doing that. Everything he was doing was positive and he still practice squad at the mat. You know?


[User] Please transcribe this text

[Assistant] And then when it came down to the linebacker position, I mentioned this before, Eric Wilson, who we picked up from Minnesota, signed him. He looked like Cam. He looked, he had the same Cam energy. You know, Cam is crazy. He got them big bucks. He'd be bucking his eyes and looking. Somebody asks a question and his head, you know, uh, uh,


[User] Please transcribe this text

[Assistant] Snaps to the left of somebody to the right. Accidentally, and I don't think cam blinks. I don't that I think he's, I don't, I think cam's a robot.


[User] Please transcribe this text

[Assistant] He doesn't blink, so his eyes are always open and they buckin'.


[User] Please transcribe this text

[Assistant] So he's like asking, he's looking right through, he always comes, he got all that energy.


[User] Please transcribe this text

[Assistant] But Eric Wilson had the same cam type energy. He had the same buck and eyes and he had the same kid like energy that cam had.


[User] Please transcribe this text

[Assistant] And when he was out there playing, he was playing real well, like next to DeMario Davis, like they played together for years.


[User] Please transcribe this text

[Assistant] And he wasn't no rookie. He was a veteran that knew their scheme, their scheme and their system. And he was perfect for the saints. And Dennis Allen was a defensive minded coach.


[User] Please transcribe this text

[Assistant] Eric Wilson and put him on the practice squad and put Zach born on the active roster and Zach born didn't do a damn thing last year in the preseason and was coming off an injury.


[User] Please transcribe this text

[Assistant] But in the end, that's what I'm saying. When it comes down to pickings, when it gets down to the toughies.


[User] Please transcribe this text

[Assistant] Where did he, where does he go? Cause I didn't like what he did last year on those two.


[User] Please transcribe this text

[Assistant] You had playmakers there. You got to keep the playmakers and the guys that's not making the moves.


[User] Please transcribe this text

[Assistant] You got to put them on the practice squad because they need more practice. Who on this team need more practice than Tre'Quan Smith?


[User] Please transcribe this text

[Assistant] I mean, maybe you can go practice with somebody else. That's a far gone conclusion, man. That ain't even nothing to talk about. He up out of here.


[User] Please transcribe this text

[Assistant] No cap, no filter says, Q, you think we need, uh, a wire receiver and pass rusher to be set? I do. Yeah. Well, Pat, you, uh,


[User] Please transcribe this text

[Assistant] You're right, the past Russian position is very important, bro.


[User] Please transcribe this text

[Assistant] You know, nothing works right on the defense with that pass rush there. Like we can have a top number one secondary in the league.


[User] Please transcribe this text

[Assistant] But if we not get no pass rushing, guys can sit back there and look for.


[User] Please transcribe this text

[Assistant] Stuff all day bro, they'll kill your secondary. The pressure is what generates a lot of those people to speed the process up, to force them to make throws. You know, you know, with their offenses, you already know that the offenses are driven on time. And the whole, the whole thought process is disrupting the time.


[User] Please transcribe this text

[Assistant] So that we, one of the biggest mechanisms of time disruption from a defensive standpoint is we got to get pressure on the quarterback. So what the saints astutely did this year was as they knew that they had good edge rushers.


[User] Please transcribe this text

[Assistant] What they did was they got the interior defensive line guys to provide a push. They looked at the tape and see, man, we wasn't getting no push last year.


[User] Please transcribe this text

[Assistant] From the interior perspective, that's the worst pressure that a quarterback, any quarterback, mobile or, or statue or otherwise do not like. They do not like pressure.


[User] Please transcribe this text

[Assistant] From right into their face, like right up the center of the defensive, the offensive line pushing in. They do not like that.


[User] Please transcribe this text

[Assistant] It throws everything off. It forces him to flee into the open hands of Cam Jordan, the Karl Granitz and the Peyton Turner, whoever's out there.


[User] Please transcribe this text

[Assistant] That we didn't have last year. Not only would they stop the run, that's, that's a far gone conclusion, but they'll provide the push. So you're right.


[User] Please transcribe this text

[Assistant] So getting pass rush from my interior guys and from my exterior guys, those are very, that's very good.


[User] Please transcribe this text

[Assistant] Passing you a very bright spot too, because we know Fosky is still developing and he'll come along.


[User] Please transcribe this text

[Assistant] But right now we looking good. Five deep cam, granderson, Peyton Turner passing yo and eventually Foskey coming along. We looking good five deep. So I'm feeling really good. And of course, if injuries start impacting us right here, we still got guys that can help us out. And then from the wide receiver perspective, you're right. Rashid Shahid dinged up for the rest of the preseason.


[User] Please transcribe this text

[Assistant] Michael Thomas is coming off of injury. He's been out for the last couple of what?


[User] Please transcribe this text

[Assistant] You know, not playing many games at all over the last several years. So you still need that.


[User] Please transcribe this text

[Assistant] Uh, that depth there to help out. So I'm comfortable with seeing a T para there, but you know.


[User] Please transcribe this text

[Assistant] We'll see how it all goes bro, but I think the Sinks have put some people on the practice squad too, and if they stay.


[User] Please transcribe this text

[Assistant] Uh, how they been doing right now, they keep that mentality going into the season when games do count. Like if there's an injury that pops up, let's go out here and get this wide receiver right away. I think that'll be fine. It's, and plus they have what, 11 something million dollars according to over the track. I mean, over the cap.


[User] Please transcribe this text

[Assistant] And they got $11 million. That's perfect to have, especially when you're going into the season, because if injuries pop up at certain positions, you have the money to go out and address the need right away.


[User] Please transcribe this text

[Assistant] That's the same damn thing Philadelphia did last year when they started getting injuries to the internal defensive line, the two-star defensive lineman got hurt. They went out to the free agency market, picked up endowment consume and that other big old guy. And that helped them to keep it together to some of them guys came back and they were able to make a deep playoff run.


[User] Please transcribe this text

[Assistant] That's how you handle the business. So the saints smartly keeping all this money on the side while getting young veterans that can impact.


[User] Please transcribe this text

[Assistant] And as long as they stay progressive in doing that type of thinking, man, listen, they can, they can make something pop and snap for us for real. Skylife, how you doing, sir? Appreciate you being here. All right.


[User] Please transcribe this text

[Assistant] Yeah, much love and I appreciate y'all being in the, in the, yeah. TuckRap says, uh, we were clearing house on defensive players and coaches. Yes, indeed. All right.


[User] Please transcribe this text

[Assistant] Not quite, my brother, not quite, man. But I do be around there, man. Y'all don't know, I be around there.


[User] Please transcribe this text

[Assistant] All right. How you doing brother Lee? Good to see you fan. Appreciate your brother. JT says Q when you surprise us with the new.


[User] Please transcribe this text

[Assistant] Ah, that's right, the new build in old poydras, huh?


[User] Please transcribe this text

[Assistant] Nah, bruh, I don't know where that's coming from, the new building on Poyage's Brothers. No, no sir, uh, listen fam.


[User] Please transcribe this text

[Assistant] Uh, yeah, it's been, you know, we've been together for a long time, uh, talking saints and, you know, for a long time, fam, we've been together for a long time.


[User] Please transcribe this text

[Assistant] And there's a lot of stuff going on that's very positive. That's why I always thank you guys for the support and the love and just the time you give because you really don't have to.


[User] Please transcribe this text

[Assistant] You guys, uh, it's a million things that you could be doing or watching and we're here together at this time. And I think that you're so valuable and I extend thanks to you guys for all the love and support.


[User] Please transcribe this text

[Assistant] Uh, that you've been given over the years and all I can do is give you the love and all that stuff. It's a circle. It's a circle, baby. It's a circle. It's a circle of love, baby. Going right back to you.


[User] Please transcribe this text

[Assistant] So it's just fantastic and all the financial support, the families from the members and the patron. We were able to do some fantastic things. Uhm, it's just improving the platform overall.


[User] Please transcribe this text

[Assistant] Uh, the new, the whodatdaily.com website with the writers there doing terrific jobs there.


[User] Please transcribe this text

[Assistant] You know, we had a, you know, I had a friend of mine, like I told you the other show, uh, that died from cancer. She had, uh, she had, uh,


[User] Please transcribe this text

[Assistant] And she was in pain. She lives in Texas and of course I'm in Louisiana, but you know, um, you know, we kind of lost contact with each other and she reached back to me through Facebook and I haven't spoken to her for like 20 years, you know.


[User] Please transcribe this text

[Assistant] And she was kind of explaining everything and we talked, we used to have, she talked, she was one of the, she was a, a person that talked about like love and relationship, like, like, not physical, but like spiritual.


[User] Please transcribe this text

[Assistant] Stuff like that, she was in that realm of thinking, like, really great light.


[User] Please transcribe this text

[Assistant] And not one time, I promise you, not one time. Cause I would send care packages like alkaline water and I would send, uh, uh, vibrational links.


[User] Please transcribe this text

[Assistant] Would end up the way it was not one time that I think I said, you're going to beat this.


[User] Please transcribe this text

[Assistant] You're gonna make it through it. Everything's gonna be fine. We're gonna celebrate.


[User] Please transcribe this text

[Assistant] And she had, she had pains and stuff where she couldn't talk and she had bad days, good days, stuff like that. So the last few days prior to me finding out she passed away.


[User] Please transcribe this text

[Assistant] I was, you know, I'm telling you, it's real. It's like I was having, uh, my thoughts, like, you know.


[User] Please transcribe this text

[Assistant] I'll call the check on her because she's like, I'll call you cause I'll call that she wouldn't answer.


[User] Please transcribe this text

[Assistant] Because she, you know, she going through pain and I don't know if she was sleeping or whatnot. So I was like, look, you, you got my number, just reach out. Just want to make sure you good. But you know, she didn't make it. She lost. She, she didn't make it. And not one time.


[User] Please transcribe this text

[Assistant] In my whole process of talking to her, since she reached back to me, that I ever thought that that would happen. Nah, that thought did not happen in my head. So when it hit me that she was transitioned and she was gone, two mixed, mixed feelings, mixed feelings was, you know, you know, of course it's you human, mixed feelings.


[User] Please transcribe this text

[Assistant] Uh, my first feeling was like, damn, you know, she gone, but you know, you know what? She don't have to be in pain no more.


[User] Please transcribe this text

[Assistant] She ain't in pain no more, she up in heaven cause she was really a great person. Like she was a great person. And I said the words like, today the world is a little dimmer.


[User] Please transcribe this text

[Assistant] You know, but in the absence of her life, she was a great person.


[User] Please transcribe this text

[Assistant] When, when it happened, I was like damn, the world lost the real Jim and, uh, but she's not in pain no more. So that kind of made me feel.


[User] Please transcribe this text

[Assistant] You know, feel really good that she's not suffering because she was suffering. She was suffering in the last.


[User] Please transcribe this text

[Assistant] Uh, message, she was saying that she found new masses and stuff in there, several new masses. And it was just, you know, it was hard.


[User] Please transcribe this text

[Assistant] You know, talking to her, what she was going through and she, you know, and she just did, she transitioned, so.


[User] Please transcribe this text

[Assistant] It's, it's, it, it goes to show you like, and she was a big, uh,


[User] Please transcribe this text

[Assistant] Uh, promoter of living your life, hugging your children.


[User] Please transcribe this text

[Assistant] Uh, enjoying things like that and I'm, I'm already an affectionate guy, so I always, I hug my boys and I play with them and stuff like that. So she was a big advocate of, um, not procrastinating, living in the moment.


[User] Please transcribe this text

[Assistant] She was promoting, you need to take more pictures when you in there cooking.


[User] Please transcribe this text

[Assistant] Make sure, and I'm not really a picture taker, but because of her influence, you know, saying that you need to capture some of these moments.


[User] Please transcribe this text

[Assistant] You know, and send me a picture of what you cooking and stuff like that and.


[User] Please transcribe this text

[Assistant] Uh, you know, begrudgingly, uh, dull. Okay. All right. I'll send you a picture. Uh, you know, I'm trying to, I'm trying to get up out and get off the damn stoves. I got stuff to do.


[User] Please transcribe this text

[Assistant] But you know, I did it, man, you know, and it was positive, man, but.


[User] Please transcribe this text

[Assistant] She is now in heaven, man. And listen, man, it's tough, but that's some of the stuff that we talk about here, like enjoying life and the experience of talking to you guys and.


[User] Please transcribe this text

[Assistant] Take her wise words and apply them. If these words are reaching your heart and your ears, use her wise words and apply them in your life. Don't procrastinate. Whatever you need to do that's positive. Get it done and execute. Don't wait. So, you know, that's what I'm doing there, so.


[User] Please transcribe this text

[Assistant] Alright. Alright, so much love to the fam, man. Uhm, listen, I'ma get ready to get out on that.


[User] Please transcribe this text

[Assistant] I appreciate you guys so much for listening to me and being here and spending some time with me in the stream. Uhm, much love to everybody, man. Listen.


[User] Please transcribe this text

[Assistant] Uh, tomorrow is Thursday is, uh, of course we know that's, uh, the Saints new, uh, United, uh, stream that we usually do where all the family members chime in. So listen, we'll be back here for Thursday. We'll get it kicked off with the, with the.


[User] Please transcribe this text

[Assistant] Uh, the Nola bros followed by my boy's hoodie and then Randolph is there as well. Who that nation united baby is going down. Also to let the family members know that, um, he was working on behind the scenes family of setting up the, the, uh,


[User] Please transcribe this text

[Assistant] I'm sorry, the, uh, what you call it, the, uh, the NFC South Stream fam. Y'all remember that?


[User] Please transcribe this text

[Assistant] The NFC South stream, uh, with, uh, Lowell and the PNP and big game James, you know, we always do those. Those are pretty cool.


[User] Please transcribe this text

[Assistant] Uh, when we able to get those done. Uh, so that one is also that that's, that'll be August the 21st, just to let some of the family members know. Matter of fact, let me see if I could put it up on the screen for some of the family members who see, but it'll be August the 21st fam that will be, um, having the,


[User] Please transcribe this text

[Assistant] The NFC South Roundtable with Panther Nation Podcast, Big Game James.


[User] Please transcribe this text

[Assistant] The coma in big low country will all be in a house on.


[User] Please transcribe this text

[Assistant] All Monday, August the 21st. So just be looking out for that fam. That'll be real fun to kind of end up getting in there.


[User] Please transcribe this text

[Assistant] And talking some smack with our NFC South brethren. You know, so anyway, with that being said, just a few things that'll be the end. I appreciate you guys for being here.


[User] Please transcribe this text

[Assistant] Much love to my dog Lou, man. How you doing, sir?


[User] Please transcribe this text

[Assistant] It says NFC soft throttle table. Much love. Yeah. We're going to talk a little smack, man. We're going, uh,


[User] Please transcribe this text

[Assistant] Talk some good, some football, man, and we're going to be alright, man. It's going to be fun talking to the family members, bro.


[User] Please transcribe this text

[Assistant] Those are great shows, man, and I enjoy them. Hope you guys enjoy those shows as well.


[User] Please transcribe this text

[Assistant] They real fun and a low man. Make sure you wear your shirt, bro. Remember you, y'all you still on under the bed until we play in the NFC South. The schedule makers did us a great job. You guys, we don't play you guys to after the bi-week. So I get extra long, uh, uh, a good period to kind of pick at you.


[User] Please transcribe this text

[Assistant] And, uh, kind of, you know, make sure low when you come to the NFC south round table low.


[User] Please transcribe this text

[Assistant] You gotta put the score T on brother. You gotta rock the score T.


[User] Please transcribe this text

[Assistant] Yes, it did. Yeaah. I'm asking to put the score to y'all, man. Low, you still, bro. We still got you, Low. Who that nation got y'all all the way till after the bye week, bro.


[User] Please transcribe this text

[Assistant] So I think that was cool that they set that up. It's like, man, little lost it.


[User] Please transcribe this text

[Assistant] Big Q on the Who Dat Nation, man. Let's go ahead on and set this all the way up to further back that we can get it. And then we'll make the Saints and the Falcons play after the bye week twice.


[User] Please transcribe this text

[Assistant] So we got an extra long time for them to kind of sulk it up that the Saints done swept them out of here. And then they got to wait that long to get another opportunity. So yeah, there you go.


[User] Please transcribe this text

[Assistant] You know, wear that shirt with pride, Lord. I told you, y'all, you are winning on that shirt.


[User] Please transcribe this text

[Assistant] You're winning. That's not, you're not wearing the shirt as the final score as a loser. You're showing the fact that you guys at the moment were winning.


[User] Please transcribe this text

[Assistant] That's a winner tee. The score tee is a winner tee for the Atlanta Falcon family members. Hello. You're looking at it wrong, brother. You're looking at it wrong.


[User] Please transcribe this text

[Assistant] All right fam, let me get on outta here. I appreciate y'all man for being in the stream. Y'all hit the like button, hit the subscribe button. Also feel free to share the show on your social media feed.


[User] Please transcribe this text

[Assistant] Check out the links if you want to join the stream, man, to help out the whodatdaily.com. You can go to the whodatdaily.com, links in the description section below. Feel free to share the articles. We got writers that are writing, boxing, pro football, pro basketball.


[User] Please transcribe this text

[Assistant] All that stuff is going on, college football. Feel free to show them some love, man. Y'all know how we rocking here. And, uh, we, we need your support in that way, just sharing articles because this is us, man. This is who that nation is, our collective man, as we are pushing past these ESPN people and all. This is our way of doing things. This is from.


[User] Please transcribe this text

[Assistant] Straight from the family members themselves, and that's how it's supposed to be. That's just our words, our thoughts, and we are here, man. You can't ignore us no more. Much love to the fam. I'ma holla at y'all on the flip side. Who dat? And I'm out.


[User] Please transcribe this text

[Assistant] Hey everyone, welcome back to my channel and in the new video we are continuing the Data Structures Algorithms Interview Preparation Bootcamp. We just finished with binary trees, we did the complete 5 hour long questions video, so if you want to solve any binary interview question, watch that video.


[User] Please transcribe this text

[Assistant] The playlist link, the everything, all the links, code links can be found in the description below. If you're preparing for your interviews, you can check that out. But in this video, we're going to start with heaps. Very important data structure for coding interviews. It's easy, nothing too difficult, very simple.


[User] Please transcribe this text

[Assistant] And, uh, we'll be making two videos. So in this video, I'll teach you about Heaps. What are Heaps? How it works, the benefits, complete theory, complete code, heap sort, priority queue, and custom implementation. So everything from scratch, we will learn everything about Heaps.


[User] Please transcribe this text

[Assistant] And in the next video, we'll do a Heaps interview questions video. So if you have been following my bootcamp, you know the format I go with. I do a theory video, then I do a questions video. So after that, we'll do probably a, I don't know, 5-6 hour long, because Heaps is an important topic. There are many important concepts in it, so I'll do that.


[User] Please transcribe this text

[Assistant] But after this I'll, I believe I'll also add in HashMaps.


[User] Please transcribe this text

[Assistant] Uh, how HashMaps work and how HashMaps introduction, because uhm,


[User] Please transcribe this text

[Assistant] Heaps and hash maps get questions that use both of these data structures. So I want to make sure I cover both.


[User] Please transcribe this text

[Assistant] So, but don't worry. What I would recommend is follow the order in which I have added it in the playlist.


[User] Please transcribe this text

[Assistant] It's, uh, whatever you need. Okay, that's all you need.


[User] Please transcribe this text

[Assistant] So let's learn about heaps in this video. In the next video we'll do heaps questions and learn about hash maps and all sorts of things. If you haven't already.


[User] Please transcribe this text

[Assistant] Make sure you like, share and subscribe. Comment if you like the video because it will help it reach more people. You can join the learning public initiative. Share it on socials using hashtag dsawithkunal. And, uh, yeaah. Let's get started with Heaps.


[User] Please transcribe this text

[Assistant] So first I will tell you about why we are using Heaps. Then I will tell you about how it works.


[User] Please transcribe this text

[Assistant] Then we'll see it in action, like how to, how to make heap, heaps, right?


[User] Please transcribe this text

[Assistant] So forget about, you know, what is heap or whatever. Just think about why we are learning about heaps. Okay, Kunal, we don't know anything about heaps. That's fine.


[User] Please transcribe this text

[Assistant] We'll learn about it later, what heaps are, how it works, but first tell us, why? Why are we working with heaps? So,


[User] Please transcribe this text

[Assistant] The simple idea is that whenever you want to get a particular element, a particular item, let's say, you want to get some item that, uh, follows some sort of a criteria. For example, storing, uh, 10 numbers. So the criteria is smallest number. I want to get the smallest number. Okay? That is the criteria. Now, like Kunal, how are we going to do this? How to do this?


[User] Please transcribe this text

[Assistant] So, you can store it in an array. You can search for the element. You can search for the element, uh, it will take, you know, you can do like, uhm, linear search if it's an unsorted array. And, uh, you can store it in a tree if you want. Okay, you can do all sorts of things. But the idea is that my main problem, my main concern, my main task, for example, my main task is to get that


[User] Please transcribe this text

[Assistant] Smallest item. That's my main task. Meaning, I give you 10 numbers. Okay? I'm like, hey, here are 10 numbers.


[User] Please transcribe this text

[Assistant] I'll give you first number, then I'll give you second number, then I'll give you third number, you'll store it in your data structure. I'll give you fourth number, you store it in your data structure. Give you fifth number, you store it in your data structure. So on and so forth, I give you ten numbers. Now I'm like, give me the smallest item. So let's see how that works. So here's my whiteboard. And here if I say, let's say I'm storing the numbers in array. Okay, no problem. So I store the number in array. I give the first number three. Second number I give, uh,


[User] Please transcribe this text

[Assistant] Eight. Third number I give, four. Fourth number I give, nineteen. Then I gave, twenty. Then I gave, two. Then I gave, thirty-six. I give these many numbers. One, two, three, four, five, six, seven. Now the next question is, okay, I have just given you seven numbers or n numbers. Can you please find the smallest number in the, all the numbers I have given to you? That is one condition. Smallest number.


[User] Please transcribe this text

[Assistant] This condition can be anything, but just to simplify the process, I have taken a


[User] Please transcribe this text

[Assistant] Simple condition. It can also be, give me the maximum number or it can also be something like, uh,


[User] Please transcribe this text

[Assistant] Let's say these are, you have done object-oriented programming. So let's say instead of numbers, these are human objects. So you can be like, give me the smallest age or something like that. For simplicity, let's say smallest number is the criteria over here. Please don't, don't worry too much, okay. Think about the criteria. That's the main point over here.


[User] Please transcribe this text

[Assistant] So the criteria is Kunal, give me the smallest number of all the n numbers I have given you.


[User] Please transcribe this text

[Assistant] You'll be like, okay, it's in an array, I will just do a linear search. So in O of n, I can give you


[User] Please transcribe this text

[Assistant] Smallest number. You're like, okay, that's nice, not bad.


[User] Please transcribe this text

[Assistant] But the thing is, my main task, what I want this data structure to do, my main task is that I want the conditioned item. So for example, in this case,


[User] Please transcribe this text

[Assistant] I want the smallest item as fast as possible. Let's say constant time. Means in just one single step, give me that item.


[User] Please transcribe this text

[Assistant] Smallest item. In just one single step. So I give you 10 numbers, I give you 100 numbers.


[User] Please transcribe this text

[Assistant] That's fine, you will keep inserting that in a data structure of your choice, whatever you like, linked list, array.


[User] Please transcribe this text

[Assistant] Or heaps, for example. You don't know about heaps, but we will learn. That's actually the answer, spoiler alert.


[User] Please transcribe this text

[Assistant] Give me the smallest number of all of these hundred numbers. That answer, like okay, this is the smallest number.


[User] Please transcribe this text

[Assistant] Should be in constant time. No searching required, nothing in constant time.


[User] Please transcribe this text

[Assistant] How can you do that? Now you'll be like, okay Kunal, let's store it in an array only. But every time you insert an element, sort the array.


[User] Please transcribe this text

[Assistant] Every time you insert the element, sort the arrays. For example, I'll be like, okay, insert, uh, three, so initially it's empty. It'll be like insert eight, okay, eight inserted. Now I'll be like insert four, okay, four inserted. But, you can see now the array has become unsorted, so I will sort it.


[User] Please transcribe this text

[Assistant] Like insert 19, okay, added. Insert 20, added. Insert 2, okay, added. But now it's unsorted, so sort it.


[User] Please transcribe this text

[Assistant] Insert 36, add it, so on and so forth. Now I'll be like, okay, uh, give me the smallest element. You can now give it in constant time, because it's the element at the 0th index.


[User] Please transcribe this text

[Assistant] Inserting an element is taking O of n time. Why? Because in the worst case scenario, you insert an item, then you have to sort the array or whatever.


[User] Please transcribe this text

[Assistant] Or O of n squared, whatever sorting algorithm you are using, not O of n.


[User] Please transcribe this text

[Assistant] Worst case scenario, you're getting, like, you do either merge sort, whatever, and, uh, it's taking extra complexity. Okay? So, for inserting an item, it's taking, let's say, on an average, o of n log n to insert.


[User] Please transcribe this text

[Assistant] So the answer that you are getting, like Kunal, you said that


[User] Please transcribe this text

[Assistant] I'm storing the data structure and the main purpose of data structure is to give me the query.


[User] Please transcribe this text

[Assistant] Which is the condition item, which is smallest item or largest item or whatever the condition is in constant time. This data structure is doing that. But the problem is that inserting an item is taking a lot of time.


[User] Please transcribe this text

[Assistant] We will try to maintain the smallest item at the very first index, that is fine. Can you reduce this?


[User] Please transcribe this text

[Assistant] Can you maybe make it O of log n? To insert one item, it will take log n time. Can you do that? That's the question. Yes. Answer is heap.


[User] Please transcribe this text

[Assistant] Using heaps you can do it. So now, I believe you are able to understand why we are using heaps. In any question when you are given condition, like okay, you are given, uh, 12, n number of movie reviews, IMDb movie reviews out of 10.


[User] Please transcribe this text

[Assistant] And you have to find the highest movie review at a constant time. So you will store it in a heap. I will show you how the structure is of heap and everything. But uhm, yes. Okay. That's why we use heap. Anyone asks you why we use heap? Given a condition on a collection of items.


[User] Please transcribe this text

[Assistant] Like okay, I give you n items, find me the smallest item, that's the condition, smallest item in constant time. So heaps will be used. O of 1 in constant time, you will be able to get that item.


[User] Please transcribe this text

[Assistant] If you want to add new items, it will take log of n. How it will take log of n? You don't know yet. I haven't taught you that. I will teach you. Just know that it will take log of n. How? I will tell you. Okay.


[User] Please transcribe this text

[Assistant] So, that's very simple. Uh, let's move forward to how heaps work, structure and why it takes log of n and everything. Okay. So, heap structure. Uhm,


[User] Please transcribe this text

[Assistant] Heap is actually stored in the form of an array only, like internally it is stored in an array. So, it will be stored as an array, but it will be represented as a tree. It will be represented as a tree. For example, what I do is that, uh,


[User] Please transcribe this text

[Assistant] I am going to first tell you how the heap data structure is stored.


[User] Please transcribe this text

[Assistant] Okay, now the doubt you will have over here is Kunal, okay, how are you determining that these, you know, values are like, when we add, how do you make sure that the smallest item always, let's say the biggest item always stays in the very first position? We will talk about that later.


[User] Please transcribe this text

[Assistant] Okay, right now, please don't have these, have these doubts. Right now, I am answering the question about the structure of hips. How is it actually stored? Okay? So,


[User] Please transcribe this text

[Assistant] Here, I have skipped 0th index. Let's say I told you in reality it will be stored as like an array in reality. But we will visualize it like a tree.


[User] Please transcribe this text

[Assistant] So for simplicity purpose, I have skipped 0th index. Leave it empty. Okay, no problem. So here you can see this is my array.


[User] Please transcribe this text

[Assistant] Okay, this is let's say something called, let's say if the question is, I give you n numbers, give me the maximum item in constant time.


[User] Please transcribe this text

[Assistant] Here the maximum is 16, you will just return the first element, which is 16, so that is correct. It is true.


[User] Please transcribe this text

[Assistant] Okay, some of the properties from which, what we can see over here. Property number one here, it is a complete binary tree.


[User] Please transcribe this text

[Assistant] Here you can see I have listed down index number 5 has 7, here also index number 5 has 7 in the tree.


[User] Please transcribe this text

[Assistant] So complete binary, you know what a complete binary is? Complete binary is


[User] Please transcribe this text

[Assistant] Every level is full except for the last level which is the leaf and the leaf starts from left to right. So, I have two here, four here, next item will here, then here, then here, then here. Okay.


[User] Please transcribe this text

[Assistant] Okay, complete binary tree. The next thing I want you to notice is that point number two, every node


[User] Please transcribe this text

[Assistant] That you can see here, since this is a


[User] Please transcribe this text

[Assistant] Maximum heap, a max heap if you will. Because


[User] Please transcribe this text

[Assistant] We want maximum item in constant time, so it's called max heap. Here you will see every node value, every node value is actually greater than equal to


[User] Please transcribe this text

[Assistant] For example, 14, 14 will be greater than equal to all the things below it. That is true.


[User] Please transcribe this text

[Assistant] Notice something, even though I have the maximum item at the very first index, as you can see over here, maximum item at the very first index. Here, you will see that this may not be sorted.


[User] Please transcribe this text

[Assistant] Not a problem. My concern is that the first element in the array should be maximum because that's my main problem. I want the maximum item in constant time. How we will maintain this? We will tell. I will tell you later. Okay, now another doubt.


[User] Please transcribe this text

[Assistant] Kunal, you are saying it is stored in an array, but how is it represented as a tree? What is the logic behind it? What is the logic behind it? Let's see. The logic is very simple. Here, I can see that the root of the tree is equal to, let's say, if we say i is equal to 1. That is true. That is true.


[User] Please transcribe this text

[Assistant] Okay, for any root, sorry not any root, for any node, let's say the


[User] Please transcribe this text

[Assistant] Parent of that node, let's say if I talk about a node, what is the parent?


[User] Please transcribe this text

[Assistant] Can you see that if the number is i, if the index is i, the parent is i divided by 2. What? 9 divided by 2 is integer number 4 because 4.5 so 4.


[User] Please transcribe this text

[Assistant] Index number 7, 7 divided by 2, integer value 3, 6 divided by 2, 3. So, the parent index of 6 and 7 is going to be equal to 3.


[User] Please transcribe this text

[Assistant] But how are we representing in a tree? This is how. Parent of every, you know, every index i, the parent is going to be equal to what?


[User] Please transcribe this text

[Assistant] I divide by 2. So, if I look at the array, I say at index number 6, I have 9. So, in this array, who is the parent of index number 6? That's easy. 6 divided by 2, 3. So, parent of 9 is 10. And that is true. That's how the tree is represented.


[User] Please transcribe this text

[Assistant] Let's see if I talk about 3. So index number 3 has left equal to 6.


[User] Please transcribe this text

[Assistant] Index number 2 has left equal to 4. Index number 1 has left equal to 2. So, it's just doubling. Left of any index i is equal to 2 into i.


[User] Please transcribe this text

[Assistant] What is right? Uh, index number is 2, then what is right? Right is equal to 5. Index is 4, right is equal to 9. Index is 3, right is equal to 7. Okay. So, similarly again we have seen the pattern. Right of any index is equal to 2 into i plus 1.


[User] Please transcribe this text

[Assistant] This answers the question of how the tree, uh, how the heap is actually represented. In reality, it will be stored in array. We will read it like a tree, to be more specific, a complete binary tree.


[User] Please transcribe this text

[Assistant] And, uh, every node will have value greater than equal to all of its children.


[User] Please transcribe this text

[Assistant] The maximum item or the minimum item whatever you need will always be at the very first index. The rest of the array may not be sorted. But what the rest of the array will have is this condition number two. Every node greater than equal to all of its children. And how is this array represented in a tree? These rules.


[User] Please transcribe this text

[Assistant] Because of this formula, are there any pointers required?


[User] Please transcribe this text

[Assistant] Like in, you know, when we have a node class, we have like node next, node, node left, node right entry. Is that required now? No.


[User] Please transcribe this text

[Assistant] Because we are getting the answer directly from formula. No pointers required, that is why. No pointers. Well, Java doesn't have pointers, but you get my point. Unintended.


[User] Please transcribe this text

[Assistant] Alright, okay. Now, one more thing left is, uh, what is the height of this binary tree? Complete binary tree, what is the height?


[User] Please transcribe this text

[Assistant] For n elements, you know this, we have done three playlists and videos. Log n. Okay. Height.


[User] Please transcribe this text

[Assistant] Please don't ask me why. I have covered it in detail in the trees video. If you want to learn more about complete vanity tree and, uh, how the height is logged in and anything, please watch that video. Okay, so,


[User] Please transcribe this text

[Assistant] We learnt about the motivation behind heaps.


[User] Please transcribe this text

[Assistant] We learnt about how heaps will be stored in my program, in my computer, in my data structure, how it is represented, we saw that. So it will be stored in an array, but in reality we will look at it like a tree.


[User] Please transcribe this text

[Assistant] We will use this formula to get those parents left and right for every node. That is why these pointers not required. Now


[User] Please transcribe this text

[Assistant] Few unanswered questions, some things that you don't know right now.


[User] Please transcribe this text

[Assistant] Which is, Kunal, when you add a new item, let's say you add in, uh, 37. Okay?


[User] Please transcribe this text

[Assistant] So in reality 16 should be replaced with 37 because you said max heap in this example, this is max heap. So max heap will always have the highest item at the very first index.


[User] Please transcribe this text

[Assistant] And we know that we insert from left to right at the very last level. So let's say for now at index number 10, here I insert 37. Now, my heap has become wrong because 37 should come in the place of 16. So Kunal, how would you move this thing up? That's the main question. Question number 1, that's the doubt. Doubt number 2 is that when you have to remove an item, how will the tree restructure?


[User] Please transcribe this text

[Assistant] And let's say in this case we are only talking about removing the item at the very first index.


[User] Please transcribe this text

[Assistant] That's the whole point, right? If you want to remove anything from the middle or something like that, then just use arrays.


[User] Please transcribe this text

[Assistant] Or normal binary. Why using heaps? Only using heaps when you are


[User] Please transcribe this text

[Assistant] Confident that you are working with a condition. That's what you're going to be working with. So, removing item, let's say you have to remove


[User] Please transcribe this text

[Assistant] Obviously the first item, so the maximum item, just give me the maximum item, remove it. So like okay Kunal, I, I will remove this, not a problem. But now this area is empty. Now this is empty.


[User] Please transcribe this text

[Assistant] How do I make sure that the next largest element is replaced over here? How do I make sure that happens? These are two questions you may have right now.


[User] Please transcribe this text

[Assistant] Okay. So, rest everything is clear.


[User] Please transcribe this text

[Assistant] Now let's answer these two questions, how to insert and how to delete.


[User] Please transcribe this text

[Assistant] Okay, so what I'll do is, let's say I start, uh, a new, uh, a new, a new tree, okay, a new heap.


[User] Please transcribe this text

[Assistant] And let's say we do minheap now. Minheap means in constant time, I need minimum item. So, at the very first index, we will have minimum item.


[User] Please transcribe this text

[Assistant] At first, I will insert anything. So let's say I insert 8.


[User] Please transcribe this text

[Assistant] So 8 will go over here because nothing is available. So index number 1, 8. Now I insert, let's say I insert 7. So I will insert 7.


[User] Please transcribe this text

[Assistant] Now seven will go, let's say first I will insert because it's a complete binary, so from left I will insert seven at index number two.


[User] Please transcribe this text

[Assistant] In reality, it is being stored in like an array like this, but this is how we are visualizing it. So I am writing both the ways so you understand. But now the, there is a violation. Because it's a min heap, minimum item should be at the very top. So, we are going to check. The item that we have just inserted, check its parent.


[User] Please transcribe this text

[Assistant] So, you can see it makes sense. This entire array may not be sorted, but this thing is important. First item should be minimum. 13, here, and let's say after that I insert 5. So, let me just write this down. 1, 2, 3 index.


[User] Please transcribe this text

[Assistant] Both index, five index, six index, seven index, eight index. Now I insert five. I insert five, and it's like, hey, you have just inserted five, index number nine, that is violating the condition. Violating the condition. So, please remember one thing.


[User] Please transcribe this text

[Assistant] Here I know that for every node, value of every node is less than equal to all its children. Make sense? So, value of 10 is going to be less than, has to be less than all the children.


[User] Please transcribe this text

[Assistant] Value of 9 has to be less than all of its children. Value of 8 has to be less than all of its children. Right now because of 5 that is violated, but in general. So, I know, one thing I want to share is,


[User] Please transcribe this text

[Assistant] Obviously, I'm going to check upright. If this is violating the condition, then I have to send it up. So, I will just check it from up.


[User] Please transcribe this text

[Assistant] So, is the parent of 5 that I have just inserted and you can find the parent very easily. N by 2. Is the parent of 5 greater than 5? Yes, it is. Okay, swap. So, I will swap it.


[User] Please transcribe this text

[Assistant] Five ten will be swapped. In reality, it will be like this.


[User] Please transcribe this text

[Assistant] Now you'll be like, Kunal, do you have to check it with the other, other side of the, do I have to check it with 13? Think about it. No. Because I know that 13 was actually greater than whatever was over here. So if 5 was smaller than 10,


[User] Please transcribe this text

[Assistant] Then 5 is automatically going to be smaller than everything that is over here, which is only just 1, because it's complete binary. I think about it, now, if I know that, see, in reality, for 10, I know that 13 is greater than 10. Okay, so I'm checking, if 5 is less than 10, then of course, 5 is also going to be less than 13, hence you don't need to check.


[User] Please transcribe this text

[Assistant] Why is 5 going to be less than 13? Because 13 is greater than 10. Makes sense.


[User] Please transcribe this text

[Assistant] So I checked like okay I added 5 over here first at index number 9. I'm going to check here is 5 less than 10.


[User] Please transcribe this text

[Assistant] Yes it is, okay swap. Now do I need to check whether 5 is less than 13 or not? No! Because I know automatically all the numbers below 10 are already greater than 10.


[User] Please transcribe this text

[Assistant] So if 5 is less than 10, obviously it's going to be less than what is greater than 10. Very simple mathematics. Okay? Now, keep checking till you find that okay, it is not breaking any laws.


[User] Please transcribe this text

[Assistant] So, I know that now for 5, again check the parent. Now the parent is 8. Is 8 greater than 5? Yes, it is. Swap again.


[User] Please transcribe this text

[Assistant] Now check with the parent again. Now the parent is 7. Uh, is 7 greater than 5? Yes, it is okay. Again, swap.


[User] Please transcribe this text

[Assistant] And now I can't go any, any more above. So... Done.


[User] Please transcribe this text

[Assistant] How easy was that? This is known as upheap method.


[User] Please transcribe this text

[Assistant] And since you know I'm only checking it once every level, only like once every level, I started like this and this and this. So,


[User] Please transcribe this text

[Assistant] One every level and total how many levels we have log of n, so complexities of log n to insert an element. Easy.


[User] Please transcribe this text

[Assistant] Sounds good? That's how you insert elements in a heap. Very simple. Try running it, pen and paper.


[User] Please transcribe this text

[Assistant] Now let's look at how to remove elements. Okay, now removing an item from heap. This is actually very easy. I'm not enjoying.


[User] Please transcribe this text

[Assistant] You know, I want to teach graphs and dynamic programming. Heaps is too easy.


[User] Please transcribe this text

[Assistant] If someone gives you a question, like this is the tree given and remove an element and make sure this condition is already satisfied, you can do it. Because you have done the binary trees videos, tutorials.


[User] Please transcribe this text

[Assistant] I would say pause this video and think about it. Question is, if you want, if you remove an item, so, you all understand how to insert an item?


[User] Please transcribe this text

[Assistant] Well, let's say we remove the item in the min heap, so obviously the first item, this will be removed. Now, how do you rebalance this tree? How do you make sure that the next smallest item comes on top? How do you make sure we do that? Pause this and think about it. Okay.


[User] Please transcribe this text

[Assistant] So you know how when we inserted we just did like from the bottom to the up, this way we will do opposite. So just what you have to do is,


[User] Please transcribe this text

[Assistant] Take the last element because that I can get.


[User] Please transcribe this text

[Assistant] Very easily, because it's just at the last. And put it at the 0th index or the first index, whatever the first index is. Remove this.


[User] Please transcribe this text

[Assistant] Now search for downwards. So, start from here. Check. What is smaller, left or right? You can get left easily, right easily. 2 into i and 2 into i plus 1. Okay. Initially i is equal to let's say 1.


[User] Please transcribe this text

[Assistant] You can take i 0 as well, maybe when I, so when I code, I will take an array from 0. Not a problem. That will be simple. Very simple. What will be the values then?


[User] Please transcribe this text

[Assistant] If you take array, like, uh, what will the, what will be the parent? Parent will be instead of index divided by 2, index minus 1 divided by 2. Left will be index into 2 plus 1. And right will be index into 2 plus 2. Whatever, you can take from index number 1 also. Okay. So, I'll check. Left is smaller or right is smaller? Left is smaller. Swap it.


[User] Please transcribe this text

[Assistant] Now from again, check here. Do I have to check it from here now for 9 as well? No, I do not. I don't have to check with 9.


[User] Please transcribe this text

[Assistant] Okay, because of these conditions. Same reason as I gave previously. Similarly now for 10.


[User] Please transcribe this text

[Assistant] This will also be, this will be 7, this will be 10.


[User] Please transcribe this text

[Assistant] Now left and right, uhm, there is no right, so I will not check, otherwise it will give me exception.


[User] Please transcribe this text

[Assistant] Right, there is no right, left. Is left smaller than the current value that I am checking? No, it's not. Okay, program over, that's done. That's it. This is also doing the same thing, taking it only one, one at a time. That's why removing will also take log of n. Okay, insertion removal done. We saw the dry run as well. Uhm,


[User] Please transcribe this text

[Assistant] Try coding it. Try to code it, it's very simple, I just told you everything.


[User] Please transcribe this text

[Assistant] Told you all the formulas. Try coding it from, let's say, if we store it from 0th index itself. And, uh,


[User] Please transcribe this text

[Assistant] We saw the structure, how it's represented. We saw the, how the tree is represented using these formulas.


[User] Please transcribe this text

[Assistant] Or you can start from 0th index as well. You can calculate formulas for that. I'll write it in the code. Code links can be found in the description below. I will be coding on the browser so you can directly run it on your, uh, web page as well. So the link to the code is in the description. Is anything else remaining? No. Nothing else is remaining.


[User] Please transcribe this text

[Assistant] Now it's just simple coding part. Coding part is simple. Most of my videos, the coding part is just 5 minutes. Simple.


[User] Please transcribe this text

[Assistant] Okay, after this, we will do heap sort and priority queue in this video only. Heap sort is nothing. Okay, heap sort is easy. I'll tell you right now. So, it's so simple. Every time you are removing an item, you know that in min heap, you are removing the smallest item.


[User] Please transcribe this text

[Assistant] Okay, if I remove an item from here right now, it will remove seven.


[User] Please transcribe this text

[Assistant] And just store it, store it in a link, in an array list or a list, whatever you want to do. So n items, if you remove, it will take n into log n time, n log n heap, that's heap sort, heap sort is easy, nothing in heap sort. Okay?


[User] Please transcribe this text

[Assistant] I don't know what you want me to tell you. I feel like it when I'm teaching because I've taught in person as well. And like, it's that simple.


[User] Please transcribe this text

[Assistant] People get confused. They're like, are you sure Kunal Bhaiya?


[User] Please transcribe this text

[Assistant] Are you sure that it's, it's just this and nothing else needs to be done? Yes, what else do you want me to say? What else, what, what else can I say? Anything else remaining, any doubt you may have? No. You don't have any doubt. You feel like you have, but you don't. Nothing else is remaining. These topics are really easy. Don't worry about it. In data structures, algorithms, interview preparation, I said this many times, only two topics are challenging. Graphs and dynamic programming. Rest, everything is easy.


[User] Please transcribe this text

[Assistant] HashMaps, heaps, linked list, recursion, trees, uh, stacks and queues, object-oriented programming, strings, arrays, everything is easy.


[User] Please transcribe this text

[Assistant] Heapsort also, easy. While heap is not empty, keep removing elements, that is heapsort. What else do you want me to say? We know removing one item is login, so removing an item in nlogin, heapsort complexity nlogin. What else do you want me to say? Isn't that what heapsort is? That's it.


[User] Please transcribe this text

[Assistant] So let's code it, I did the dry run, I explained everything, time complexity done.


[User] Please transcribe this text

[Assistant] Code example done. We just saw this dry run, how it works. And uhm, yeaah. Let's just code it.


[User] Please transcribe this text

[Assistant] Okay, so here in my folder, by the way, you can check out, uh, the link in the description below. I'm just going to create new Java. I'm going to call this, uh, heaps.


[User] Please transcribe this text

[Assistant] Easy. Alright, new file, I'm going to call it heap.java.


[User] Please transcribe this text

[Assistant] That's it. Glass heap. Gonna zoom in a little bit.


[User] Please transcribe this text

[Assistant] import java.util.arraylist and class heap is something we have over here. Okay, not a problem. What I'm gonna do is that I'm gonna make this of type, uhm, like I'm gonna make it generic. Okay? So for example, you can, you know what generics are, right? So if I say something like in the heap here, I say


[User] Please transcribe this text

[Assistant] We all know what this thing is, the generics, we have done it in object-oriented programming. So, here I will have to then make this also in terms of generics.


[User] Please transcribe this text

[Assistant] There you go. Going to say type T extends comparable.


[User] Please transcribe this text

[Assistant] We all know how this thing works because we have done object-oriented programming. If you have not, please watch object-oriented programming playlist.


[User] Please transcribe this text

[Assistant] This is how we can compare two objects. This is why I'm extending it with comparables so I can compare two objects. Please understand. Okay?


[User] Please transcribe this text

[Assistant] Okay, but since we're going to swap a lot of elements, we'll be, let's say this is an array list, I need to swap two indices, so I'll just create a swap function to make my life easy. Private, not returning anything, first index, second index. Temp is equal to list dot get, first, list dot


[User] Please transcribe this text

[Assistant] List dot set. You all know how to swap two numbers, right? In an array. Two indices. Please. Please.


[User] Please transcribe this text

[Assistant] If you don't know how to swap two indices in an array list, how can you clear your interviews? Please. And then list dot set.


[User] Please transcribe this text

[Assistant] It is going to be very shameful for you if I explain to you how this method is working. This function is working.


[User] Please transcribe this text

[Assistant] Question is swap two indices in an array list. It is going to be shameful if


[User] Please transcribe this text

[Assistant] Right now, at this point of course, I explain to you how this method is working. Shameful for you. That is why I am not explaining this.


[User] Please transcribe this text

[Assistant] So watch the ArrayList videos if you have not, if you have any questions about this thing. Okay, imagine I teach you dynamic programming and you're like,


[User] Please transcribe this text

[Assistant] Kunal, what does it mean by base condition in recursion? Does it make any sense? Shameful.


[User] Please transcribe this text

[Assistant] You're learning dynamic programming and you don't know what recursion-based condition means. That's shameful. Problem is not dynamic programming, problem is you don't know recursion. So, okay, fundamental should be clear. Now, uhm, another thing I need is these things. Root, parent, uh, root I know, never mind, parent, left and right. In this example I have, if root is equal to i is equal to 1,


[User] Please transcribe this text

[Assistant] If I put i is equal to 0, so i minus 1, so parent will become, if i is equal to 0 means


[User] Please transcribe this text

[Assistant] Minus one, zero will be what? Minus one for zero.


[User] Please transcribe this text

[Assistant] So I'll just put minus 1 over here, so i minus 1 divided by 2, parent.


[User] Please transcribe this text

[Assistant] Private int parent for this index will be return i divided by 2. i in reality is what? i minus 1 because we are taking it as 0.


[User] Please transcribe this text

[Assistant] So I'm just taking index number 0 only. I'm not taking from index number 1.


[User] Please transcribe this text

[Assistant] So, minus 1, so just put minus 1 here, i minus 1 divided by 2.


[User] Please transcribe this text

[Assistant] Left of this index will be what? 2 into i minus 1.


[User] Please transcribe this text

[Assistant] 1 x 2 plus 1, 0 x 2 plus 1, 2 x 2 plus 1, so i x 2 plus 1.


[User] Please transcribe this text

[Assistant] That's it. You actually don't need this because of the rules of basic mathematics. What is the right element? Index into 2 plus 2, very simple. 2 into 2 plus 2, 6. 1 into 2 plus 2, 4. 3 into 2 plus 2, 8. 0 into 2 plus 2, 2.


[User] Please transcribe this text

[Assistant] Of type T, I will insert a value in it. How do we insert? Remember, think about it, what did we do?


[User] Please transcribe this text

[Assistant] So when you're inserting, first we will put the element at the last element, last index, not a problem. List.add value. So this will add it at the last. After this, I will try to swap it from bottom to above. This is actually called up heap. Up heap, because I'm going up. From the last index. Call up heap.


[User] Please transcribe this text

[Assistant] In p is equal to parent of this index.


[User] Please transcribe this text

[Assistant] But also, if you are at the base condition, so if you are at the 0th index, then it is over.


[User] Please transcribe this text

[Assistant] And just later, nothing else needs to be done. Start checking for the parent. So if I added stuff over here, I'll check for the parent. Is parent, you know, greater than the current value? So current item dot compare to parent


[User] Please transcribe this text

[Assistant] Should be less than zero. Means if the current item is smaller than parent, then swap.


[User] Please transcribe this text

[Assistant] List.getIndex, if item at this index


[User] Please transcribe this text

[Assistant] Means if this item is smaller than parent swap, index and parent. So, it will be swapped and then the new element that I am going to check for is the parent index. So, I am just going to call the same function again.


[User] Please transcribe this text

[Assistant] Simple, I showed you the dry run in this example as well. Very easy.


[User] Please transcribe this text

[Assistant] Okay. Similarly, you can make remove.


[User] Please transcribe this text

[Assistant] This will throw an exception because if you remove from an empty, empty heap


[User] Please transcribe this text

[Assistant] Removing from an empty heap. Not cool. So, how do we remove? Uh, remove the item at the 0th index.


[User] Please transcribe this text

[Assistant] List dot get zeroth index and this temp will be returned.


[User] Please transcribe this text

[Assistant] But swap the last element, I had the last element at the very 0th index, at the very first, that's what we did.


[User] Please transcribe this text

[Assistant] List dot set at the zeroth index, the last element. Because it may be possible that heap only has one item, so when you remove this last item, you can see this is not actually removing it, this is just getting the value. Okay? After you have done that,


[User] Please transcribe this text

[Assistant] It will be like, okay, now do the same thing you did from bottom to up. Now do it from up to bottom. So down heap.


[User] Please transcribe this text

[Assistant] Starting from 0th index. Let's make downheap.


[User] Please transcribe this text

[Assistant] Okay, down heap is what? Current index you are at, imagine that is the minimum.


[User] Please transcribe this text

[Assistant] I am not even writing any new logic, I am just writing it in code, whatever I taught you. Now, in left and right, see which one is minimum. First of all, if left exists. For example, if left is actually less than list.size.


[User] Please transcribe this text

[Assistant] If the current min that you have assumed, which is let's say we are over here, if this is actually greater than the left one, so more than zero, then min is going to be equal to left. This is also something I should not be teaching you, it's very easy.


[User] Please transcribe this text

[Assistant] Don't be like Kunal, oh you are assuming that we know everything. No, shame on you. If you think that this is something that needs to be explained. Just compare to and stuff.


[User] Please transcribe this text

[Assistant] I spent hours in object-oriented programming teaching you this. And same thing in linked list we also learnt about compare to and everything. Okay.


[User] Please transcribe this text

[Assistant] If write is less than list.size and compared to list.get


[User] Please transcribe this text

[Assistant] If right is greater than 0, means if the right element is greater than the min, then min is equal to right.


[User] Please transcribe this text

[Assistant] In the end, you will have the min value will be equal to the minimum of current left and right.


[User] Please transcribe this text

[Assistant] That you have found that either left or right one of those is smaller than the current item. In that case swap and call downheap in that swapped element.


[User] Please transcribe this text

[Assistant] So if I, it was 8 and 7 over here, I swapped the 7 for 8 here and then I will call it for 2.


[User] Please transcribe this text

[Assistant] Okay, whatever the min index is. So, I will say swap min and index and then I will just call down heap on that.


[User] Please transcribe this text

[Assistant] It will not execute if the, if you cannot find something that is smaller than either left or right. In that case, our tree is nice. Good.


[User] Please transcribe this text

[Assistant] Heapsot. Heapsot is very easy. Heapsot is a joke. I don't even feel like picking up my pen and paper and explaining it. Heapsot is simple. You have a heap.


[User] Please transcribe this text

[Assistant] Can you do heap sort on your own? Very easy. Public, let's say I remove it in an array list of type T. Heap sort throws exception.


[User] Please transcribe this text

[Assistant] List, or I can say data is equal to new.


[User] Please transcribe this text

[Assistant] While my list is not empty, just keep removing items from the list and add it in data.


[User] Please transcribe this text

[Assistant] Please don't ask me what the dis keyword is, I will lose my mind. That's it. Keep removing till the list becomes empty. O of N logging.


[User] Please transcribe this text

[Assistant] Now I can stuff in, uh, add, you know, add stuff in it, it's fine. Heap.insert, if I say 34.


[User] Please transcribe this text

[Assistant] There's a throwing exception, so should be declared.


[User] Please transcribe this text

[Assistant] 22 removed, simple. What is the next will be removed? 34, then 45, simple.


[User] Please transcribe this text

[Assistant] Instead also one more thing you can do is, uh, heap sort. Array list, list is equal to heap dot heap sort.


[User] Please transcribe this text

[Assistant] Oh, oh, oh, java.import, import, I did not import.


[User] Please transcribe this text

[Assistant] Tadaaaah. Heapswat easy. Time come, the city done, how it works done, everything done, heapswat done. This is also what is known as priority queue. Same thing. Okay?


[User] Please transcribe this text

[Assistant] You can also make priority queue with linked list if you want. It's also very simple.


[User] Please transcribe this text

[Assistant] But, uh, that's why, that's how the priority queue also works. Priority queue basically means it's a priority. Like my priority is I want to get the lowest item. So I will just use min heap. That's a priority queue. It's exactly the same thing. That's it.


[User] Please transcribe this text

[Assistant] Max heap, another type of priority queue in which my priority is maximum items. Priority queue done.