https://vgen.co/dhaclips
So I compiled a list of the show's links into a simple webpage, and run it on Flask development server.
She's halfway through the show.
So I compiled a list of the show's links into a simple webpage, and run it on Flask development server.
She's halfway through the show.
This is the 'front-end' I'm excited about.
This is the 'front-end' I'm excited about.
rust 🦀
I was thinking about the fibonacci sequence, and the examples I saw in code are always in its recursive form. Since the sequence has clearly defined steps on how to generate them, I tried to make an iterative one.
Of course it is possible, and it lays out pretty simply.
rust 🦀
I was thinking about the fibonacci sequence, and the examples I saw in code are always in its recursive form. Since the sequence has clearly defined steps on how to generate them, I tried to make an iterative one.
Of course it is possible, and it lays out pretty simply.
This is feeling quite nice, the mechanic and stuff is similar to BeautifulSoup4 in Pytho, but I get to take advantage of the fact that I can use DOM API.
It's pretty awesome.
This is feeling quite nice, the mechanic and stuff is similar to BeautifulSoup4 in Pytho, but I get to take advantage of the fact that I can use DOM API.
It's pretty awesome.
I learned a lot this weekend, comparing these three algorithms and paying attention to their advantages and drawbacks
These three also taught me: not all O(N^2) are equal, and what the BigO notation is really about.
I learned a lot this weekend, comparing these three algorithms and paying attention to their advantages and drawbacks
These three also taught me: not all O(N^2) are equal, and what the BigO notation is really about.
I'm going back and forth between JSDoc and Typescript right now.
JSDoc is nice nice there is no transpiling step, whereas Typescript is nice because the type annotations are where you expect it to be.
Probably going to do a larger project to get better bearing.
I'm going back and forth between JSDoc and Typescript right now.
JSDoc is nice nice there is no transpiling step, whereas Typescript is nice because the type annotations are where you expect it to be.
Probably going to do a larger project to get better bearing.
I'll probably incorrectly name these and do something wrong so yell at me if you find anything!
I'll probably incorrectly name these and do something wrong so yell at me if you find anything!
so first time it goes, it prints the expected result as expected.
then it runs into the while loop conditional,and i expect it to find the value '8', but it didn't print it to the console, so on the 2nd loop it should be null and it prints null, but what about the 3rd loop?
so first time it goes, it prints the expected result as expected.
then it runs into the while loop conditional,and i expect it to find the value '8', but it didn't print it to the console, so on the 2nd loop it should be null and it prints null, but what about the 3rd loop?
This is one of the three.
This is one of the three.
it's kinda weird looking at a web devtool in a desktop window.
Actually, that's just a browser.
it's kinda weird looking at a web devtool in a desktop window.
Actually, that's just a browser.
am I drunk or the browser is?
am I drunk or the browser is?
This time I tried doing some trivial regex (TS probably has the most intuitive way of doing regex for me, the setup is straightforward) using a RegExp object.
Though with a do..while loop with the following condition the loop behaves in a way I do not expect. Why?
This time I tried doing some trivial regex (TS probably has the most intuitive way of doing regex for me, the setup is straightforward) using a RegExp object.
Though with a do..while loop with the following condition the loop behaves in a way I do not expect. Why?
It's been a few hours of codewars fundamentals and honestly it feels great to use!
It's been a few hours of codewars fundamentals and honestly it feels great to use!
This is part of the Breadth-First Search algorithm that I have been working on.
I learned that the order of checks I do matters a lot to runtime performance. I went from 8 seconds to 4 seconds runtime just by reordering my checks to this:
This is part of the Breadth-First Search algorithm that I have been working on.
I learned that the order of checks I do matters a lot to runtime performance. I went from 8 seconds to 4 seconds runtime just by reordering my checks to this:
Directory walking with iterative Depth-First Search!
This was both a learning experience and a pain.
Realizing the need of some form of a vector to know the adjacent vertex in advance took a while, and I hit the wall multiple times.
Directory walking with iterative Depth-First Search!
This was both a learning experience and a pain.
Realizing the need of some form of a vector to know the adjacent vertex in advance took a while, and I hit the wall multiple times.
Tried implementing depth-first search on a directory walker, and it is around twice as slow compared to Breadth-First Search.
Is this expected or did I do something wrong 🤔
Tried implementing depth-first search on a directory walker, and it is around twice as slow compared to Breadth-First Search.
Is this expected or did I do something wrong 🤔
Help me run to the left ᕕ( ᐛ )ᕗ
Help me run to the left ᕕ( ᐛ )ᕗ