Discover and read the best of Twitter Threads about #Lambdathread
Most recents (3)
(1/12) At LambdaClass, we’re proud to be making contributions to some of our favourite open-source projects. Here’s a quick thread on what we’re currently working on and the links to the GitHub repos 🧵
#Lambdathread
#Lambdathread
(2/12) Reth is a modular, performant and user-friendly Ethereum full-node implementation written in Rust. Built by Paradigm, it’s now open-sourced and we’re actively contributing to it. github.com/paradigmxyz/re…
(3/12) Zerosync is a STARK-based solution for syncing a Bitcoin full node instantly without downloading the entire block history. It creates a cryptographic proof that allows for validation of the entire transaction history and current balances. github.com/ZeroSync/ZeroS…
(1/15) TRIES
Let’s dive into the world of data structures! Today, we’ll talk about Tries. Trie is used because it is the fastest for auto-complete suggestions. 🧵
#DataStructures #Lambdathread
Let’s dive into the world of data structures! Today, we’ll talk about Tries. Trie is used because it is the fastest for auto-complete suggestions. 🧵
#DataStructures #Lambdathread
(2/15) A trie (or prefix tree) is a tree-like data structure that is often used to store a collection of strings. Each node in the trie represents a character in a string, and the path from the root to a particular node represents a prefix of one of the strings in the collection.
(3/15) Its main advantages are related to efficient insertion, search, and deletion operations, as well as the ability to quickly find all strings that start with a particular prefix.
ARRAYS VS. HASH MAPS
(1/12) As promised, we will continue with twitter threads about different concepts. Today we are going to explain the differences between ARRAYS and HASH MAPS, in both structures and uses. 👇🧵
(1/12) As promised, we will continue with twitter threads about different concepts. Today we are going to explain the differences between ARRAYS and HASH MAPS, in both structures and uses. 👇🧵
(2/12) What is the difference between arrays and hash maps? Arrays are faster for accessing an element at a specific position, and if you need to perform the same operation on all elements in the array, while hash maps are faster for looking up a value given a key.
(3/12) Arrays and hash maps are both data structures that are used to store and retrieve data. However, they differ in several ways:
▪️ Indexing
▪️ Search time
▪️ Insertion and deletion
▪️ Indexing
▪️ Search time
▪️ Insertion and deletion
