 Alright guys you asked for it so I'll give you guys like a sort of explanation of what I was doing over the first Amazon coding problem. I don't actually remember the second one that well so I have to look through that again but anyway the the first one was something like this where it's like it was like find the pairs of i and j in an array find number of pairs of i j in an array such that you can transform like one string to another there's something like this I believe it was something like this by adding one one character to each so like what they meant was like abc if you add one character a would become b and then b would become c and c would become d so this would be like a pair so like this the first so like let's say we have this array abc etc this to this would be like a pair and we just had to count find the number of pairs i j such that you could transform it by by adding one character like increasing the character by one to each so um if you go back to like what I was doing in the first vid in the code um you guys just see what I was doing so basically what I was doing is a solution to this would be like to do first instead of like the using two instead of using two for loops what you would do is you would just actually just um so let's say we're just going to loop through from the start to the end and we're just going to pick like the one one string so any string and then we're just going to like add one to each of the characters so a if it was a I would just add one to it so a would become b right it's the next value of the ascii table and then b would become c and then c would become d right so I would have b c d right and then um what I did was like I hashed all the each of these strings I was like a frequency frequency uh table sort of so I had a b c that would be like one count b c d would be another count so on and so forth so then when I loop through from beginning to end all I had to check was that after I got this uh string b c d I just have to check how many occurrences of b c d there were and I just add it to like a total total count and I just return it so yeah that was that was basically the gist of the code um you could look at what I was doing in the first coding challenge in the vid but yeah that's pretty much just of this um the second one I don't remember what it was but I'm pretty sure it had something to do with like sliding window I'll look back into the vid again on what I was doing and then I could explain that in another video but yeah this was like the first coding problem I had and this wasn't it took a while for me to figure this out um one of the education was that z would actually go back to a right so z is supposed like if you add one to z it's supposed to go back to a so yeah you just have to like make sure that you go to the next character and um to go to the next character you just had to just add one to the character and then just change it to like as ascii equivalent so yeah um yeah so this was the first coding problem I guess from amazon that got but yeah um hope you guys enjoyed this video rate com subscribe I'll look at the second one and then yeah peace