 Alright, guys, you guys wanted this. Today we are going to solve arrays data structure problems on a hacker rank. I know you guys really wanted this instead of doing live stream. So I'm going to do tutorials now. For now, I'm going to do tutorials. How we're going to do this is basically I'm going to solve all the arrays questions and the stacks and the cues and the trees, maybe link lists, heaps, graphs, and then so on and so forth. So yeah, we're going to try to solve all the data structure problem. But we're going to try to see how we're just going to try to solve all them. Alright, and I'm going to explain to you guys how to solve them. So I already solved this one. Basically, this problem is called arrays DS. You're given an array and you just need to reverse it. Yeah, you just have to reverse the array. So there's a couple ways to do this. I'll just show you guys what I think is the best way to do this. So what you can do is what you could do is you can start from the beginning and loop to the middle. And each time loop to the middle, you swap it with the end. So this is going to be one swap with two. And then four is going to swap with three. So to do that, if I'm looking from beginning to the end, I'm just going to loop from beginning to the end, not begin to them, I'm going to move from beginning to the middle. And I'm just going to take the length of the array, like the final length of the array. So in our case, there's four. And we're just going to subtract four from each of the current index. So as you can see here, 1432 right, arrays index from zero instead of one. So the index here is going to be zero, one, two, and three. Correct. So then if I'm going to reverse all the values, I'm going to loop through from the beginning to the middle. And I'm just going to swap it with the end. So to swap it with the end, I'm going to take the length of the array, which is what we call the n in this case, right is four in this case. And we're just going to subtract by each of the our index of our front index. And that's going to give us the index at the end, which is the last value at the end, and then we could swap it. So if the nicoto looks something like this, so move from zero and we'll move to the middle. So size over two. And then I plus plus, and then here I'm just going to swap array at I with R. Actually, do they want do they want us to? Can we modify the original array or? Okay. I'm going to assume we can modify it. So it's going to be a array that size minus one minus I. And then we return a. So basically, all we're doing is we're just going to look through from beginning to the middle. And then we take the last value last index and subtracted by I, and I'll give us the give us the last value at the end. And then we just we just swap it with the value at the beginning. And we loop through this until the middle. So then this one will swap with two and four will swap with three. So yeah, I think that's it. We submit. I believe this is correct. Yeah, and that's it. It's basically just this problem. We successfully solve arrays DS. Yeah, I hope you guys enjoy this quick tutorial. Raycom subscribe help us get to 10k subs. And I have a lot of time so I might go over the next problem and upload that later today. But yeah, Raycom subscribe. I'll check guys at a peace.