Buy and Sell Stock Interview Problem | Javascript Algorithms

Javascript Array Algorithms Practice:

You are given an array of integers which represent the price of a stock on a given day.
You want to MAXIMIZE your profit by choosing a single day to buy one stock
and choosing a DIFFERENT day in the future to sell that stock.

Return the MAXIMUM PROFIT you can achieve from this selling transaction.

In this video I'm going to show you the different approaches to tackle this problem, starting with a basic brute force approach, then switching something a bit more optimized using some intuition that we gather from some visuals.

00:00 - Intro
00:15 - Problem Statement
01:56 - Code Setup
02:06 - Test Cases
02:52 - Brute Force Visualized
05:05 - Brute Force Implementation O(n^2)
07:39 - Optimal Solution Visualized
08:45 - Noticing Peaks and Valleys
11:58 - Optimal Solution Implementation O(n)
14:35 - Outro

Тэги:

#leetcode #software_interview #javascript_interview #buy_and_sell_stock #javascript #typescript #testing #tdd #test_driven_development #interview_practice_developer #amazon_interview #facebook_interview #google_interview #fang #algorithms #javascript_algorithms #js_algorithms #data_structures #data_structures_and_algorithms #data_structures_and_algorithms_in_javascript #webdev #programming #programmer #frontend #css

Скачать видео