Blog
• (6-10 of 27 posts)-
Working With Linked Lists In Golang
A linked list is a linear data structure that lets you represent a group of things that are connected in a sequence. The items don't have to live in contiguous memory like arrays so adding and removing in the middle of the list can be more efficient.
-
Creating the Queue Data Structure in Golang
Queues are a fundamental data structure used everywhere in programming. They're basically arrays that restrict elements to be FIFO, or "first in, first out". This means any element that enters a queue has to wait it's turn before it can leave it.
-
Creating Stack Data Structures in Golang
A stack is a linear data structure that follows the principle of LIFO "last in, first out". Think of a literal stack of books on a desk. If you want to access the book at the bottom of the stack, you have to first remove all the ones on top.
-
Building a Simple Recommendation System in Python Using Cosine Similarity
Recommendation systems are the backbone of modern web platforms. You've definitely heard people refer to "the algorithm" of platforms like Youtube, X/Twitter, Instagram, Amazon, Netflix, etc. But how do they work? How can you build one?
-
Breaking ECDLP with a Quantum Computer: Resource Estimates from Google's Latest Research
Encryption keeps the entire internet safe for things like online banking, social media, etc. Cryptocurrencies allow conducting financial transactions online, all thanks to that same encryption, which is virtually impossible to crack. Maybe not for long.
Subscribe for Updates!
Enter your email address to hear about new posts and projects. No spam, and I'll never share your email.
Thanks for subscribing!