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

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(_

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

View post on dMania

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. 

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

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

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,

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

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