LeetCode #1971 - Find if Path Exists in Graph\nGiven an undirected graph represented as an array of edges, write a function to check if there is a valid path between two nodes (the start and the end nodes).\n\n**Input:**\nedges = [[0,1],[1,2],[2,3],[3,4]]\nstartNode = 0\nendNode = 4\n\n**Output:**\ntrue\n\n**Constraints:**\n1 <= edges.length <= 10^4\n0 <= edges[i][0], edges[i][1] < 10^4\n

LeetCode #123 - Best Time to Buy and Sell Stock III You are given an array where the ith element is the price of a given stock on day i. Design an algorithm to find the best time to buy and sell stock to maximize profit. You may complete at most two transactions. Return the maximum profit you can achieve. Input: prices = [3,2,6,5,0,3] Output: Max Profit: 7 Constraints: 1 <= prices.length <= 10^5 0 <= prices[i] <= 10^5

Describe a time when you had to advocate for a technical decision that differed from the consensus of your team. What was the decision, and how did you handle the pushback?