latest #data-structures created topics on internet

cryptoizotx

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

$ 0.000

4

jordaan01

dmania

2018-05-14 20:39

Linked list

View post on dMania

$ 0.000

1

pedrobrito2004

Web Novels

2026-05-19 17:39

Promoted

Cap. 030. Gracias por no casarte conmigo en aquel entonces. [Transmigración rápida]

El contraataque de la trágica heredera (Parte 6 de 11). Durante esta reunión, Ye Tiantian tenía mucho miedo de enfrentar el desprecio de la madre de Luo, pero no esperaba que la madre de Luo siempre sonriera,

$ 0.076

29

1

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.

$ 0.000

2

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

$ 24.077

173

8

black-ice

computer-science

2018-02-21 00:07

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

$ 0.049

3

orcunland

data-structures

2018-02-19 05:08

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,

$ 0.000

2

awesomegames007

Photography Lovers

2026-05-08 16:15

Promoted

My 4th set of Everglades photos!

$ 1.176

108

9

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

$ 0.026

4

1

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

$ 0.445

11

5

Topics