Buying and selling stocks
Problem:
Given an array of stock prices, find the maximum profit that can be earned by doing a single transaction of buy and sell in the given period of time.
e.g:
100, 80, 120, 130, 70, 60, 100, 125
Profit: 65
This video explains an efficient solution to buying and selling stocks problem
Website: http://www.ideserve.co.in
Facebook: https://www.facebook.com/IDeserve.co.in
Видео Buying and selling stocks канала IDeserve
Given an array of stock prices, find the maximum profit that can be earned by doing a single transaction of buy and sell in the given period of time.
e.g:
100, 80, 120, 130, 70, 60, 100, 125
Profit: 65
This video explains an efficient solution to buying and selling stocks problem
Website: http://www.ideserve.co.in
Facebook: https://www.facebook.com/IDeserve.co.in
Видео Buying and selling stocks канала IDeserve
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
Programming Interview Question: How to print all diagonal's sums for a given binary tree?
Level Order Traversal
Reverse a Linked List - Iterative
Programming Interview Question: Searching a 2D Sorted Matrix
Implement a fair coin given an unfair coin
Binary Search
Minimum length subarray of an unsorted array sorting which results in complete sorted array
Find an element in a sorted rotated array without finding pivot (minimum element)
Maximum size square sub-matrix with all 1s
Building Bridges Dynamic Programming
Leaders in an array
Find intersection of two Linked Lists - O(A + B) Time Complexity and O(1) Space Complexity
Create a balanced Binary Search Tree (BST) from a sorted array
Next greater element in an array
Spiral level order traversal of a binary tree
Programming Interview Question: Recover Binary Search Tree
Detect a loop in a linked list
Programming Interview Question: Find intersection of two Linked Lists
Find an element in a sorted rotated array
Demo of IDeserve web platform www.ideserve.co.in