meta-fetcher — tiny URL meta-data fetcher that scraps the meta-data of a given URL string
#libs #library #html
https://bit.ly/3nF9lfL
#libs #library #html
https://bit.ly/3nF9lfL
GitHub
GitHub - rocktimsaikia/meta-fetcher: Simple metadata scrapper for node.js
Simple metadata scrapper for node.js. Contribute to rocktimsaikia/meta-fetcher development by creating an account on GitHub.
What language (s) are you currently learning, and why?
comment down
comment down
e-commerce_cart.zip
42.5 KB
Vanilla JS E-commerce cart functionality made by me :)
don't consider the design :/
don't consider the design :/
Unless you're physically incapable of actually coding, I think you're not too old to learn coding 💯
Even if you're 60 or 70 years old.
Coding is simply thinking, intelligence and memory.
The only disadvantage for you could be time ⏰
Coding is a skill you can pickup really quick if you can put in a decent amount of time everyday. 🚀
You can decide if you want to invest some of your time to Netflix or you want to invest it to improving your life.
The best way to pick up coding really fast is, living as a programmer.
Instead of going through your Facebook feed, you can try out apps like SoloLearn.
Instead of listening to music 🎧, replace it with a podcast 🎙that has to do with programming 👨💻
This will not only help you learn a lot faster, but also increase you interest in it ✨
Even if you're 60 or 70 years old.
Coding is simply thinking, intelligence and memory.
The only disadvantage for you could be time ⏰
Coding is a skill you can pickup really quick if you can put in a decent amount of time everyday. 🚀
You can decide if you want to invest some of your time to Netflix or you want to invest it to improving your life.
The best way to pick up coding really fast is, living as a programmer.
Instead of going through your Facebook feed, you can try out apps like SoloLearn.
Instead of listening to music 🎧, replace it with a podcast 🎙that has to do with programming 👨💻
This will not only help you learn a lot faster, but also increase you interest in it ✨
6.Suppose that all edge weights in a graph are integers in the range from 1 to |V|.
How fast can you make Prim’s algorithm run? What if the edge weights are integers in the range from 1 to W for some constant W?
7. Given MST of graph G. Let’s assume a new edge (that may or may not belong to MST) was added to the graph. What is running time complexity of figuring out does this new edge belong to MST or not? Consider all possible cases. You can use any algorithm. Is there a way to optimize your time complexity?
the one who answers this, will get [no]thing
How fast can you make Prim’s algorithm run? What if the edge weights are integers in the range from 1 to W for some constant W?
7. Given MST of graph G. Let’s assume a new edge (that may or may not belong to MST) was added to the graph. What is running time complexity of figuring out does this new edge belong to MST or not? Consider all possible cases. You can use any algorithm. Is there a way to optimize your time complexity?
the one who answers this, will get [no]thing
while developing, do u open different desktops or all softwares in one desktop
Anonymous Poll
34%
different desktops
65%
all softwares in one desktop
1%
other, leave in comments