Co -founder at Trade... • 1y
Prefix data structure, often referred to as a trie, is a tree-like data structure used for storing and retrieving a dynamic set of strings efficiently, particularly when dealing with prefix-based operations. #Datastructure #codingjourney Prefix Expression Evaluation code:
Co -founder at Trade... • 1y
"Stacks in C++: Your trusty tool for managing data with LIFO (Last In, First Out) behavior. From undo functionality to expression evaluation, mastering the stack unlocks a world of efficient data manipulation! #cplusplus #datastructures #coding" Code
See MoreRooted in Linux. Dri... • 15d
I was going through an article and found something really interesting about why Fastify is so fast Fastify’s routing engine, powered by the find-my-way library, uses a radix tree (a variant of a trie) to efficiently match incoming requests. By orga
See MoreKeen Learner and Exp... • 11d
Day 5 of learning Data Science as a beginner Topic: Using NumPy in Data Science Python despite having much advantages (like being beginner friendly, easy to read) is also famous for its one limitation i.e. it is slow. We don't really feel much abou
See MoreKeen Learner and Exp... • 2m
Day 10 of learning python as a beginner. Topic: File I/O You guys remeber I once created a to-do list (most probably on day 7)? many amazing people suggested that I should also put a history of tasks. At that time I was not aware about the File I/O
See MoreDownload the medial app to read full posts, comements and news.