Oracle Interview QuestionSenior Software Development Engineers
- 0of 0 votes
Round 1-question 1 - given an array of stock prices for n days.Write an algorithm to maximize the profit of a customer such that he can buy and sell only once.
Prove that complexity for searching in arraylist is o(n)
and adding is o(1)
Interview Type: In-Person