Question Details
Problem
Given stock prices over days, find the maximum profit from a single buy-sell transaction.
Likely LeetCode equivalent
LeetCode 121 - Best Time to Buy and Sell Stock.
Tags
arrays, greedy, dynamic_programming
Full Details
Problem
Given stock prices over days, find the maximum profit from a single buy-sell transaction.
Likely LeetCode equivalent
LeetCode 121 - Best Time to Buy and Sell Stock.
Tags
arrays, greedy, dynamic_programming
Free preview. Unlock all Chime questions →
About This Question
This is a reported interview question from a chime interview during the phone round.
It covers the following topics: Dynamic Programming, Phone, Greedy, Coding, Arrays, Onsite .
More Chime Interview Questions
InterviewDB
Credit Card Operations Software: Implement Charge, Credit, and Balance Tracking for Multiple Accounts
InterviewDB
Chime SWE Onsite - Food Rating
InterviewDB
Determine Table Insertion into Database: Write SQL to Detect Whether a Row Already Exists Before Insert
InterviewDB
Chime SWE Phone - Find the Missing Number
InterviewDB
Height of Buildings: Find Visible Skyline Silhouette from a List of Building Rectangles