Login
Discover
Waves
Communities
Login
Signup
Topics
#data-structures
Global
Trending
Hot
New
Top
#data-structures
New
Top communities
Create your community
latest #data-structures created topics | Ecency
cryptoizotx
programming
2018-12-26 17:00
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 Stack<Item> { // initialize an
$ 0.000
1
cryptoizotx
swift
2018-12-24 02:04
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. func getMaxProfit(_
$ 0.000
2
cryptoizotx
programming
2018-12-22 17:46
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 Implementation Function can be implemented
jordaan01
dmania
2018-05-14 20:39
!
Low reputation account with an unverified outbound link, Reveal content
Linked list
View post on dMania
idea-make-rich
Shadow Hunters
2026-08-10 14:23
Published via Ecency
Promoted
👉 Guess The Shadow Contest - Round 109
Namaste🙏, Shadow Hunters family! 🎺 Announcement 🎺! Guess The Shadow Contest Round-108 is now closed. Winners will be announced and rewards will be given within the next 24 hours. Guess The Shadow Contest
ivlad
programming
2018-04-04 10:15
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, n]. In our examples, we'll consider n=100.
justyy
programming
2018-03-23 19:28
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 MinStack { public: MinStack() { // write
black-ice
computer-science
2018-02-21 00:07
!
Low reputation account with an unverified outbound link, Reveal content
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 4.0) If you've tried to understand
orcunland
data-structures
2018-02-19 05:08
!
Low reputation account with an unverified outbound link, Reveal content
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 be done only in one programming language,
jongolson
The Kingdom
2026-08-07 04:10
Promoted
The Single Column Verse by Verse NKJV [Review]
Note: This is a repurposed video form my YouTube #bible review channel. I always want to make sure these are uploaded on chain incase...Google 'googles' me lol Ever since I received my single column Premier
amos1969
coding
2018-02-03 23:33
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 (First In First Out). The items which
amos1969
coding
2018-02-02 17:03
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 item on top of the previous one (actually
