Best time to buy and sell stock

julian — Thu, 12 May 2022 19:44:07 +0000

Tried to solve another question from leetcode involing buy and selling a stock at a specific price. The details are outlined below.

Need some guidance because the code dosen't work but i'm sure my logic is correct here. The comments outline what i am doing step by step for this question.

var maxProfit = function(prices) {
    const buy = Math.min(prices);                   //finding the lowest value/ buy price
    const index = prices.indexOf(buy);              //get the index of the buy price
    let temp = [];                                  //temporary array to store possible sell prices
    for (let i=index; i<prices.length-1; i++) {
        if (prices[i] > prices[index]) {            //iterate for every element in prices later than buy price
            temp.push(prices[i]);                   //add the values to the temp array
        }
    }
    const sell = Math.max(temp);                    //get the highest value in this temp array
    const profit = sell-buy;                        //get profit 
    if (sell == null) {
        return 0;
    }
    return profit;
};

Merge Two Sorted Lists Problem

julian — Thu, 12 May 2022 17:44:33 +0000

Trying to solve Leetcode problem 21 - Merge 2 sorted lists. Heres the problem below and my own attempt which dosen't work. If anyone can help explain to me the flaw in my logic because it dosen't work :(.

`var mergeTwoLists = function(list1, list2) {
const final = [];

for (let i=0; i<list1.length; i++) {
    for (let j=0; j<list2.length; j++) {
       if (list2[j] > list1[i]) {
           final.push(list1[i]);
       } else if (list1[i] > list2[j]) {
           final.push(list2[j]);
       } else if (list1[i] == list2[j]) {
           final.push(list1[i], list2[j]);
       }
    }
}
return final;

};`

Forem: julian

Best time to buy and sell stock

Merge Two Sorted Lists Problem