
data-structures Tag Posts Index
Explore on-chain topics from the Hive blockchain.
- →
One algorithm a day: Keeping track of the largest element in a stack
Imagine that you want to be able to access the largest element in a stack. I know you were dying to do it ! You already have implementation of the stack class: class
- →
One algorithm a day. Write a function that returns best profit you could made from trading.
Write an efficient function that takes stockPrices and returns the best profit I could have made from one purchase and one sale of one share of Apple stock yesterday.
- →
One algorithm a day: floor of the square root of the input
Description Implement a function that takes in a 32 bit integer and returns another 32 bit unsigned integer that is the floor of the square root of the input
- →
Linked list
View post on dMania
- →
The Sieve of Eratosthenes Part 1: efficiently generating primes up to n
The Sieve of Eratosthenes is an algorithm for finding prime numbers in a range. Conceptually, it's a very simple algorithm. Let's assume our range is always [2,
- →
ACM题解系列之 - 最小堆栈 (Min Stack) - Design a Stack with constant time in Push, Pop and Min
Implement a stack with min() function, which will return the smallest number in the stack. It should support push, pop and min operation all in O(1) cost. class
- →
What's a Merkle Tree?
Each node in the Merkle tree performs MD5 hashing of input data. Parent nodes concatenate the hashes of their children before hashing. (Credit: T. L. Oliver CC BY-SA
- →
Why do we only use C in data structures and not C++?
Data Structures are particular way of organizing data in a computer so that it can be used efficiently. (Wikipedia Definition) So you can not state that it must
- →
Data Structures in Python - Part 2 - Queues
Queues in Python A Queue A queue is another of the standard data structures that we find throughout Computer Science. Unlike the stack, the queue is a FIFO structure
- →
Data Structures in Python - Part 1- Stacks
Stacks in Python A Stack A stack is a standard computer science data structure that can be described as LIFO (Last In First Out). We "stack" each data
After reading these data-structures Tag Posts, you can browse the pages and collections listed below.