Trying to Become Good at Programming to get Employed (Part One) — Transcript
Full transcript
- 0:00so you want to become good at
- 0:02programming well I mean who doesn't with
- 0:04such an amazing starting salary so many
- 0:06job opportunities out there and such
- 0:08great working conditions it's no wonder
- 0:10why millions of people want to become
- 0:12software
- 0:13developers now for those of you that did
- 0:15not rage quit my video after hearing
- 0:17that nonsense let's be real being a
- 0:19programmer can be summed up into one
- 0:21very simple word difficult most of the
- 0:24job has you sitting behind a screen
- 0:25killing your eyes your back and more
- 0:27often than not your soul and don't get
- 0:30me started on the job market right
- 0:32now it is rough so you might be thinking
- 0:35if being a programmer is so freaking
- 0:37miserable then why do so many people do
- 0:40it anyway well the answer is very simple
- 0:42the pay because even though it is
- 0:44extremely difficult it is also on the
- 0:46other hand extremely rewarding most of
- 0:49the time and as somebody that loves
- 0:51making things I too want to be able to
- 0:53program whatever my heart desires
- 0:55however there is one little issue my
- 0:57programming skills are horrendous to say
- 1:01the least this is not Maria's therapy
- 1:03hour trust me nobody wants to see that
- 1:05but to put it short I was always afraid
- 1:07afraid of starting something only to
- 1:09fail miserably at it and I even believed
- 1:11for a long time that programming was
- 1:13just going to be way too difficult for
- 1:15me to ever be able to learn and well
- 1:17that brings me to the point of this
- 1:19video see I want to prove myself wrong I
- 1:22want to show myself that not only can I
- 1:23become a programmer I can become a good
- 1:26programmer someone who is able to solve
- 1:28whatever problems get thrown her way
- 1:30without ever having to ask chatu for a
- 1:32solution and so if I want to become any
- 1:35good I'm going to have to go all in I'm
- 1:38going to have to start all the way from
- 1:39the beginning and work my way up the
- 1:41food chain and while I'm doing so maybe
- 1:44you guys will feel inspired enough to
- 1:45also go on your own little Learning
- 1:47Adventure After All We're All in This
- 1:49Together it seems so without further Ado
- 1:51project become a good programmer has
- 1:53officially
- 1:58beun
- 2:00[Music]
- 2:02[Applause]
- 2:07hello and welcome to me suffering over
- 2:09the most basic things for God knows how
- 2:11long please subscribe for more suffering
- 2:14now in my personal opinion the worst
- 2:16thing about trying to learn something is
- 2:18the very start because no matter how
- 2:20much motivation I have and no matter how
- 2:23many videos I watch about how to start
- 2:24learning programming for the first time
- 2:26it just never seems to make any sense
- 2:29and so I figured in in order to avoid
- 2:30all that I'm going to start from what my
- 2:33version of the very beginning is data
- 2:35structures and algorithms these are the
- 2:37most basic building blocks of
- 2:39programming that you can get and in
- 2:41order to help me through this process
- 2:43I'm going to enlist the help of NE code.
- 2:46a learning platform made by need code in
- 2:49order to help poor souls like me learn
- 2:51how to become better programmers and so
- 2:53yes I did pay for the pro subscription
- 2:55was it a lot of
- 2:57money kind of my goal for this video is
- 3:00going to be very simple and that is to
- 3:02finish the course and well there really
- 3:04isn't much else to say besides let's
- 3:07just start let's just get this over with
- 3:09because my
- 3:18God by the look on my face it looks like
- 3:20we are off to a great start now since I
- 3:23do have some knowledge of the basics
- 3:25thank you college for that at least I
- 3:26was able to work through the first few
- 3:28lessons quite quickly and fact the
- 3:30entire eray section was pretty much
- 3:31Child's Play The only somewhat difficult
- 3:34aspect of it was of course the leak code
- 3:36questions now leak code is a whole
- 3:38different beast and unfortunately for me
- 3:40each lesson contains one or more
- 3:41questions that are associated with the
- 3:43lesson material yes I can skip over them
- 3:46in fact I desperately want to but could
- 3:48I really consider myself a good
- 3:50programmer if I do that no and so suffer
- 3:52through all the Leo questions I
- 3:57shall okay there we go complete link
- 4:00lists were pretty simple in fact I would
- 4:02argue that the leadco questions for them
- 4:04were a lot easier to answer than the
- 4:06godamn array questions instead of
- 4:08everything stored together like an array
- 4:10you have these things called nodes and
- 4:12they kind of just point to each other to
- 4:14signify what comes next easy enough and
- 4:16after fixing a bug due to not writing
- 4:18the correct name I was ready to move on
- 4:20to the next lesson recursion now at this
- 4:24point everything seemed to be going
- 4:25quite well but I should have known that
- 4:27this was going to be the Calm before the
- 4:29storm that's without recursion recursion
- 4:32gives you a space o n but this one gives
- 4:34you space one which it makes sense I'm
- 4:36not questioning that but like why would
- 4:38you use recursion then unless we don't
- 4:40really care about space cuz ultimately
- 4:42they have the same runtime but wouldn't
- 4:45you okay I'm probably going too deep
- 4:48into this what you just currently
- 4:50witnessed is the true struggle of being
- 4:52a programmer you see one thing I quickly
- 4:54realize is how difficult it is to solve
- 4:56some Leo questions even though they seem
- 4:57to be very simple tasks in fact as you
- 5:00can see even with the solution right in
- 5:02front of me I still couldn't get around
- 5:03to understanding how the hell it was
- 5:05being
- 5:07solved this one makes zero sense what
- 5:10the [ __ ] is going
- 5:12on there we
- 5:15go what is going on here wait okay this
- 5:19is this is a little bit complex For Me
- 5:21Maybe had something to do with the fact
- 5:23that it was showing me a DFS solution
- 5:24even though I clearly had not reached
- 5:26that far into the course thank you n
- 5:28code but more so it is the nature of the
- 5:30lead code problems themselves because
- 5:32the reality is not that you have to
- 5:34understand the problem but your computer
- 5:36has to understand the problem sure I can
- 5:39write a million and F statements and get
- 5:40the job done like some people do or I
- 5:43can do the morally right thing and just
- 5:45learn how to solve it as best as
- 5:47possible from the very beginning which
- 5:49means there is no way in absolute hell
- 5:51that I'm going to be finishing this
- 5:52course in under 8 hours anyway now that
- 5:55I finally figured out how recursion
- 5:56works it was time to move on to sorting
- 5:58algorithms now I would say this went
- 6:00better than the previous section but I
- 6:02think we all know that this is only
- 6:04going to get worse and worse the more
- 6:06chapters I complete in fact I was fooled
- 6:08into thinking that everything was fine
- 6:09when I did insertion sort and actually
- 6:11understood how it worked on the first
- 6:12pass but boy oh boy was I absolutely
- 6:15wrong in fact I'm going to let this clip
- 6:17play out because I didn't realize how
- 6:18much I talk to myself when I have to use
- 6:20my brain are the two values which okay I
- 6:23got it the question is whether I can do
- 6:27this thing so we have hairs Val value of
- 6:300 + 1 which is just one so it's actually
- 6:32going to be one but we never get the
- 6:36zero so it's
- 6:39two what am I not
- 6:42getting merge
- 6:47sword I just pretty much copied off of
- 6:50this
- 6:54but of
- 6:57course it is a function
- 7:00ahuh
- 7:02wait that's where we put it in I got it
- 7:05yeah okay should we solve
- 7:08this here's the
- 7:11thing it says hard and I feel like if I
- 7:15try to do this without looking at any
- 7:18solution but prior I might hate
- 7:22myself I don't know what's better if I
- 7:25just like try to beat this into my skull
- 7:27or do I keep going
- 7:31I vote keep going I'm happy to report
- 7:34that I did eventually get through the
- 7:35hard questions after watching NE cod's
- 7:37video about 20 times more but once I did
- 7:39the rest of the section was quite easy
- 7:41and I was able to move on to binary
- 7:43search and to be honest after having to
- 7:45deal with merge sort this section was
- 7:46finished in quite a flash the only hard
- 7:48part was like usual the Leo question I'm
- 7:51having PTSD looking back at the name I
- 7:53swear this is the thing I read through
- 7:56this thing and it's just I don't
- 7:59understand what it's asking Coco loves
- 8:02to eat
- 8:03bananas there are n piles of bananas the
- 8:07ice pile Sor n piles of bananas the
- 8:10guards have gone and will come back in
- 8:13each hour she
- 8:14chooses
- 8:17banan within 8
- 8:19hours what um explain this
- 8:28please
- 8:30be
- 8:30five and
- 8:33one so we're looking oh and we're
- 8:35looking between that to see if it
- 8:40is I kind of get it and already after a
- 8:44couple of days I no longer remember how
- 8:45to answer this question all I do know is
- 8:48that I am doing binary search here see
- 8:49it's cutting the problem in half and so
- 8:51therefore you're just throwing away the
- 8:52other half making the time complexity
- 8:54log in instead of
- 8:56it yeah also if you're confused as to
- 8:58why my angle in CL clothes keep changing
- 9:00I have done the same chapters over and
- 9:03over again because if you think for one
- 9:05second that I was able to do this on
- 9:06first try you're delusional anyway back
- 9:09to the video now it looks like we're
- 9:11getting into the more complicated things
- 9:13AKA trees now again the concept wasn't
- 9:16too difficult to understand it was the
- 9:18implementation though that took me a
- 9:19second to wrap my head around it's like
- 9:21a link list except you have two children
- 9:24and if you make enough of them you have
- 9:26an upside down tree and with trees comes
- 9:28two very important topics DFS depth
- 9:31first search like the name suggest you
- 9:33go as deep as possible and then you go
- 9:35all the way up BFS breath first search
- 9:37you go one level at a time starting from
- 9:39the top and going down and if someone
- 9:42can please explain to me why this is
- 9:43called breath first search that would be
- 9:45wonderful anyway after finishing up the
- 9:47tree section came the thing that I
- 9:49absolutely hated learning about because
- 9:52for some reason I couldn't seem to
- 9:55understand how it worked once again the
- 9:57logic made sense but I I just I was
- 10:00looking at it and nothing was processing
- 10:02in my head in fact I had such a hard
- 10:04time figuring things out that I had to
- 10:06turn to chat jpt I pray to every
- 10:09freaking God out there that may exist
- 10:13I'm sorry I said I didn't believe in you
- 10:15but I'm going to drop that please help
- 10:17me solve this problem sorry for my
- 10:19mistake please please please amen let's
- 10:20go but I guess the gods decided to
- 10:22ignore my prayer because to be honest
- 10:24chat gbt did not help at
- 10:27all the Story begins with me asking chat
- 10:30GPT a very simple question to explain
- 10:33how backtracking Works in programming
- 10:35with no delay it supplies me with a
- 10:37wonderful answer explaining exactly what
- 10:39it is used for but my small brain still
- 10:41did not understand the problem and so I
- 10:43asked it to provide me with some
- 10:45examples of backtracking it says
- 10:47certainly let's take the classic example
- 10:50of the N Queen's problem it says we have
- 10:52to place an N amount of Queens on an N
- 10:55byn Chess board such that no two queens
- 10:57threaten each other it then spits out a
- 10:59bunch of code which I thoroughly ignore
- 11:01and go straight to how it goes about
- 11:03solving the problem okay so it places a
- 11:05queen at
- 11:060 fine then it places a queen at 1 two
- 11:11yeah that's fine then it places a queen
- 11:13at
- 11:1523 H there seems to be a problem maybe
- 11:20you know what I'm just not getting it
- 11:21let's just ask CHF BT to explain why 23
- 11:24is a valid move oh wait I'm right okay
- 11:26it's doing the problem again but wait
- 11:28three 3 is also not a valid move it
- 11:31falls in the path of the other queen you
- 11:33are absolutely correct and I appreciate
- 11:35your
- 11:38patience okay it's doing the problem
- 11:40again and you can't place it at 21
- 11:42either I appreciate your continued
- 11:45attention to detail and I apologize for
- 11:47the oversight let's correct the
- 11:49explanation 20 is not valid just do the
- 11:53problem over again this goes on for
- 11:56another couple of minutes of me going
- 11:57back and forth explaining why it is
- 11:59wrong and then it proceeding to not
- 12:01improve anything before I pretty much
- 12:03just break it it keeps spitting out this
- 12:05result which obviously is very wrong and
- 12:08at this point I realized that I'm
- 12:09literally fighting with a
- 12:11machine and I just gave up and told it
- 12:13to give me a different problem and good
- 12:15for it this problem actually did work
- 12:17but at this point I just I lost all
- 12:19sense of what backtracking was so it
- 12:20didn't help me at
- 12:23all I don't think
- 12:27so
- 12:32can I zoom in it just feels so great and
- 12:34then and then and then this this is a
- 12:37little bit depressing but
- 12:44this let's go take a nap guys let's go
- 12:46take a nap after my nap which turned out
- 12:49to be just me going to sleep I woke up
- 12:51feeling refreshed and ready to tackle
- 12:53the next task heaps now heaps are quite
- 12:56similar to trees the only difference is
- 12:58that they one have a structure property
- 13:00and two have an order property the first
- 13:02says that they should have a Balan tree
- 13:05which means that if there are any
- 13:07missing children they are at the last
- 13:09level and number two there is an order
- 13:11property depending on what Heap you have
- 13:13whether it's Min or Max it just means
- 13:15that there is some priority value that
- 13:17you are storing now this didn't go so
- 13:20bad because thankfully there is a
- 13:21pre-existing data structure available
- 13:23that I can use instead of having to deal
- 13:25with the implementation and after
- 13:27quickly finishing up the Leo questions
- 13:29for this section I celebrated in the
- 13:31most ladylike way possible everything
- 13:33done heaps finished finished and now it
- 13:38was time for graphs I'm going to skip
- 13:40over hashing cuz it's super simple but
- 13:42here's the proof that I did it graphs
- 13:44are pretty similar to trees except they
- 13:46are not restricted to having just two
- 13:47children in fact they can be their own
- 13:50child that was a weird sentence and
- 13:53instead of using nodes and Link lists
- 13:55you have edges vertices matrixes and
- 13:57adjacency lists it's a lot I'm not going
- 14:00to lie this thing boggled me the first
- 14:02time I tried to solve it in fact I had
- 14:04such a difficult time grasping what the
- 14:07hell was going on that I legit had not
- 14:09one but two nervous breakdowns trying to
- 14:12figure out what the hell was going on
- 14:15once again I was lulled into a false
- 14:17sense of security after being able to
- 14:19quickly solve his DFS problem only to
- 14:21then realize that it doesn't help you
- 14:23solve the Le problem why well take a
- 14:26look at this problem and you tell me if
- 14:29you're able to figure out how to solve
- 14:30it at first freaking glance what really
- 14:33bothered me was just I didn't know how
- 14:34to tell what was an island like of
- 14:37course I know how to tell it but how
- 14:39does the computer tell what's an island
- 14:41how do I get it to tell what's an island
- 14:43what am I supposed to do already know
- 14:46what this algorithm is but it's
- 14:47basically a a breath first search we're
- 14:50just
- 14:53do so why is this
- 14:57here
- 15:00huh I'm confused thank you need code I
- 15:04get it you don't have to solve it using
- 15:05DFS but like why is it in this section
- 15:08then I want to know how to do it using
- 15:10DFS even though he didn't have a video
- 15:12for it he did provide some code for a
- 15:14DFS solution so I just kind of used that
- 15:16to figure out what to do he's like
- 15:18turning the ones into zeros and then
- 15:20backtracking and that way you can tell
- 15:21it's an island I would have never been
- 15:23able to figure this out after clearing
- 15:25my head by taking another nap I would
- 15:28was able to get through the rest of the
- 15:30section with no problems but once that
- 15:33was done I was finally at the last
- 15:34section for this course ignore bit
- 15:37operations I'm not going to do that in
- 15:38this video and that is dynamic
- 15:40programming AKA recursion with memory or
- 15:45mimo me
- 15:48memoization remember this problem the
- 15:51problem that I was answering before that
- 15:52I just couldn't understand well finally
- 15:55a couple of chapters later I understand
- 15:57what is going on it was dynamic
- 15:59programming the whole time something
- 16:01that I hadn't learned until now thank
- 16:05you other than that this wasn't too
- 16:07difficult to figure out and finally
- 16:09after definitely spending more than 8
- 16:11hours doing this entire course I clicked
- 16:13that final green check box and I was
- 16:24done yes I cut off my hair so I finished
- 16:27the course
- 16:29I feel really good about how much I
- 16:31accomplished even though I did struggle
- 16:32and suffer and cry a lot I've learned
- 16:36pretty much that when it comes to
- 16:37programming all you really have to do is
- 16:39repetition repetition
- 16:42repetition repetition did I say
- 16:44repetition repetition and testing
- 16:46testing yourself telling yourself hey
- 16:48let's just try to solve this problem for
- 16:50memory and if I can't do it well then I
- 16:53should go d a CO no we just keep going
- 16:56until we can do it and while I hope I
- 16:58hope that you guys also succeeded if you
- 17:00were following along or if you were just
- 17:01watching me suffer and well now that I'm
- 17:03done with that course I can finally
- 17:04relax and
- 17:08chill wait a
- 17:17minute wait there's more well I guess
- 17:21there's going to be a part two so please
- 17:23subscribe to see that video and I hope
- 17:25you guys have a good day I'm going to go
- 17:28cry now
- 17:30[Music]
- 17:33[Applause]
- 17:34[Music]
- 17:38now
About this transcript
This page contains the full transcript of Trying to Become Good at Programming to get Employed (Part One) by ProjectMaria, generated from the public captions YouTube serves with the video. The transcript has 3,135 words across 449 segments, with the original timestamps preserved so you can click any line to jump to that moment in the embedded player.
What you can do with it
Use the transcript to take notes, quote the speaker, build a study guide, generate a summary with ChatGPT or Claude via the YouTube Summary tool, or export it as a timed subtitle file with YouTube to SRT. You can also re-open it in the transcriber to choose a caption track available on the video.
Free YouTube transcript tool
YouTube2Text is a free YouTube transcript generator — no signup, no daily limit. Paste any YouTube link and get the full transcript instantly, with timestamps, click-to-jump, caption language selection, AI prompts for ChatGPT, Claude, and Gemini, and exports to TXT, SRT, VTT, or Markdown.