Best time to buy and sell Stock in Java || Java coding Interview Question with solution [MOST ASKED]

In this video I have explained one of the most common coding interview question i.e best time to buy and sell stock in Java.

Udemy Course of Code Decode on Microservice k8s AWS CICD link:
https://openinapp.co/udemycourse

Course Description Video :
https://yt.openinapp.co/dmjvd

We target to cover most of the questions covered in leetcode.

So what is LeetCode :
It’s a website where people–mostly software engineers–practice their coding skills. There are 800+ questions (and growing), each with multiple solutions. Questions are ranked by level of difficulty: easy, medium, and hard.
LeetCode basically has more questions, better quality, plus a strong user base.

The primary reasons why our users LeetCode: to prepare for the technical portion of a job interview.
LeetCode and the like have risen in use because of the way interviews have evolved. Engineers believe that these resources help prepare them for what they will encounter in today’s technical aptitude screenings.

LeetCode questions are often asked during interviews at the elite tech companies: Facebook, Amazon, Apple, Netflix, and Google., some more than at others. Among the Big Five, Amazon is said to place the least emphasis on LeetCode.

One of the best interview question asked is Best time to buy and sell Stock using java as programming language. We have covered it's solution using iteration. In next video we will cover the solution for Best time to buy and sell Stock using recursion.

Say you have an array for which the ith element is the price of a given stock on day i.

If you were only permitted to complete at most one transaction (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit.

Note that you cannot sell a stock before you buy one.

Example 1:

Input: [7,1,5,3,6,4]
Output: 5
Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5.
Not 7-1 = 6, as selling price needs to be larger than buying price.
Example 2:

Input: [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, i.e. max profit = 0.


LeetCode is one of the most well-known online judge platforms that you can use to practice your programming skills by solving coding questions. It has over 1,100 different problems, support for over 18 programming languages, and an active community that is always there to help you with the solutions you come up with. If your intention is to hone your coding skills, then this online judge platform is one of the best that you can use.

-------------------------------------------------------------------------------------------------------------------------------------

Code Decode Playlists

Most Asked Core Java Interview Questions and Answers :    • Core Java frequently asked Interview ...  

Advance Java Interview Questions and Answers :    • Advance Java Interview Questions  

Java 8 Interview Questions and Answers :    • Java 8 Interview Questions(New Features)  

Hibernate Interview Questions and Answers :    • Hibernate Interview Questions Java  

Spring Boot Interview Questions and Answers :    • Advance Java Interview Questions  

Angular Playlist :    • Angular Course Introduction || Angular 8  

GIT :    • GIT  

-------------------------------------------------------------------------------------------------------------------------------------
Subscriber and Follow Code Decode

Subscriber Code Decode : https://www.youtube.com/c/CodeDecode?...

Linkedin :   / codedecodeyoutube  

Instagram :   / codedecode25  

--------------------------------------------------------------------------------------------------------------------------------------

#BesttimetobuyandsellStock #javacodinginterviewquestion #javaprogramminginterviewquestions #codedecode