## Posts

Showing posts from August, 2021

### LeetCode - Best Time to Buy and Sell Stock Solution - The Coding Shala

Home >> LeetCode >> Best Time to Buy and Sell Stock  In this post, we will learn how to solve LeetCode's Best Time to Buy and Sell Stock problem and will implement its solution in Java. Best Time to Buy and Sell Stock Problem You are given an array of prices where prices[i] is the price of a given stock on an ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0. Example 1: Input: prices = [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. Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell. Practice this problem on LeetCode . LeetCode - Best Time to Buy and Sell Stock Java Solution Approach 1 Straight forward solution. Java Program:  class Solution {

### LeetCode - Same Tree Solution - The Coding Shala

Home >> LeetCode >> Same Tree  In this post, we will learn how to solve LeetCode's Same Tree problem and will implement its solution in Java. Same Tree Problem Given the roots of two binary trees p and q, write a function to check if they are the same or not.  Two binary trees are considered the same if they are structurally identical, and the nodes have the same value. Practice this problem on LeetCode . LeetCode - Same Tree Java Solution Approach 1 Using recursion. Java Program:  /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode left, TreeNode right) { * this.val = val; * this.left = left; * this.right = right; * } * } */ class Solution { public boolean isSameTree ( TreeNode p , TreeNode q ) { // using recursion