Wolves of Wall Street - Amazon Top Interview Questions


Problem Statement :


Given a list of integers prices representing the stock prices of a company in chronological order, return the maximum profit you could have made from buying and selling that stock any number of times.

You must buy before you can sell it. But you are not required to buy or sell the stock.

Constraints

0 ≤ n ≤ 100,000 where n is the length of prices

Example 1

Input

prices = [1, 5, 3, 4, 6]

Output
7


Explanation

We can buy at 1, sell at 5, buy at 3, and sell at 6.



Solution :



                        Solution in C++ :

int solve(vector<int>& prices) {
    int profit = 0;
    for(int i=0; i<prices.size(); i++){
        int buy = prices[i];
        while(prices[i] <= prices[i+1] && i+1 < prices.size())
            i++;
        profit += prices[i] - buy;
    }
    return profit; 
}
                    

                        Solution in Java :

import java.util.*;

class Solution {
    public int solve(int[] prices) {
        int diff = 0;
        for (int i = 0; i < prices.length - 1; i++) {
            if (prices[i] < prices[i + 1])
                diff = diff + prices[i + 1] - prices[i];
        }
        return diff;
    }
}
                    

                        Solution in Python : 
                            
class Solution:
    def solve(self, prices):
        prev_price, profit = float("inf"), 0
        for p in prices:
            if p > prev_price:
                profit += p - prev_price
            prev_price = p
        return profit
                    

View More Similar Problems

Tree: Height of a Binary Tree

The height of a binary tree is the number of edges between the tree's root and its furthest leaf. For example, the following binary tree is of height : image Function Description Complete the getHeight or height function in the editor. It must return the height of a binary tree as an integer. getHeight or height has the following parameter(s): root: a reference to the root of a binary

View Solution →

Tree : Top View

Given a pointer to the root of a binary tree, print the top view of the binary tree. The tree as seen from the top the nodes, is called the top view of the tree. For example : 1 \ 2 \ 5 / \ 3 6 \ 4 Top View : 1 -> 2 -> 5 -> 6 Complete the function topView and print the resulting values on a single line separated by space.

View Solution →

Tree: Level Order Traversal

Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the function levelOrder and print the values in a single line separated by a space. For example: 1 \ 2 \ 5 / \ 3 6 \ 4 F

View Solution →

Binary Search Tree : Insertion

You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function. Input Format You are given a function, Node * insert (Node * root ,int data) { } Constraints No. of nodes in the tree <

View Solution →

Tree: Huffman Decoding

Huffman coding assigns variable length codewords to fixed length input characters based on their frequencies. More frequent characters are assigned shorter codewords and less frequent characters are assigned longer codewords. All edges along the path to a character contain a code digit. If they are on the left side of the tree, they will be a 0 (zero). If on the right, they'll be a 1 (one). Only t

View Solution →

Binary Search Tree : Lowest Common Ancestor

You are given pointer to the root of the binary search tree and two values v1 and v2. You need to return the lowest common ancestor (LCA) of v1 and v2 in the binary search tree. In the diagram above, the lowest common ancestor of the nodes 4 and 6 is the node 3. Node 3 is the lowest node which has nodes and as descendants. Function Description Complete the function lca in the editor b

View Solution →